A universality result for the smallest eigenvalues of certain sample covariance matrices ON Feldheim, S Sodin
Geometric And Functional Analysis 20 (1), 88-123, 2010
170 2010 3/2 firefighters are not enough ON Feldheim, R Hod
Discrete Applied Mathematics 161 (1-2), 301-306, 2013
27 2013 The power of online thinning in reducing discrepancy R Dwivedi, ON Feldheim, O Gurel-Gurevich, A Ramdas
Probability Theory and Related Fields 174, 103-131, 2019
25 2019 Long gaps between sign-changes of Gaussian stationary processes ND Feldheim, ON Feldheim
International Mathematics Research Notices 2015 (11), 3021-3034, 2015
23 2015 Persistence of Gaussian stationary processes: a spectral perspective N Feldheim, O Feldheim, S Nitzan
arXiv preprint arXiv:1709.00204, 2017
18 * 2017 The power of thinning in balanced allocation ON Feldheim, O Gurel-Gurevich
Electronic Communications in Probability 26, 1-8, 2021
17 2021 Regularization of non-normal matrices by Gaussian noise O Noy Feldheim, E Paquette, O Zeitouni
International Mathematics Research Notices 2015 (18), 8724-8751, 2015
13 2015 The power of two choices in graphical allocation N Bansal, ON Feldheim
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022
12 2022 Long-range order in the 3-state antiferromagnetic Potts model in high dimensions ON Feldheim, Y Spinka
Journal of the European Mathematical Society 21 (5), 1509-1570, 2019
12 * 2019 Rigidity of 3-colorings of the discrete torus ON Feldheim, R Peled
Annales de l’Institut Henri Poincaré, Probabilités et Statistiques 54, 952-994, 2018
11 * 2018 The Brownian web is a two-dimensional black noise T Ellis, ON Feldheim
11 2016 On the probability that a stationary Gaussian process with spectral gap remains non-negative on a long interval N Feldheim, O Feldheim, B Jaye, F Nazarov, S Nitzan
International Mathematics Research Notices 2020 (23), 9210-9227, 2020
10 2020 Load balancing under ON Feldheim, J Li
10 2020 Long-term balanced allocation via thinning ON Feldheim, O Gurel-Gurevich, J Li
The Annals of Applied Probability 34 (1A), 795-850, 2024
9 2024 Winning fast in sparse graph construction games ON Feldheim, M Krivelevich
Combinatorics, Probability and Computing 17 (6), 781-791, 2008
9 2008 The growth constant of odd cutsets in high dimensions ON Feldheim, Y Spinka
Combinatorics, Probability and Computing 27 (2), 208-227, 2018
6 2018 A note on general sliding window processes N Alon, ON Feldheim
6 2014 Double roots of random polynomials with integer coefficients ON Feldheim, A Sen
5 2017 Drawing outerplanar graphs using three edge lengths N Alon, ON Feldheim
Computational Geometry 48 (3), 260-267, 2015
5 2015 Well-balanced allocation on general graphs N Bansal, O Feldheim
Symposium on Theory of Computing (STOC), 2022
4 2022 