Omri Weinstein, Ph.D.
Affiliations: | 2015 | Computer Science | Princeton University, Princeton, NJ |
Area:
Complexity theory, algorithms, game theory, machine learning, and applications of computer science in healthcare and medicine.Google:
"Omri Weinstein"Parents
Sign in to add mentorMark Braverman | grad student | 2015 | Princeton | |
(Interactive Information Complexity and Applications.) |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Golovnev A, Regev O, Weinstein O. (2018) The Minrank of Random Graphs Ieee Transactions On Information Theory. 64: 6990-6995 |
Gavinsky D, Meir O, Weinstein O, et al. (2017) Toward Better Formula Lower Bounds: The Composition of a Function and a Universal Relation Siam Journal On Computing. 46: 114-131 |
Weinstein O. (2015) Information Complexity and the Quest for Interactive Compression Sigact News. 46: 41-64 |
Braverman M, Weinstein O. (2015) An interactive information odometer and applications Proceedings of the Annual Acm Symposium On Theory of Computing. 14: 341-350 |
Braverman M, Weinstein O. (2015) A Discrepancy Lower Bound for Information Complexity Algorithmica. 1-19 |
Braverman M, Garg A, Pankratov D, et al. (2015) Information Lower Bounds via Self-Reducibility Theory of Computing Systems |
Weinstein O, Woodruff DP. (2015) The simultaneous communication of disjointness with applications to data streams Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9134: 1082-1093 |
Braverman M, Ko YK, Weinstein O. (2015) Approximating the best Nash Equilibrium in no (1ogn)-time breaks the exponential time hypothesis Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 2015: 970-982 |
Gavinsky D, Meir O, Weinstein O, et al. (2014) Toward better formula lower bounds: An information complexity approach to the KRW composition conjecture Proceedings of the Annual Acm Symposium On Theory of Computing. 213-222 |
Braverman M, Garg A, Pankratov D, et al. (2013) From information to exact communication Proceedings of the Annual Acm Symposium On Theory of Computing. 151-160 |