معرفی
Omri Weinstein is an Assistant Professor in the Department of Computer Science at Columbia University. His research bridges Information Theory, Data Structures, and Optimization, focusing on dynamic data structures and dimensionality-reduction techniques to accelerate optimization and search. He received his PhD from Princeton University and was a Simons Society Junior Fellow at the Courant Institute (NYU).
- Education:
- PhD in Computer Science, Princeton University
- Simons Society Junior Fellowship, Courant Institute (NYU)
His work explores the theoretical foundations of data structure lower bounds, communication complexity, and secure computation. Recent research includes advancements in dynamic matrix inversion for linear programming, oblivious near-neighbor search, and the interplay between matrix rigidity and data structure efficiency.
Key trends in his publications include:
- Proving polynomial and super-logarithmic lower bounds for static and dynamic data structures
- Developing novel techniques in information complexity and protocol compression
- Applications in parallel algorithms, compressed data structures, and algorithmic game theory
Scientific Awards:
- NSF CAREER Award
- Simons Society Junior Fellow
- Best Paper Award at CSR '13
Advising and Grants:
- Advised PhD students Hengjie Zhang and Shunhua Jiang
- MsC student Victor Lecomte and postdoc Alexander Golovnev
- Research funded by NSF CAREER Award on data structure lower bounds
Labs and Teams: Omri is affiliated with the Theoretical Computer Science Group at Columbia and leads the Data-Structure Lower Bounds Reading Group.
