Soft kinetic data structures

Authors:
Artur Czumaj;Christian Sohler
Affiliations:
Department of Computer and Information Science, New Jersey Institute of Technology, Newark, NJ;Heinz Nixdorf Institute and Department of Mathematics & Computer Science, University of Paderborn, D-33095 Paderborn, Germany
Venue:
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Year:
2001

Citing 17
Cited 4

Property testing in bounded degree graphs

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Proximity problems on moving points

SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A sublinear bipartiteness tester for bounded degree graphs

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Range searching

Handbook of discrete and computational geometry
Data structures for mobile data

Journal of Algorithms
Clustering in large graphs and matrices

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Comparison of access methods for time-evolving data

ACM Computing Surveys (CSUR)
Spot-checkers

Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
The soft heap: an approximate priority queue with optimal error rate

Journal of the ACM (JACM)
Robust Characterizations of Polynomials withApplications to Program Testing

SIAM Journal on Computing
Testing the Diameter of Graphs

RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
Parametric and Kinetic Minimum Spanning Trees

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Fast Monte-Carlo Algorithms for finding low-rank approximations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Testing Monotonicity

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Testing of clustering

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Approximate checking of polynomials and functional equations

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

Worst case mobility in ad hoc networks

Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
A computational framework for incremental motion

SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Kinetic and dynamic data structures for convex hulls and upper envelopes

Computational Geometry: Theory and Applications
Mobility in wireless networks

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the framework of soft kinetic data structures (SKDS). A soft kinetic data structure is an approximate data structure that can be used to answer queries on a set of moving objects with unpredictable motion. We analyze the quality of a soft kinetic data structure by giving a competitive analysis with respect to the dynamics of the system.We illustrate our approach by presenting soft kinetic data structures for maintaining classical data structures: sorted arrays, balanced search trees, heaps, and range trees. We also describe soft kinetic data structures for maintaining the Euclidean minimum spanning trees.