Search the dblp DataBase
Dorit Dor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
Geometric Pattern Matching in d-Dimensional Space. [Citation Graph (0, 0)][DBLP]
ESA, 1995, pp:264-279 [Conf] - Dorit Dor, Shay Halperin, Uri Zwick
All Pairs Almost Shortest Paths. [Citation Graph (0, 0)][DBLP]
FOCS, 1996, pp:452-461 [Conf] - Dorit Dor, Uri Zwick
Median Selection Requires (2+epsilon)n Comparisons. [Citation Graph (0, 0)][DBLP]
FOCS, 1996, pp:125-134 [Conf] - Dorit Dor, Uri Zwick
Finding percentile elements. [Citation Graph (0, 0)][DBLP]
ISTCS, 1995, pp:88-97 [Conf] - Dorit Dor, Uri Zwick
Selecting the Median. [Citation Graph (0, 0)][DBLP]
SODA, 1995, pp:28-37 [Conf] - Dorit Dor, Michael Tarsi
Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture [Citation Graph (0, 0)][DBLP]
STOC, 1992, pp:252-263 [Conf] - Dorit Dor, Uri Zwick
Finding The alpha n-Th Largest Element. [Citation Graph (0, 0)][DBLP]
Combinatorica, 1996, v:16, n:1, pp:41-58 [Journal] - Dorit Dor, Uri Zwick
SOKOBAN and other motion planning problems. [Citation Graph (0, 0)][DBLP]
Comput. Geom., 1999, v:13, n:4, pp:215-228 [Journal] - L. Paul Chew, Dorit Dor, Alon Efrat, Klara Kedem
Geometric Pattern Matching in d -Dimensional Space. [Citation Graph (0, 0)][DBLP]
Discrete & Computational Geometry, 1999, v:21, n:2, pp:257-274 [Journal] - Dorit Dor, Shay Halperin, Uri Zwick
All Pairs Almost Shortest Paths [Citation Graph (0, 0)][DBLP]
Electronic Colloquium on Computational Complexity (ECCC), 1997, v:4, n:40, pp:- [Journal] - Dorit Dor, Shay Halperin, Uri Zwick
All-Pairs Almost Shortest Paths. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 2000, v:29, n:5, pp:1740-1759 [Journal] - Dorit Dor, Michael Tarsi
Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1997, v:26, n:4, pp:1166-1187 [Journal] - Dorit Dor, Uri Zwick
Selecting the Median. [Citation Graph (0, 0)][DBLP]
SIAM J. Comput., 1999, v:28, n:5, pp:1722-1758 [Journal] - Dorit Dor, Johan Håstad, Staffan Ulfberg, Uri Zwick
On Lower Bounds for Selecting the Median. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2001, v:14, n:3, pp:299-311 [Journal] - Dorit Dor, Uri Zwick
Median Selection Requires (2+epsilon)n Comparisons. [Citation Graph (0, 0)][DBLP]
SIAM J. Discrete Math., 2001, v:14, n:3, pp:312-325 [Journal]
Search in 0.002secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002