Algorithms | Sciweavers

23

click to vote

SODA
1994
ACM

97views Algorithms» more SODA 1994»

An Effective Additive Basis for the Integers

13 years 11 months ago

Download fourier.math.uoc.gr

Mihail N. Kolountzakis

claim paper

Read More »

30

click to vote

SODA
1994
ACM

88views Algorithms» more SODA 1994»

Optimal Prediction for Prefetching in the Worst Case

13 years 11 months ago

Download www.ittc.ku.edu

Response time delays caused by I/O are a major problem in many systems and database applications. Prefetching and cache replacement methods are attracting renewed attention because...

P. Krishnan, Jeffrey Scott Vitter

claim paper

Read More »

26

click to vote

SODA
1994
ACM

133views Algorithms» more SODA 1994»

Derandomizing Algorithms for Routing and Sorting on Meshes

13 years 11 months ago

Download cis.poly.edu

We describe a new technique that can be used to derandomize a number of randomized algorithms for routing and sorting on meshes. We demonstrate the power of this technique by deri...

Michael Kaufmann, Jop F. Sibeyn, Torsten Suel

claim paper

Read More »

25

click to vote

SODA
1994
ACM

72views Algorithms» more SODA 1994»

Moments of Inertia and Graph Separators

13 years 11 months ago

Download www.cs.cmu.edu

Keith D. Gremban, Gary L. Miller, Shang-Hua Teng

claim paper

Read More »

29

click to vote

SODA
1994
ACM

71views Algorithms» more SODA 1994»

A Sublinear Parallel Algorithm for Stable Matching

13 years 11 months ago

Download theory.stanford.edu

Tomás Feder, Nimrod Megiddo, Serge A. Plotk...

claim paper

Read More »

18

click to vote

SODA
1994
ACM

103views Algorithms» more SODA 1994»

Fast Comparison of Evolutionary Trees

13 years 11 months ago

Download www.cs.rutgers.edu

Martin Farach, Mikkel Thorup

claim paper

Read More »

19

click to vote

SODA
1994
ACM

93views Algorithms» more SODA 1994»

Clustering for Faster Network Simplex Pivots

13 years 11 months ago

Download comptop.stanford.edu

David Eppstein

claim paper

Read More »

33

click to vote

SODA
1994
ACM

138views Algorithms» more SODA 1994»

Average Case Analysis of Dynamic Geometric Optimization

13 years 11 months ago

Download www.ics.uci.edu

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 11 months ago

Download www.math.cmu.edu

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

claim paper