Itai Benjamini

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