SODA 2004 | Sciweavers

31

click to vote

SODA
2004
ACM

76views Algorithms» more SODA 2004»

Network failure detection and graph connectivity

14 years 1 months ago

Download www.cs.cornell.edu

Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkin...

claim paper

Read More »

32

click to vote

SODA
2004
ACM

98views Algorithms» more SODA 2004»

End-to-end packet-scheduling in wireless ad-hoc networks

14 years 1 months ago

Download domino.research.ibm.com

Abstract Packet-scheduling is a particular challenge in wireless networks due to interference from nearby transmissions. A distance-2 interference model serves as a useful abstract...

V. S. Anil Kumar, Madhav V. Marathe, Srinivasan Pa...

claim paper

Read More »

29

click to vote

SODA
2004
ACM

94views Algorithms» more SODA 2004»

Improved upper bounds for 3-SAT

14 years 1 months ago

Download www.inf.ethz.ch

Kazuo Iwama, Suguru Tamaki

claim paper

Read More »

49

click to vote

SODA
2004
ACM

107views Algorithms» more SODA 2004»

A note on the nearest neighbor in growth-restricted metrics

14 years 1 months ago

Download oceanstore.cs.berkeley.edu

In this paper, we give results relevant to sequential and distributed dynamic data structures for finding nearest neighbors in growth-restricted metrics. Our sequential data struc...

Kirsten Hildrum, John Kubiatowicz, Sean Ma, Satish...

claim paper

Read More »

34

click to vote

SODA
2004
ACM

104views Algorithms» more SODA 2004»

Variable length path coupling

14 years 1 months ago

Download www.cc.gatech.edu

We present a new technique for constructing and analyzing couplings to bound the convergence rate of finite Markov chains. Our main theorem is a generalization of the path couplin...

Thomas P. Hayes, Eric Vigoda

claim paper

Read More »

38

click to vote

SODA
2004
ACM

131views Algorithms» more SODA 2004»

When indexing equals compression: experiments with compressing suffix arrays and applications

14 years 1 months ago

Download www.ittc.ku.edu

We report on a new experimental analysis of high-order entropy-compressed suffix arrays, which retains the theoretical performance of previous work and represents an improvement in...

Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter

claim paper

Read More »

26

click to vote

SODA
2004
ACM

110views Algorithms» more SODA 2004»

Algorithms for infinite huffman-codes

14 years 1 months ago

Download www.cse.ust.hk

Mordecai J. Golin, Kin Keung Ma

claim paper

Read More »

41

click to vote

SODA
2004
ACM

144views Algorithms» more SODA 2004»

Covering minimum spanning trees of random subgraphs

14 years 1 months ago

Download www-math.mit.edu

We consider the problem of finding a sparse set of edges containing the minimum spanning tree (MST) of a random subgraph of G with high probability. The two random models that we ...

Michel X. Goemans, Jan Vondrák

claim paper

Read More »

22

click to vote

SODA
2004
ACM

81views Algorithms» more SODA 2004»

Succinct ordinal trees with level-ancestor queries

14 years 1 months ago