Sciweavers

SODA
1994
ACM
85views Algorithms» more  SODA 1994»
15 years 7 days ago
An Optimal Algorithm for Approximate Nearest Neighbor Searching
Sunil Arya, David M. Mount, Nathan S. Netanyahu, R...
SODA
1994
ACM
81views Algorithms» more  SODA 1994»
15 years 7 days ago
Let Sleeping Files Lie: Pattern Matching in Z-compressed Files
Amihood Amir, Gary Benson, Martin Farach
SODA
1994
ACM
63views Algorithms» more  SODA 1994»
15 years 7 days ago
Matching Nuts and Bolts
Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan,...
64
Voted
SODA
1994
ACM
100views Algorithms» more  SODA 1994»
15 years 7 days ago
Physical Mapping of Chromosomes Using Unique Probes
Farid Alizadeh, Richard M. Karp, Deborah K. Weisse...
96
Voted
SODA
1993
ACM
85views Algorithms» more  SODA 1993»
15 years 7 days ago
On Traversing Layered Graphs On-line
The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.
H. Ramesh
70
Voted
SODA
1993
ACM
107views Algorithms» more  SODA 1993»
15 years 7 days ago
Chernoff-Hoeffding Bounds for Applications with Limited Independence
Jeanette P. Schmidt, Alan Siegel, Aravind Srinivas...
63
Voted
SODA
1993
ACM
109views Algorithms» more  SODA 1993»
15 years 7 days ago
Dynamic Generation of Discrete Random Variates
Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni
85
Voted
SODA
1993
ACM
118views Algorithms» more  SODA 1993»
15 years 7 days ago
Scapegoat Trees
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
Igal Galperin, Ronald L. Rivest