Connectivity of Random High Dimensional Geometric Graphs. - Roee David; Uriel Feige (APPROX-RANDOM, 2013)

Local Reconstruction of Low-Rank Matrices and Subspaces. - Roee David; Elazar Goldenberg; Robert Krauthgamer (Electron. Colloquium Comput. Complex., 2015)

On the effect of randomness on planted 3-coloring models. - Roee David; Uriel Feige (STOC, 2016)

Random walks with the minimum degree local rule have $O(n^2)$ cover time. - Roee David; Uriel Feige (CoRR, 2016)

The Curse of Medium Dimension for Geometric Problems in Almost Every Norm. - Roee David; Karthik C. S. 001; Bundit Laekhanukit (CoRR, 2016)

Random Walks with the Minimum Degree Local Rule Have O(N2) Cover Time. - Roee David; Uriel Feige (SODA, 2017)

Balanced Facilities on Random Graphs. - Roee David; Nimrod Talmon (CoRR, 2017)

Direct Sum Testing. - Roee David; Irit Dinur; Elazar Goldenberg; Guy Kindler; Igor Shinkar (SIAM J. Comput., 2017)

Random Walks with the Minimum Degree Local Rule Have O(n2) Cover Time. - Roee David; Uriel Feige (SIAM J. Comput., 2018)

On the Complexity of Closest Pair via Polar-Pair of Point-Sets. - Roee David; Karthik C. S. 001; Bundit Laekhanukit (SIAM J. Discret. Math., 2019)