| 2008 |
|---|
| 10 | EE | Itai Benjamini,
Oded Schramm,
Asaf Shapira:
Every minor-closed property of sparse graphs is testable.
STOC 2008: 393-402 |
| 2005 |
|---|
| 9 | EE | Omer Angel,
Itai Benjamini,
Eran Ofek,
Udi Wieder:
Routing complexity of faulty networks.
PODC 2005: 209-217 |
| 8 | EE | 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: 244-250 |
| 7 | EE | Itai Benjamini,
Gady Kozma:
A Resistance Bound Via An Isoperimetric Inequality.
Combinatorica 25(6): 645-650 (2005) |
| 6 | EE | Itai Benjamini,
Christopher Hoffman:
omega-Periodic Graphs.
Electr. J. Comb. 12: (2005) |
| 2004 |
|---|
| 5 | EE | 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 math.PR/0410282: (2004) |
| 2002 |
|---|
| 4 | EE | Itai Benjamini,
László Lovász:
Global Information from Local Observation.
FOCS 2002: 701-710 |
| 2001 |
|---|
| 3 | | Itai Benjamini,
Noam Berger:
The diameter of long-range percolation clusters on finite cycles.
Random Struct. Algorithms 19(2): 102-111 (2001) |
| 2000 |
|---|
| 2 | EE | Itai Benjamini,
Olle Häggström,
Elchanan Mossel:
On Random Graph Homomorphisms into Z.
J. Comb. Theory, Ser. B 78(1): 86-114 (2000) |
| 1 | | 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): 20-25 (2000) |
