SODA 1994 | Sciweavers

We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...

David Eppstein

claim paper

Read More »

14

click to vote

SODA
1994
ACM

81views Algorithms» more SODA 1994»

Approximately Counting Hamilton Cycles in Dense Graphs

13 years 10 months ago

Download www.math.cmu.edu

Martin E. Dyer, Alan M. Frieze, Mark Jerrum

claim paper

Read More »

22

click to vote

SODA
1994
ACM

67views Algorithms» more SODA 1994»

Linear and O(n log n) Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours

13 years 10 months ago

Download www.math.ucsd.edu

Samuel R. Buss, Peter N. Yianilos

claim paper

Read More »

21

click to vote

SODA
1994
ACM

85views Algorithms» more SODA 1994»

An Optimal Algorithm for Approximate Nearest Neighbor Searching

13 years 10 months ago

Download orion.math.iastate.edu

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

claim paper

Read More »

16

click to vote

SODA
1994
ACM

81views Algorithms» more SODA 1994»

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

13 years 10 months ago

Download tandem.bu.edu

Amihood Amir, Gary Benson, Martin Farach

claim paper

Read More »

17

click to vote

SODA
1994
ACM

63views Algorithms» more SODA 1994»

Matching Nuts and Bolts

13 years 10 months ago

Download www.cs.tau.ac.il

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

claim paper

Read More »

25

click to vote

SODA
1994
ACM

100views Algorithms» more SODA 1994»

Physical Mapping of Chromosomes Using Unique Probes

13 years 10 months ago

Download research.microsoft.com

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

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers