Omri Weinstein

734 citations
32 papers · 196 · h-index 8

Impact in

Papers in

Omri Weinstein

31 papers receiving 185 citations

Peers

Omri Weinstein
Comparison fields: 5 of 31
  • Computational Theory and Mathematics 136
  • Artificial Intelligence 111
  • Management Science and Operations Research 27
  • Discrete Mathematics and Combinatorics 6
  • Computer Networks and Communications 40
Replace Adrian Vladu with:
Adrian Vladu United States
Andrzej Szepietowski Poland
T. Feder United States
Kevin Matulef United States
Gerd Wechsung Germany
Thomas Thierauf Germany
P.R.J. Asveld Netherlands
Li-Yang Tan United States
David García-Soriano Netherlands
László Csirmaz Hungary
Omri Weinstein relative to Adrian Vladu United States Adrian Vladu's profile →
Citations per field
00.5×9.5×
Adrian Vladu · 1×
Citations per year

Countries citing papers authored by Omri Weinstein

Since Specialization
Citations

This map shows the geographic impact of Omri Weinstein's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Omri Weinstein with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Omri Weinstein more than expected).

Fields of papers citing papers by Omri Weinstein

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Omri Weinstein. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Omri Weinstein. The network helps show where Omri Weinstein may publish in the future.

Co-authors

The 25 scholars most cited alongside Omri Weinstein, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with Omri Weinstein Line = papers co-authored together Omri Weinstein links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 32 papers — load more, or switch the sort, to bring in the rest.

#Work
1 201328
2 201327
3 202118
4 201513
5 201412
6 20169
7 20159
8 20168
9
An Interactive Information Odometer with Applications.
20147
10 20157
11 20127
12 20156
13 20156
14
Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem
20125
15
Direct Products in Communication Complexity.
20125
16 20174
17
Direct product via round-preserving compression.
20133
18
Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture.
20132
19
Approximating the influence of monotone boolean functions in O(√n) query complexity
20112
20 20232

About Omri Weinstein

Omri Weinstein is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Computer Networks and Communications, Computational Mechanics and Electrical and Electronic Engineering, having authored 32 papers that have together received 196 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (25 papers), Cryptography and Data Security (10 papers), Advanced Graph Theory Research (7 papers), Optimization and Search Problems (6 papers), Machine Learning and Algorithms (6 papers), Computability, Logic, AI Algorithms (5 papers), Sparse and Compressive Sensing Techniques (4 papers) and Coding theory and cryptography (3 papers). The work is most often cited by research in Computational Theory and Mathematics (136 citations), Artificial Intelligence (111 citations), Management Science and Operations Research (27 citations), Discrete Mathematics and Combinatorics (6 citations) and Computer Networks and Communications (40 citations). Omri Weinstein has collaborated with scholars based in United States, Israel and Czechia. Frequent co-authors include Mark Braverman, Anup Rao, Amir Yehudayoff, Ankit Garg, Dmitry Gavinsky, Avi Wigderson, Zhao Song, Tim Roughgarden, Ofer Shayevitz and Or Ordentlich. Their work appears in journals such as Algorithmica, SIAM Journal on Computing, Theory of Computing Systems, Lecture notes in computer science and DSpace@MIT (Massachusetts Institute of Technology).

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact