Omri Weinstein

734 total citations
32 papers, 196 citations indexed

About

Omri Weinstein is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Omri Weinstein has authored 32 papers receiving a total of 196 indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Computational Theory and Mathematics, 22 papers in Artificial Intelligence and 9 papers in Computer Networks and Communications. Recurrent topics in Omri Weinstein's work include Complexity and Algorithms in Graphs (25 papers), Cryptography and Data Security (10 papers) and Advanced Graph Theory Research (7 papers). Omri Weinstein is often cited by papers focused on Complexity and Algorithms in Graphs (25 papers), Cryptography and Data Security (10 papers) and Advanced Graph Theory Research (7 papers). Omri Weinstein collaborates with scholars based in United States, Israel and Czechia. Omri Weinstein's co-authors include Mark Braverman, Amir Yehudayoff, Anup Rao, Ankit Garg, Dmitry Gavinsky, Avi Wigderson, Zhao Song, Tim Roughgarden, Or Ordentlich and Ofer Shayevitz and has published in prestigious journals such as SIAM Journal on Computing, Lecture notes in computer science and Algorithmica.

In The Last Decade

Omri Weinstein

31 papers receiving 185 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Omri Weinstein United States	8	136	111	40	33	27	32	196
Gerd Wechsung Germany	10	308 2.3×	164 1.5×	72 1.8×	32 1.0×	16 0.6×	34	368
T. Feder United States	7	108 0.8×	59 0.5×	67 1.7×	37 1.1×	20 0.7×	8	209
Michael Capalbo United States	9	163 1.2×	97 0.9×	72 1.8×	36 1.1×	28 1.0×	16	286
Thomas Thierauf Germany	10	281 2.1×	190 1.7×	48 1.2×	25 0.8×	8 0.3×	51	327
Jun Tarui Japan	8	179 1.3×	136 1.2×	30 0.8×	43 1.3×	6 0.2×	19	219
Rajesh Chitnis United States	7	123 0.9×	28 0.3×	58 1.4×	10 0.3×	11 0.4×	20	145
Kevin Matulef United States	6	146 1.1×	122 1.1×	48 1.2×	15 0.5×	5 0.2×	11	196
Garth Isaak United States	11	216 1.6×	38 0.3×	43 1.1×	45 1.4×	37 1.4×	31	305
László Csirmaz Hungary	9	174 1.3×	199 1.8×	42 1.1×	48 1.5×	9 0.3×	25	243
Robin A. Moser Switzerland	4	191 1.4×	78 0.7×	55 1.4×	21 0.6×	9 0.3×	5	259

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-authorship network of co-authors of Omri Weinstein

This figure shows the co-authorship network connecting the top 25 collaborators of Omri Weinstein. A scholar is included among the top collaborators of Omri Weinstein based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Omri Weinstein. Omri Weinstein is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Weinstein, Omri, et al.. (2023). A Faster Interior-Point Method for Sum-of-Squares Optimization. Algorithmica. 85(9). 2843–2884. 2 indexed citations

Weinstein, Omri, et al.. (2023). The Complexity of Dynamic Least-Squares Regression. 30. 1605–1627. 1 indexed citations

Song, Zhao, Baocheng Sun, Omri Weinstein, & Ruizhe Zhang. (2023). Quartic Samples Suffice for Fourier Interpolation. 1414–1425. 2 indexed citations

Golovnev, Alexander, et al.. (2020). Polynomial Data Structure Lower Bounds in the Group Model. 2. 740–751. 1 indexed citations

Larsen, Kasper Green, Omri Weinstein, & Huacheng Yu. (2018). Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds. 978–989. 2 indexed citations

Gavinsky, Dmitry, et al.. (2017). Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation. SIAM Journal on Computing. 46(1). 114–131. 4 indexed citations

Ordentlich, Or, Ofer Shayevitz, & Omri Weinstein. (2016). An improved upper bound for the most informative boolean function conjecture. 500–504. 9 indexed citations

Braverman, Mark, et al.. (2015). Approximating the best nash equilibrium in no(log n)-time breaks the exponential time hypothesis. Symposium on Discrete Algorithms. 970–982. 13 indexed citations

Braverman, Mark & Omri Weinstein. (2015). An Interactive Information Odometer and Applications. 341–350. 7 indexed citations

10.

Braverman, Mark, et al.. (2015). Information Lower Bounds via Self-Reducibility. Theory of Computing Systems. 59(2). 377–396. 2 indexed citations

11.

Braverman, Mark & Omri Weinstein. (2014). An Interactive Information Odometer with Applications.. Electronic colloquium on computational complexity. 21. 47. 7 indexed citations

12.

Gavinsky, Dmitry, et al.. (2014). Toward better formula lower bounds. ASEP. 213–222. 12 indexed citations

13.

Braverman, Mark, Anup Rao, Omri Weinstein, & Amir Yehudayoff. (2013). Direct product via round-preserving compression.. Electronic colloquium on computational complexity. 20. 35. 3 indexed citations

14.

Gavinsky, Dmitry, et al.. (2013). Toward Better Formula Lower Bounds: An Information Complexity Approach to the KRW Composition Conjecture.. Electronic colloquium on computational complexity. 20. 190. 2 indexed citations

15.

Braverman, Mark, Anup Rao, Omri Weinstein, & Amir Yehudayoff. (2012). Direct Products in Communication Complexity.. Electronic colloquium on computational complexity. 19. 143. 5 indexed citations

16.

Braverman, Mark, et al.. (2012). From Information to Exact Communication.. Electronic colloquium on computational complexity. 19. 171. 1 indexed citations

17.

Braverman, Mark, et al.. (2012). Information lower bounds via self-reducibility.. Electronic colloquium on computational complexity. 19. 177. 1 indexed citations

18.

Karnin, Zohar, Edo Liberty, Shachar Lovett, Roy Schwartz, & Omri Weinstein. (2012). Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. Conference on Learning Theory. 5 indexed citations

19.

Braverman, Mark & Omri Weinstein. (2012). A Discrepancy Lower Bound for Information Complexity. Lecture notes in computer science. 18. 459–470. 2 indexed citations

20.

Ron, Dana, Ronitt Rubinfeld, Muli Safra, & Omri Weinstein. (2011). Approximating the influence of monotone boolean functions in O(√n) query complexity. DSpace@MIT (Massachusetts Institute of Technology). 664–675. 2 indexed citations

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