| 2026 | ESA | Proofs of Useful Work from Arbitrary Matrix Multiplication (Invited Talk). | Ilan Komargodski, Omri Weinstein |
| 2025 | ICML | Discrepancy Minimization in Input-Sparsity Time. | Yichuan Deng, Xiaoyu Li, Zhao Song, Omri Weinstein |
| 2025 | STOC | A Framework for Building Data Structures from Communication Protocols. | Alexandr Andoni, Shunhua Jiang, Omri Weinstein |
| 2025 | STOC | Approximating the Held-Karp Bound for Metric TSP in Nearly Linear Work and Polylogarithmic Depth. | Zhuan Khye Koh, Omri Weinstein, Sorrachai Yingchareonthawornchai |
| 2024 | ISAAC | Hardness Amplification for Dynamic Binary Search Trees. | Shunhua Jiang, Victor Lecomte, Omri Weinstein, Sorrachai Yingchareonthawornchai |
| 2023 | FOCS | Quartic Samples Suffice for Fourier Interpolation. | Zhao Song, Baocheng Sun, Omri Weinstein, Ruizhe Zhang |
| 2023 | FOCS | The Complexity of Dynamic Least-Squares Regression. | Shunhua Jiang, Binghui Peng, Omri Weinstein |
| 2022 | ICALP | A Faster Interior-Point Method for Sum-Of-Squares Optimization. | Shunhua Jiang, Bento Natura, Omri Weinstein |
| 2021 | STOC | A faster algorithm for solving general LPs. | Shunhua Jiang, Zhao Song, Omri Weinstein, Hengjie Zhang |
| 2020 | ESA | Settling the Relationship Between Wilber's Bounds for Dynamic Optimality. | Victor Lecomte, Omri Weinstein |
| 2020 | FOCS | Polynomial Data Structure Lower Bounds in the Group Model. | Alexander Golovnev, Gleb Posobin, Oded Regev, Omri Weinstein |
| 2020 | FOCS | An Adaptive Step Toward the Multiphase Conjecture. | Young Kun-Ko, Omri Weinstein |
| 2020 | SODA | Lower Bounds for Oblivious Near-Neighbor Search. | Kasper Green Larsen, Tal Malkin, Omri Weinstein, Kevin Yeo |
| 2020 | SODA | How to Store a Random Walk. | Emanuele Viola, Omri Weinstein, Huacheng Yu |
| 2019 | PODC | Massively Parallel Algorithms for Finding Well-Connected Components in Sparse Graphs. | Sepehr Assadi, Xiaorui Sun, Omri Weinstein |
| 2019 | STOC | Static data structure lower bounds imply rigidity. | Zeev Dvir, Alexander Golovnev, Omri Weinstein |
| 2019 | STOC | Local decodability of the Burrows-Wheeler transform. | Sandip Sinha, Omri Weinstein |
| 2018 | ITA | Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds. | Kasper Green Larsen, Omri Weinstein, Huacheng Yu |
| 2018 | STOC | Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds. | Kasper Green Larsen, Omri Weinstein, Huacheng Yu |
| 2017 | SODA | ETH Hardness for Densest- | Mark Braverman, Young Kun-Ko, Aviad Rubinstein, Omri Weinstein |
| 2016 | ESA | Distributed Signaling Games. | Moran Feldman, Moshe Tennenholtz, Omri Weinstein |
| 2016 | FOCS | On the Communication Complexity of Approximate Fixed Points. | Tim Roughgarden, Omri Weinstein |
| 2016 | FOCS | Amortized Dynamic Cell-Probe Lower Bounds from Four-Party Communication. | Omri Weinstein, Huacheng Yu |
| 2016 | ISIT | An improved upper bound for the most informative boolean function conjecture. | Or Ordentlich, Ofer Shayevitz, Omri Weinstein |
| 2015 | FOCS | Welfare Maximization with Limited Interaction. | Noga Alon, Noam Nisan, Ran Raz, Omri Weinstein |
| 2015 | ICALP | The Simultaneous Communication of Disjointness with Applications to Data Streams. | Omri Weinstein, David P. Woodruff |
| 2015 | SODA | Approximating the best Nash Equilibrium in | Mark Braverman, Young Kun-Ko, Omri Weinstein |
| 2015 | STOC | An Interactive Information Odometer and Applications. | Mark Braverman, Omri Weinstein |
| 2014 | STOC | Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture. | Dmitry Gavinsky, Or Meir, Omri Weinstein, Avi Wigderson |
| 2013 | CSR | Information Lower Bounds via Self-reducibility. | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
| 2013 | FOCS | Direct Products in Communication Complexity. | Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff |
| 2013 | ICALP | Direct Product via Round-Preserving Compression. | Mark Braverman, Anup Rao, Omri Weinstein, Amir Yehudayoff |
| 2013 | STOC | From information to exact communication. | Mark Braverman, Ankit Garg, Denis Pankratov, Omri Weinstein |
| 2012 | COLT | Unsupervised SVMs: On the Complexity of the Furthest Hyperplane Problem. | Zohar Shay Karnin, Edo Liberty, Shachar Lovett, Roy Schwartz, Omri Weinstein |