Dorit Dor

16 papers A* 4A 1Journal 10Unranked 1
YearRankTypeTitle / Venue / Authors
2001 J jnl
Median Selection Requires (2+epsilon)n Comparisons.
SIAM J. Discret. Math.
Dorit Dor, Uri Zwick
2001 J jnl
On Lower Bounds for Selecting the Median.
SIAM J. Discret. Math.
Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick
2000 J jnl
All-Pairs Almost Shortest Paths.
SIAM J. Comput.
Dorit Dor, Shay Halperin, Uri Zwick
1999 J jnl
Geometric Pattern Matching in d -Dimensional Space.
Discret. Comput. Geom.
L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
1999 J jnl
SOKOBAN and other motion planning problems.
Comput. Geom.
Dorit Dor, Uri Zwick
1999 J jnl
Selecting the Median.
SIAM J. Comput.
Dorit Dor, Uri Zwick
1997 J jnl
All Pairs Almost Shortest Paths
Electron. Colloquium Comput. Complex.
Dorit Dor, Shay Halperin, Uri Zwick
1997 J jnl
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture.
SIAM J. Comput.
Dorit Dor, Michael Tarsi
1996 A* conf
All Pairs Almost Shortest Paths.
FOCS
Dorit Dor, Shay Halperin, Uri Zwick
1996 J jnl
Finding The alpha n-Th Largest Element.
Comb.
Dorit Dor, Uri Zwick
1996 A* conf
Median Selection Requires (2+epsilon)n Comparisons.
FOCS
Dorit Dor, Uri Zwick
1995 — conf
Finding percentile elements.
ISTCS
Dorit Dor, Uri Zwick
1995 A conf
Geometric Pattern Matching in d-Dimensional Space.
ESA
L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
1995 J jnl
Selecting the Median
Electron. Colloquium Comput. Complex.
Dorit Dor, Uri Zwick
1995 A* conf
Selecting the Median.
SODA
Dorit Dor, Uri Zwick
1992 A* conf
Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture
STOC
Dorit Dor, Michael Tarsi