Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture - Dorit Dor; Michael Tarsi (STOC, 1992)

Finding percentile elements. - Dorit Dor; Uri Zwick (ISTCS, 1995)

Finding The alpha n-Th Largest Element. - Dorit Dor; Uri Zwick (Comb., 1996)

Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. - Dorit Dor; Michael Tarsi (SIAM J. Comput., 1997)

SOKOBAN and other motion planning problems. - Dorit Dor; Uri Zwick (Comput. Geom., 1999)

Geometric Pattern Matching in d -Dimensional Space. - L. Paul Chew; Dorit Dor; Alon Efrat; Klara Kedem (Discret. Comput. Geom., 1999)

Selecting the Median. - Dorit Dor; Uri Zwick (SIAM J. Comput., 1999)

All-Pairs Almost Shortest Paths. - Dorit Dor; Shay Halperin; Uri Zwick (SIAM J. Comput., 2000)

On Lower Bounds for Selecting the Median. - Dorit Dor; Johan Håstad; Staffan Ulfberg; Uri Zwick (SIAM J. Discret. Math., 2001)

Median Selection Requires (2+epsilon)n Comparisons. - Dorit Dor; Uri Zwick (SIAM J. Discret. Math., 2001)