Sciweavers

21

SODA
1994
ACM

85views Algorithms» more SODA 1994»

An Optimal Algorithm for Approximate Nearest Neighbor Searching

13 years 11 months ago

An Optimal Algorithm for Approximate Nearest Neighbor Searching

Download orion.math.iastate.edu

Sunil Arya, David M. Mount, Nathan S. Netanyahu, R...

claim paper

Read More »

16

SODA
1994
ACM

81views Algorithms» more SODA 1994»

Let Sleeping Files Lie: Pattern Matching in Z-compressed Files

13 years 11 months ago

Let Sleeping Files Lie: Pattern Matching in Z-compressed Files

Download tandem.bu.edu

Amihood Amir, Gary Benson, Martin Farach

claim paper

Read More »

17

SODA
1994
ACM

63views Algorithms» more SODA 1994»

Matching Nuts and Bolts

13 years 11 months ago

Matching Nuts and Bolts

Download www.cs.tau.ac.il

Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan,...

claim paper

Read More »

25

SODA
1994
ACM

100views Algorithms» more SODA 1994»

Physical Mapping of Chromosomes Using Unique Probes

13 years 11 months ago

Physical Mapping of Chromosomes Using Unique Probes

Download research.microsoft.com

Farid Alizadeh, Richard M. Karp, Deborah K. Weisse...

claim paper

Read More »

35

SODA
1993
ACM

105views Algorithms» more SODA 1993»

Fast Construction of Irreducible Polynomials over Finite Fields

13 years 11 months ago

Fast Construction of Irreducible Polynomials over Finite Fields

Download perso.univ-rennes1.fr

Victor Shoup

claim paper

Read More »

35

SODA
1993
ACM

85views Algorithms» more SODA 1993»

On Traversing Layered Graphs On-line

13 years 11 months ago

On Traversing Layered Graphs On-line

Download hariharan-ramesh.com

The following bounds on the competitive ratios of deterministic and randomized on-line algorithms for traversing width-w layered graphs are obtained.

H. Ramesh

claim paper

Read More »

28

SODA
1993
ACM

107views Algorithms» more SODA 1993»

Chernoff-Hoeffding Bounds for Applications with Limited Independence

13 years 11 months ago

Chernoff-Hoeffding Bounds for Applications with Limited Independence

Download www.cs.umd.edu

Jeanette P. Schmidt, Alan Siegel, Aravind Srinivas...

claim paper

Read More »

25

SODA
1993
ACM

109views Algorithms» more SODA 1993»

Dynamic Generation of Discrete Random Variates

13 years 11 months ago

Dynamic Generation of Discrete Random Variates

Download theory.stanford.edu

Yossi Matias, Jeffrey Scott Vitter, Wen-Chun Ni

claim paper

Read More »

25

SODA
1993
ACM

126views Algorithms» more SODA 1993»

The Stanford GraphBase: A Platform for Combinatorial Algorithms

13 years 11 months ago

The Stanford GraphBase: A Platform for Combinatorial Algorithms

Download www.tex.ac.uk

Donald E. Knuth

claim paper

Read More »

26

SODA
1993
ACM

118views Algorithms» more SODA 1993»

Scapegoat Trees

13 years 11 months ago

Scapegoat Trees

Download cg.scs.carleton.ca

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

claim paper

Read More »