Itai Benjamini

According to our database1, Itai Benjamini authored at least 26 papers between 2000 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
Pseudo-mixing Time of Random Walks.
Proceedings of the Computational Complexity and Property Testing, 2020

2019
Pseudo-Mixing Time of Random Walks.
Electron. Colloquium Comput. Complex., 2019

2018
An Isoperimetric Inequality for Planar Triangulations.
Discret. Comput. Geom., 2018

2017
On the scaling limit of finite vertex transitive graphs with large diameter.
Comb., 2017

2016
Juntas in the <i>ℓ</i><sub>1</sub>-grid and Lipschitz maps between discrete tori.
Random Struct. Algorithms, 2016

2015
A generalized Pólya's urn with graph based interactions.
Random Struct. Algorithms, 2015

2014
Acquaintance Time of a Graph.
SIAM J. Discret. Math., 2014

The mixing time of the giant component of a random graph.
Random Struct. Algorithms, 2014

2013
Bi-Lipschitz Bijection between the Boolean Cube and the Hamming Ball.
Electron. Colloquium Comput. Complex., 2013

Harmonic labeling of graphs.
Discret. Math., 2013

2011
Geodesics and almost geodesic cycles in random regular graphs.
J. Graph Theory, 2011

On limits of graphs sphere packed in Euclidean space and applications.
Eur. J. Comb., 2011

2009
Balanced Allocation: Memory Performance Tradeoffs
CoRR, 2009

2008
The isoperimetric constant of the random graph process.
Random Struct. Algorithms, 2008

Routing complexity of faulty networks.
Random Struct. Algorithms, 2008

Every Minor-Closed Property of Sparse Graphs is Testable.
Electron. Colloquium Comput. Complex., 2008

Long-Range Percolation Mixing Time.
Comb. Probab. Comput., 2008

2007
A phase transition for the metric distortion of percolation on the hypercube.
Comb., 2007

2006
Waiting for a Bat to Fly By (in Polynomial Time).
Comb. Probab. Comput., 2006

2005
ω-Periodic Graphs.
Electron. J. Comb., 2005

A Resistance Bound Via An Isoperimetric Inequality.
Comb., 2005

Balanced boolean functions that can be evaluated so that every input bit is unlikely to be read.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2002
Global Information from Local Observation.
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002

2001
The diameter of long-range percolation clusters on finite cycles.
Random Struct. Algorithms, 2001

2000
Upper bounds on the height difference of the Gaussian random field and the range of random graph homomorphisms into Z.
Random Struct. Algorithms, 2000

On Random Graph Homomorphisms into Z.
J. Comb. Theory, Ser. B, 2000


  Loading...