| 2008 |
|---|
| 7 | EE | Itai Benjamini,
Oded Schramm,
Asaf Shapira:
Every minor-closed property of sparse graphs is testable.
STOC 2008: 393-402 |
| 6 | EE | Russell Lyons,
R. O. N. Peled,
Oded Schramm:
Growth of the Number of Spanning Trees of the Erdös-Rényi Giant Component.
Combinatorics, Probability & Computing 17(5): 711-726 (2008) |
| 5 | 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) |
| 2005 |
|---|
| 4 | EE | Ryan O'Donnell,
Michael E. Saks,
Oded Schramm,
Rocco A. Servedio:
Every decision tree has an in.uential variable.
FOCS 2005: 31-39 |
| 3 | 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 |
| 2 | EE | Ryan O'Donnell,
Michael E. Saks,
Oded Schramm,
Rocco A. Servedio:
Every decision tree has an influential variable
CoRR abs/cs/0508071: (2005) |
| 2004 |
|---|
| 1 | 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) |
