On Lower Bounds for Selecting the Median.

Dorit Dor

Dorit Dor Johan Håstad Staffan Ulfberg Uri Zwick On Lower Bounds for Selecting the Median. 299-311 2001 14 SIAM J. Discret. Math. 3 https://doi.org/10.1137/S0895480196309481 https://www.wikidata.org/entity/Q56959022 db/journals/siamdm/siamdm14.html#DorHUZ01

Dorit Dor Uri Zwick Median Selection Requires (2+epsilon)n Comparisons. 312-325 2001 14 SIAM J. Discret. Math. 3 https://doi.org/10.1137/S0895480199353895 db/journals/siamdm/siamdm14.html#DorZ01

Dorit Dor Shay Halperin Uri Zwick All-Pairs Almost Shortest Paths. 1740-1759 2000 29 SIAM J. Comput. 5 db/journals/siamcomp/siamcomp29.html#DorHZ00 https://doi.org/10.1137/S0097539797327908

Dorit Dor Uri Zwick SOKOBAN and other motion planning problems. 215-228 1999 13 Comput. Geom. 4 db/journals/comgeo/comgeo13.html#DorZ99 https://doi.org/10.1016/S0925-7721(99)00017-6 https://www.wikidata.org/entity/Q60299175

L. Paul Chew Dorit Dor Alon Efrat Klara Kedem Geometric Pattern Matching in d -Dimensional Space. 257-274 1999 21 Discret. Comput. Geom. 2 https://doi.org/10.1007/PL00009420 db/journals/dcg/dcg21.html#ChewDEK99

Dorit Dor Uri Zwick Selecting the Median. 1722-1758 1999 28 SIAM J. Comput. 5 db/journals/siamcomp/siamcomp28.html#DorZ99 https://doi.org/10.1137/S0097539795288611

Dorit Dor Michael Tarsi Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture. 1166-1187 1997 26 SIAM J. Comput. 4 db/journals/siamcomp/siamcomp26.html#DorT97 https://doi.org/10.1137/S0097539792229507 https://www.wikidata.org/entity/Q123215741

Dorit Dor Shay Halperin Uri Zwick All Pairs Almost Shortest Paths Electron. Colloquium Comput. Complex. 1997 TR97-040 TR97 db/journals/eccc/eccc4.html#ECCC-TR97-040 https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-040/index.html

Dorit Dor Uri Zwick Finding The alpha n-Th Largest Element. 41-58 1996 16 Comb. 1 db/journals/combinatorica/combinatorica16.html#DorZ96 https://doi.org/10.1007/BF01300126

Dorit Dor Uri Zwick Median Selection Requires (2+epsilon)n Comparisons. 125-134 1996 conf/focs/1996 FOCS db/conf/focs/focs96.html#DorZ96 https://doi.org/10.1109/SFCS.1996.548471 https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548471 Dorit Dor Shay Halperin Uri Zwick All Pairs Almost Shortest Paths. 452-461 1996 conf/focs/1996 FOCS db/conf/focs/focs96.html#DorHZ96 https://doi.org/10.1109/SFCS.1996.548504 https://doi.ieeecomputersociety.org/10.1109/SFCS.1996.548504 L. Paul Chew Dorit Dor Alon Efrat Klara Kedem Geometric Pattern Matching in d-Dimensional Space. 264-279 1995 conf/esa/1995 ESA db/conf/esa/esa95.html#ChewDEK95 https://doi.org/10.1007/3-540-60313-1_149 Dorit Dor Uri Zwick Finding percentile elements. 88-97 1995 conf/istcs/1995 ISTCS db/conf/istcs/istcs1995.html#DorZ95 https://doi.org/10.1109/ISTCS.1995.377042 https://doi.ieeecomputersociety.org/10.1109/ISTCS.1995.377042 Dorit Dor Uri Zwick Selecting the Median. 28-37 1995 conf/soda/1995 SODA db/conf/soda/soda95.html#DorZ95 http://dl.acm.org/citation.cfm?id=313651.313660

Dorit Dor Uri Zwick Selecting the Median Electron. Colloquium Comput. Complex. 1995 TR95-031 TR95 db/journals/eccc/eccc2.html#ECCC-TR95-031 https://eccc.weizmann.ac.il/eccc-reports/1995/TR95-031/index.html

Graph Decomposition Is NPC-A Complete Proof of Holyer's Conjecture Dorit Dor Michael Tarsi 252-263 conf/stoc/STOC24 1992 STOC db/conf/stoc/stoc92.html#DorT92 https://doi.org/10.1145/129712.129737 https://www.wikidata.org/entity/Q130976102 L. Paul Chew Alon Efrat Shay Halperin Johan Håstad Klara Kedem Michael Tarsi Staffan Ulfberg Uri Zwick