| |
| 2008 | ||
|---|---|---|
| 4 | EE | Eldar Fischer, Oded Lachish, Ilan Newman, Arie Matsliah, Orly Yahalom: On the Query Complexity of Testing Orientations for Being Eulerian. APPROX-RANDOM 2008: 402-415 |
| 2007 | ||
| 3 | EE | Eldar Fischer, Orly Yahalom: Testing Convexity Properties of Tree Colorings. STACS 2007: 109-120 |
| 2006 | ||
| 2 | EE | Eldar Fischer, Orly Yahalom: Testing Convexity Properties of Tree Colorings. Electronic Colloquium on Computational Complexity (ECCC) 13(053): (2006) |
| 2003 | ||
| 1 | EE | Uriel Feige, Orly Yahalom: On the complexity of finding balanced oneway cuts. Inf. Process. Lett. 87(1): 1-5 (2003) |
| 1 | Uriel Feige | [1] |
| 2 | Eldar Fischer | [2] [3] [4] |
| 3 | Oded Lachish | [4] |
| 4 | Arie Matsliah | [4] |
| 5 | Ilan Newman | [4] |