On Random Graph Homomorphisms into Z. - Itai Benjamini; Olle Häggström; Elchanan Mossel (J. Comb. Theory B, 2000)

Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z. - Itai Benjamini; Gideon Schechtman (Random Struct. Algorithms, 2000)

The diameter of long-range percolation clusters on finite cycles. - Itai Benjamini; Noam Berger (Random Struct. Algorithms, 2001)

Global Information from Local Observation. - Itai Benjamini; László Lovász 001 (FOCS, 2002)

Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read. - Itai Benjamini; Oded Schramm; David Bruce Wilson (STOC, 2005)

A Resistance Bound Via An Isoperimetric Inequality. - Itai Benjamini; Gady Kozma (Comb., 2005)

ω-Periodic Graphs. - Itai Benjamini; Christopher Hoffman (Electron. J. Comb., 2005)

Waiting for a Bat to Fly By (in Polynomial Time). - Itai Benjamini; Gady Kozma; László Lovász 001; Dan Romik; Gábor Tardos (Comb. Probab. Comput., 2006)

A phase transition for the metric distortion of percolation on the hypercube. - Omer Angel; Itai Benjamini (Comb., 2007)

Long-Range Percolation Mixing Time. - Itai Benjamini; Noam Berger; Ariel Yadin (Comb. Probab. Comput., 2008)

Every Minor-Closed Property of Sparse Graphs is Testable. - Itai Benjamini; Oded Schramm; Asaf Shapira (Electron. Colloquium Comput. Complex., 2008)

Routing complexity of faulty networks. - Omer Angel; Itai Benjamini; Eran Ofek; Udi Wieder (Random Struct. Algorithms, 2008)

The isoperimetric constant of the random graph process. - Itai Benjamini; Simi Haber; Michael Krivelevich; Eyal Lubetzky (Random Struct. Algorithms, 2008)

Balanced Allocation: Memory Performance Tradeoffs - Itai Benjamini; Yury Makarychev (CoRR, 2009)

On limits of graphs sphere packed in Euclidean space and applications. - Itai Benjamini; Nicolas Curien (Eur. J. Comb., 2011)

Geodesics and almost geodesic cycles in random regular graphs. - Itai Benjamini; Carlos Hoppen; Eran Ofek; Pawel Pralat; Nicholas C. Wormald (J. Graph Theory, 2011)

Harmonic labeling of graphs. - Itai Benjamini; Van Cyr; Eviatar B. Procaccia; Ran J. Tessler (Discret. Math., 2013)

Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball. - Itai Benjamini; Gil Cohen; Igor Shinkar (Electron. Colloquium Comput. Complex., 2013)

The mixing time of the giant component of a random graph. - Itai Benjamini; Gady Kozma; Nicholas C. Wormald (Random Struct. Algorithms, 2014)

Acquaintance Time of a Graph. - Itai Benjamini; Igor Shinkar; Gilad Tsur (SIAM J. Discret. Math., 2014)

A generalized Pólya's urn with graph based interactions. - Michel Benaïm; Itai Benjamini; Jun Chen; Yuri Lima 002 (Random Struct. Algorithms, 2015)

Juntas in the ℓ1-grid and Lipschitz maps between discrete tori. - Itai Benjamini; David Ellis; Ehud Friedgut; Nathan Keller; Arnab Sen (Random Struct. Algorithms, 2016)

On the scaling limit of finite vertex transitive graphs with large diameter. - Itai Benjamini; Hilary K. Finucane; Romain Tessera (Comb., 2017)

An Isoperimetric Inequality for Planar Triangulations. - Omer Angel; Itai Benjamini; Nizan Horesh (Discret. Comput. Geom., 2018)

Pseudo-Mixing Time of Random Walks. - Itai Benjamini; Oded Goldreich 001 (Electron. Colloquium Comput. Complex., 2019)

Pseudo-mixing Time of Random Walks. - Itai Benjamini; Oded Goldreich 001 (Computational Complexity and Property Testing, 2020)

Degrees in Link Graphs of Regular Graphs. - Itai Benjamini; John Haslegrave (Electron. J. Comb., 2022)

A very sharp threshold for first order logic distinguishability of random graphs. - Itai Benjamini; Maksim Zhukovskii (CoRR, 2022)

The Maximal Number of 3-Term Arithmetic Progressions in Finite Sets in Different Geometries. - Itai Benjamini; Shoni Gilboa (Discret. Comput. Geom., 2023)

Randomly Twisted Hypercubes: Between Structure and Randomness. - Itai Benjamini; Yotam Dikstein; Renan Gross; Maksim Zhukovskii (Random Struct. Algorithms, 2025)