| Faster dynamic matrix inverse for faster lps S Jiang, Z Song, O Weinstein, H Zhang arXiv preprint arXiv:2004.07470, 2020 | 117 | 2020 |
| From information to exact communication M Braverman, A Garg, D Pankratov, O Weinstein Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013 | 100 | 2013 |
| Inapproximability of densest κ-subgraph from average case hardness N Alon, S Arora, R Manokaran, D Moshkovitz, O Weinstein Unpublished manuscript 1, 6, 2011 | 100 | 2011 |
| Inapproximability of densest κ-subgraph from average case hardness N Alon, S Arora, R Manokaran, D Moshkovitz, O Weinstein Unpublished manuscript 1, 6, 2011 | 100 | 2011 |
| Direct products in communication complexity M Braverman, A Rao, O Weinstein, A Yehudayoff 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, 746-755, 2013 | 83 | 2013 |
| Training (overparametrized) neural networks in near-linear time J Brand, B Peng, Z Song, O Weinstein arXiv preprint arXiv:2006.11648, 2020 | 77 | 2020 |
| Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis M Braverman, YK Ko, O Weinstein Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 66 | 2014 |
| Approximating the best Nash Equilibrium in no(log n)-time breaks the Exponential Time Hypothesis M Braverman, YK Ko, O Weinstein Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete …, 2014 | 66 | 2014 |
| ETH Hardness for Densest-k-Subgraph with Perfect Completeness M Braverman, YK Ko, A Rubinstein, O Weinstein Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017 | 64 | 2017 |
| Massively parallel algorithms for finding well-connected components in sparse graphs S Assadi, X Sun, O Weinstein Proceedings of the 2019 ACM Symposium on principles of distributed computing …, 2019 | 62 | 2019 |
| A discrepancy lower bound for information complexity M Braverman, O Weinstein Algorithmica 76, 846-864, 2016 | 59 | 2016 |
| A faster algorithm for solving general lps S Jiang, Z Song, O Weinstein, H Zhang Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021 | 55 | 2021 |
| Direct product via round-preserving compression M Braverman, A Rao, O Weinstein, A Yehudayoff International Colloquium on Automata, Languages, and Programming, 232-243, 2013 | 40 | 2013 |
| Approximating the influence of monotone Boolean functions in O (√ n) query complexity D Ron, R Rubinfeld, M Safra, A Samorodnitsky, O Weinstein ACM Transactions on Computation Theory (TOCT) 4 (4), 1-12, 2012 | 40 | 2012 |
| Crossing the logarithmic barrier for dynamic boolean data structure lower bounds KG Larsen, O Weinstein, H Yu Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018 | 39 | 2018 |
| An interactive information odometer and applications M Braverman, O Weinstein Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015 | 35 | 2015 |
| Information lower bounds via self-reducibility M Braverman, A Garg, D Pankratov, O Weinstein Theory of Computing Systems 59, 377-396, 2016 | 34 | 2016 |
| Welfare maximization with limited interaction N Alon, N Nisan, R Raz, O Weinstein 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, 1499-1512, 2015 | 33 | 2015 |
| Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture D Gavinsky, O Meir, O Weinstein, A Wigderson Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014 | 33 | 2014 |
| Static data structure lower bounds imply rigidity Z Dvir, A Golovnev, O Weinstein Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019 | 31 | 2019 |
