Dorit Dor

According to our database, Dorit Dor authored at least 10 papers between 1992 and 2001.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2001

On Lower Bounds for Selecting the Median.

Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick

SIAM J. Discret. Math., 2001

1999

SOKOBAN and other motion planning problems.

Dorit Dor, Uri Zwick

Comput. Geom., 1999

1997

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture.

Dorit Dor, Michael Tarsi

SIAM J. Comput., 1997

1996

Finding The alpha n-Th Largest Element.

Dorit Dor, Uri Zwick

Comb., 1996

Median Selection Requires (2+epsilon)n Comparisons.

Dorit Dor, Uri Zwick

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

All Pairs Almost Shortest Paths.

Dorit Dor, Shay Halperin, Uri Zwick

Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996

1995

Selecting the Median.

Dorit Dor, Uri Zwick

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Finding percentile elements.

Dorit Dor, Uri Zwick

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

Geometric Pattern Matching in d-Dimensional Space.

L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem

Proceedings of the Algorithms, 1995

1992

Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture

Dorit Dor, Michael Tarsi

Proceedings of the 24th Annual ACM Symposium on Theory of Computing, 1992