| |
| * | 2008 | |
|---|---|---|
| 4 | EE | Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos: Graph Colouring with No Large Monochromatic Components. Combinatorics, Probability & Computing 17(4): 577-589 (2008) |
| 2007 | ||
| 3 | EE | Oded Goldreich, Or Sheffet: On the Randomness Complexity of Property Testing. APPROX-RANDOM 2007: 509-524 |
| 2 | EE | Oded Goldreich, Or Sheffet: On the randomness complexity of property testing. Electronic Colloquium on Computational Complexity (ECCC) 14(015): (2007) |
| 1 | EE | Nathan Linial, Jirí Matousek, Or Sheffet, Gábor Tardos: Graph coloring with no large monochromatic components. Electronic Notes in Discrete Mathematics 29: 115-122 (2007) |
| 1 | Oded Goldreich | [2] [3] |
| 2 | Nathan Linial (Nati Linial) | [1] [4] |
| 3 | Jirí Matousek | [1] [4] |
| 4 | Gábor Tardos | [1] [4] |