Itai Benjamini

Publication Activity (10 Years)

Years Active: 2000-2023
Publications (10 Years): 7

Top Topics

First Order Logic

Graph Theoretic

Top Venues

Random Struct. Algorithms

Discret. Comput. Geom.

Electron. Colloquium Comput. Complex.

Publications

Itai Benjamini, Shoni Gilboa
The Maximal Number of 3-Term Arithmetic Progressions in Finite Sets in Different Geometries. Discret. Comput. Geom. 69 (2) (2023)
Itai Benjamini, Maksim Zhukovskii
A very sharp threshold for first order logic distinguishability of random graphs. CoRR (2022)
Itai Benjamini, John Haslegrave
Degrees in Link Graphs of Regular Graphs. Electron. J. Comb. 29 (2) (2022)
Itai Benjamini, Oded Goldreich
Pseudo-Mixing Time of Random Walks. Electron. Colloquium Comput. Complex. 26 (2019)
Omer Angel, Itai Benjamini, Nizan Horesh
An Isoperimetric Inequality for Planar Triangulations. Discret. Comput. Geom. 59 (4) (2018)
Itai Benjamini, Hilary Finucane, Romain Tessera
On the scaling limit of finite vertex transitive graphs with large diameter. Comb. 37 (3) (2017)
Itai Benjamini, David Ellis, Ehud Friedgut, Nathan Keller, Arnab Sen
-grid and Lipschitz maps between discrete tori. Random Struct. Algorithms 49 (2) (2016)
Michel Benaïm, Itai Benjamini, Jun Chen, Yuri Lima
A generalized Pólya's urn with graph based interactions. Random Struct. Algorithms 46 (4) (2015)
Itai Benjamini, Gady Kozma, Nicholas C. Wormald
The mixing time of the giant component of a random graph. Random Struct. Algorithms 45 (3) (2014)
Itai Benjamini, Igor Shinkar, Gilad Tsur
Acquaintance Time of a Graph. SIAM J. Discret. Math. 28 (2) (2014)
Itai Benjamini, Gil Cohen, Igor Shinkar
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. FOCS (2014)
Itai Benjamini, Igor Shinkar, Gilad Tsur
Acquaintance Time of a Graph CoRR (2013)
Itai Benjamini, Van Cyr, Eviatar B. Procaccia, Ran J. Tessler
Harmonic labeling of graphs. Discret. Math. 313 (17) (2013)
Itai Benjamini, Gil Cohen, Igor Shinkar
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. Electron. Colloquium Comput. Complex. 20 (2013)
Itai Benjamini, Gil Cohen, Igor Shinkar
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. CoRR (2013)
Itai Benjamini, Carlos Hoppen, Eran Ofek, Pawel Pralat, Nicholas C. Wormald
Geodesics and almost geodesic cycles in random regular graphs. J. Graph Theory 66 (2) (2011)
Itai Benjamini, Nicolas Curien
On limits of graphs sphere packed in Euclidean space and applications. Eur. J. Comb. 32 (7) (2011)
Itai Benjamini, Yury Makarychev
Balanced Allocation: Memory Performance Tradeoffs CoRR (2009)
Itai Benjamini, Oded Schramm, Asaf Shapira
Every Minor-Closed Property of Sparse Graphs is Testable. Electron. Colloquium Comput. Complex. 15 (010) (2008)
Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky
The isoperimetric constant of the random graph process. Random Struct. Algorithms 32 (1) (2008)
Itai Benjamini, Oded Schramm, Asaf Shapira
Every minor-closed property of sparse graphs is testable. STOC (2008)
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
Routing complexity of faulty networks. Random Struct. Algorithms 32 (1) (2008)
Itai Benjamini, Noam Berger, Ariel Yadin
Long-Range Percolation Mixing Time. Comb. Probab. Comput. 17 (4) (2008)
Omer Angel, Itai Benjamini
A phase transition for the metric distortion of percolation on the hypercube. Comb. 27 (6) (2007)
Itai Benjamini, Gady Kozma, László Lovász, Dan Romik, Gábor Tardos
Waiting for a Bat to Fly By (in Polynomial Time). Comb. Probab. Comput. 15 (5) (2006)
Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder
Routing complexity of faulty networks. PODC (2005)
Itai Benjamini, Gady Kozma
A Resistance Bound Via An Isoperimetric Inequality. Comb. 25 (6) (2005)
Itai Benjamini, Oded Schramm, David Bruce Wilson
Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read. STOC (2005)
Itai Benjamini, Christopher Hoffman
ω-Periodic Graphs. Electron. J. Comb. 12 (2005)
Itai Benjamini, Oded Schramm, David Bruce Wilson
Balanced Boolean functions that can be evaluated so that every input bit is unlikely to be read CoRR (2004)
Itai Benjamini, László Lovász
Global Information from Local Observation. FOCS (2002)
Itai Benjamini, Noam Berger
The diameter of long-range percolation clusters on finite cycles. Random Struct. Algorithms 19 (2) (2001)
Itai Benjamini, Gideon Schechtman
Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z. Random Struct. Algorithms 17 (1) (2000)
Itai Benjamini, Olle Häggström, Elchanan Mossel
On Random Graph Homomorphisms into Z. J. Comb. Theory, Ser. B 78 (1) (2000)