Sciweavers

79
Voted
SODA
1994
ACM
81views Algorithms» more  SODA 1994»
15 years 1 months ago
Spanning Trees Short or Small
R. Ravi, Ravi Sundaram, Madhav V. Marathe, Daniel ...
72
Voted
SODA
1994
ACM
61views Algorithms» more  SODA 1994»
15 years 1 months ago
Maintaining Dynamic Sequences Under Equality-Tests in Polylogarithmic Time
Kurt Mehlhorn, R. Sundar, Christian Uhrig
79
Voted
SODA
1994
ACM
105views Algorithms» more  SODA 1994»
15 years 1 months ago
Approximate Data Structures with Applications
Abstract Yossi Matias Je rey Scott Vitter y Neal E. Young z In this paper we introduce the notion of approximate data structures, in which a small amount of error is tolerated in...
Yossi Matias, Jeffrey Scott Vitter, Neal E. Young
73
Voted
SODA
1994
ACM
75views Algorithms» more  SODA 1994»
15 years 1 months ago
Online Interval Scheduling
Richard J. Lipton, Andrew Tomkins
72
Voted
SODA
1994
ACM
97views Algorithms» more  SODA 1994»
15 years 1 months ago
An Effective Additive Basis for the Integers
Mihail N. Kolountzakis
94
Voted
SODA
1994
ACM
88views Algorithms» more  SODA 1994»
15 years 1 months ago
Optimal Prediction for Prefetching in the Worst Case
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
SODA
1994
ACM
133views Algorithms» more  SODA 1994»
15 years 1 months ago
Derandomizing Algorithms for Routing and Sorting on Meshes
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
78
Voted
SODA
1994
ACM
72views Algorithms» more  SODA 1994»
15 years 1 months ago
Moments of Inertia and Graph Separators
Keith D. Gremban, Gary L. Miller, Shang-Hua Teng