Algorithms | Sciweavers

39

click to vote

SODA
1994
ACM

97views Algorithms» more SODA 1994»

An Effective Additive Basis for the Integers

14 years 7 months ago

Download fourier.math.uoc.gr

Mihail N. Kolountzakis

claim paper

Read More »

53

click to vote

SODA
1994
ACM

88views Algorithms» more SODA 1994»

Optimal Prediction for Prefetching in the Worst Case

14 years 7 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 »

51

click to vote

SODA
1994
ACM

133views Algorithms» more SODA 1994»

Derandomizing Algorithms for Routing and Sorting on Meshes

14 years 7 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 »

46

click to vote

SODA
1994
ACM

72views Algorithms» more SODA 1994»

Moments of Inertia and Graph Separators

14 years 7 months ago

Download www.cs.cmu.edu

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

claim paper

Read More »

49

click to vote

SODA
1994
ACM

71views Algorithms» more SODA 1994»

A Sublinear Parallel Algorithm for Stable Matching

14 years 7 months ago

Download theory.stanford.edu

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

claim paper

Read More »

28

click to vote

SODA
1994
ACM

103views Algorithms» more SODA 1994»

Fast Comparison of Evolutionary Trees

14 years 7 months ago

Download www.cs.rutgers.edu

Martin Farach, Mikkel Thorup

claim paper

Read More »

31

click to vote

SODA
1994
ACM

93views Algorithms» more SODA 1994»

Clustering for Faster Network Simplex Pivots

14 years 7 months ago

Download comptop.stanford.edu

David Eppstein

claim paper

Read More »

59

click to vote

SODA
1994
ACM

138views Algorithms» more SODA 1994»

Average Case Analysis of Dynamic Geometric Optimization

14 years 7 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 »

28

click to vote

SODA
1994
ACM

81views Algorithms» more SODA 1994»

Approximately Counting Hamilton Cycles in Dense Graphs

14 years 7 months ago

Download www.math.cmu.edu

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

claim paper