I am a Ph.D. student in the Computer Science Department at Stanford University. I am fortunate to be advised by Moses Charikar. Prior to that, I earned an M.Sc. degree in Computer Science from Tel-Aviv University, where I was advised by Michal Feldman.
My research interests are in algorithms and theoretical computer science, including streaming algorithms, sketching, approximation, and online algorithms.
My e-mail address:
Composable Sketches for Functions of Frequencies: Beyond the Worst Case
Edith Cohen, Ofir Geri, and Rasmus Pagh
The Thirty-seventh International Conference on Machine Learning (ICML), 2020
[ arXiv | ICML talk ]
Sampling Sketches for Concave Sublinear Functions of Frequencies
Edith Cohen and Ofir Geri
The Thirty-third Conference on Neural Information Processing Systems (NeurIPS), 2019
[ NeurIPS | arXiv ]
On Estimating Edit Distance: Alignment, Dimension Reduction, and Embeddings
Moses Charikar, Ofir Geri, Michael P. Kim, and William Kuszmaul
The 45th International Colloquium on Automata, Languages, and Programming (ICALP), 2018
[ ICALP | arXiv ]
Min-Cost Bipartite Perfect Matching with Delays
Itai Ashlagi, Yossi Azar, Moses Charikar, Ashish Chiplunkar, Ofir Geri, Haim Kaplan, Rahul Makhijani, Yuyi Wang, and Roger Wattenhofer
The 20th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2017
[ APPROX ]
Do Capacity Constraints Constrain Coalitions?
Michal Feldman and Ofir Geri
ACM Transactions on Economics and Computation (TEAC), 2016
A preliminary version appeared in the Proceedings of the 29th AAAI Conference on Artificial Intelligence, 2015
[ TEAC | AAAI | arXiv ]