2001 |
16 | EE | Dorit Dor,
Johan Håstad,
Staffan Ulfberg,
Uri Zwick:
On Lower Bounds for Selecting the Median.
SIAM J. Discrete Math. 14(3): 299-311 (2001) |
15 | EE | Dorit Dor,
Uri Zwick:
Median Selection Requires (2+epsilon)n Comparisons.
SIAM J. Discrete Math. 14(3): 312-325 (2001) |
2000 |
14 | | Dorit Dor,
Shay Halperin,
Uri Zwick:
All-Pairs Almost Shortest Paths.
SIAM J. Comput. 29(5): 1740-1759 (2000) |
1999 |
13 | | Dorit Dor,
Uri Zwick:
SOKOBAN and other motion planning problems.
Comput. Geom. 13(4): 215-228 (1999) |
12 | EE | L. Paul Chew,
Dorit Dor,
Alon Efrat,
Klara Kedem:
Geometric Pattern Matching in d -Dimensional Space.
Discrete & Computational Geometry 21(2): 257-274 (1999) |
11 | | Dorit Dor,
Uri Zwick:
Selecting the Median.
SIAM J. Comput. 28(5): 1722-1758 (1999) |
1997 |
10 | EE | Dorit Dor,
Shay Halperin,
Uri Zwick:
All Pairs Almost Shortest Paths
Electronic Colloquium on Computational Complexity (ECCC) 4(40): (1997) |
9 | | Dorit Dor,
Michael Tarsi:
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture.
SIAM J. Comput. 26(4): 1166-1187 (1997) |
1996 |
8 | | Dorit Dor,
Uri Zwick:
Median Selection Requires (2+epsilon)n Comparisons.
FOCS 1996: 125-134 |
7 | | Dorit Dor,
Shay Halperin,
Uri Zwick:
All Pairs Almost Shortest Paths.
FOCS 1996: 452-461 |
6 | | Dorit Dor,
Uri Zwick:
Finding The alpha n-Th Largest Element.
Combinatorica 16(1): 41-58 (1996) |
1995 |
5 | | L. Paul Chew,
Dorit Dor,
Alon Efrat,
Klara Kedem:
Geometric Pattern Matching in d-Dimensional Space.
ESA 1995: 264-279 |
4 | | Dorit Dor,
Uri Zwick:
Finding percentile elements.
ISTCS 1995: 88-97 |
3 | | Dorit Dor,
Uri Zwick:
Selecting the Median.
SODA 1995: 28-37 |
2 | EE | Dorit Dor,
Uri Zwick:
Selecting the Median
Electronic Colloquium on Computational Complexity (ECCC) 2(31): (1995) |
1992 |
1 | | Dorit Dor,
Michael Tarsi:
Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture
STOC 1992: 252-263 |