Itai Benjamini

2009
16	EE	Itai Benjamini, Yury Makarychev: Balanced Allocation: Memory Performance Tradeoffs CoRR abs/0901.1155: (2009)
2008
15	EE	Itai Benjamini, Oded Schramm, Asaf Shapira: Every minor-closed property of sparse graphs is testable. STOC 2008: 393-402
14	EE	Itai Benjamini, Noam Berger, Ariel Yadin: Long-Range Percolation Mixing Time. Combinatorics, Probability & Computing 17(4): 487-494 (2008)
13	EE	Itai Benjamini, Oded Schramm, Asaf Shapira: Every Minor-Closed Property of Sparse Graphs is Testable. Electronic Colloquium on Computational Complexity (ECCC) 15(010): (2008)
12	EE	Itai Benjamini, Simi Haber, Michael Krivelevich, Eyal Lubetzky: The isoperimetric constant of the random graph process. Random Struct. Algorithms 32(1): 101-114 (2008)
11	EE	Omer Angel, Itai Benjamini, Eran Ofek, Udi Wieder: Routing complexity of faulty networks. Random Struct. Algorithms 32(1): 71-87 (2008)
2006
10	EE	Itai Benjamini, Gady Kozma, László Lovász, D. A. N. Romik, Gábor Tardos: Waiting for a Bat to Fly By (in Polynomial Time). Combinatorics, Probability & Computing 15(5): 673-683 (2006)
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)

Coauthor Index

1	Omer Angel	[9] [11]
2	Noam Berger	[3] [14]
3	Simi Haber	[12]
4	Olle Häggström	[2]
5	Christopher Hoffman	[6]
6	Gady Kozma	[7] [10]
7	Michael Krivelevich	[12]
8	László Lovász	[4] [10]
9	Eyal Lubetzky	[12]
10	Yury Makarychev	[16]
11	Elchanan Mossel	[2]
12	Eran Ofek	[9] [11]
13	D. A. N. Romik	[10]
14	Gideon Schechtman	[1]
15	Oded Schramm	[5] [8] [13] [15]
16	Asaf Shapira	[13] [15]
17	Gábor Tardos	[10]
18	Udi Wieder	[9] [11]
19	David Bruce Wilson	[5] [8]
20	Ariel Yadin	[14]

Colors in the list of coauthors