Sciweavers

SODA
2004
ACM
76views Algorithms» more  SODA 2004»
13 years 9 months ago
Network failure detection and graph connectivity
Jon M. Kleinberg, Mark Sandler, Aleksandrs Slivkin...
SODA
2004
ACM
98views Algorithms» more  SODA 2004»
13 years 9 months ago
End-to-end packet-scheduling in wireless ad-hoc networks
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...
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
13 years 9 months ago
Improved upper bounds for 3-SAT
Kazuo Iwama, Suguru Tamaki
SODA
2004
ACM
107views Algorithms» more  SODA 2004»
13 years 9 months ago
A note on the nearest neighbor in growth-restricted metrics
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...
SODA
2004
ACM
104views Algorithms» more  SODA 2004»
13 years 9 months ago
Variable length path coupling
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
SODA
2004
ACM
131views Algorithms» more  SODA 2004»
13 years 9 months ago
When indexing equals compression: experiments with compressing suffix arrays and applications
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
SODA
2004
ACM
110views Algorithms» more  SODA 2004»
13 years 9 months ago
Algorithms for infinite huffman-codes
Mordecai J. Golin, Kin Keung Ma
SODA
2004
ACM
144views Algorithms» more  SODA 2004»
13 years 9 months ago
Covering minimum spanning trees of random subgraphs
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
SODA
2004
ACM
81views Algorithms» more  SODA 2004»
13 years 9 months ago
Succinct ordinal trees with level-ancestor queries
Richard F. Geary, Rajeev Raman, Venkatesh Raman
SODA
2004
ACM
94views Algorithms» more  SODA 2004»
13 years 9 months ago
Fair and efficient router congestion control
Xiaojie Gao, Kamal Jain, Leonard J. Schulman