Soft kinetic data structures

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 865-872

  Czumaj, Artur ^a   Sohler, Christian ^b  

^a NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 64049112220     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Pankaj K. Agarwal, Range searching, Handbook of discrete and computational geometry, CRC Press, Inc., Boca Raton, FL, 1997
2. Pankaj K. Agarwal , David Eppstein , Leonidas J. Guibas , Monika R. Henzinger, Parametric and Kinetic Minimum Spanning Trees, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.596, November 08-11, 1998
3. N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy. Efficient testing of large graphs. In Proc. 40th FOCS, pp. 656- 666, 1999.
4. N. Alon , S. Dar , M. Parnas , D. Ron, Testing of clustering, Proceedings of the 41st Annual Symposium on Foundations of Computer Science, p.240, November 12-14, 2000
5. Julien Basch , Leonidas J. Guibas , Li Zhang, Proximity problems on moving points, Proceedings of the thirteenth annual symposium on Computational geometry, p.344-351, June 04-06, 1997, Nice, France [doi〉10.1145/262839. 262998]
6. Julien Basch , Leonidas J. Guibas, Data structures for mobile data, Journal of Algorithms, v.31 n.1, p.1-28, April 1999 [doi〉10.1006/jagm.1998. 0988 ]
7. Bernard Chazelle, The soft heap: an approximate priority queue with optimal error rate, Journal of the ACM (JACM), v.47 n.6, p.1012-1027, Nov. 2000 [doi〉10.1145/355541.355554]
8. Artur Czumaj , Christian Sohler , Martin Ziegler, Property Testing in Computational Geometry, Proceedings of the 8th Annual European Symposium on Algorithms, p.155-166, September 05-08, 2000
9. P. Drineas , Alan Frieze , Ravi Kannan , Santosh Vempala , V. Vinay, Clustering in large graphs and matrices, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.291-299, January 17-19, 1999, Baltimore, Maryland, United States
10. Funda Ergün , Sampath Kannan , S. Ravi Kumar , Ronitt Rubinfeld , Mahesh Viswanathan, Spot-checkers, Journal of Computer and System Sciences, v.60 n.3, p.717-751, June 2000 [doi〉10.1006/jcss.1999.1692]
11. A. Frieze and R. Kannan. Quick approximation to matrices and applications. Combinatorica, 19:175-220, 1999.
12. Alan Frieze , Ravi Kannan , Santosh Vempala, Fast Monte-Carlo Algorithms for finding low-rank approximations, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.370, November 08-11, 1998
13. F. Ergun , S. R. Kumar, Approximate checking of polynomials and functional equations, Proceedings of the 37th Annual Symposium on Foundations of Computer Science, p.592, October 14-16, 1996
14. Oded Goldreich , Shafi Goldwasser , Eric Lehman , Dana Ron, Testing Monotonicity, Proceedings of the 39th Annual Symposium on Foundations of Computer Science, p.426, November 08-11, 1998
15. Oded Goldreich , Shari Goldwasser , Dana Ron, Property testing and its connection to learning and approximation, Journal of the ACM (JACM), v.45 n.4, p.653-750, July 1998 [doi〉10.1145/285055.285060]
16. Oded Goldreich , Dana Ron, Property testing in bounded degree graphs, Proceedings of the twenty-ninth annual ACM symposium on Theory of computing, p.406-415, May 04-06, 1997, El Paso, Texas, United States [doi〉10.1145/ 258533.258627]
17. Oded Goldreich , Dana Ron, A sublinear bipartiteness tester for bounded degree graphs, Proceedings of the thirtieth annual ACM symposium on Theory of computing, p.289-298, May 24-26, 1998, Dallas, Texas, United States [doi〉10.1145/276698.276767]
18. Michal Parnas , Dana Ron, Testing the Diameter of Graphs, Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques, p.85-96, August 08-11, 1999
19. D. Ron. Property testing. In Handobook of Randomized Algorithms. Kluwer Academic Publishers, 2000. To appear.
20. Ronitt Rubinfeld , Madhu Sudan, Robust Characterizations of Polynomials withApplications to Program Testing, SIAM Journal on Computing, v.25 n.2, p.252-271, February 1996 [doi〉10.1137/S0097539793255151]
21. Betty Salzberg , Vassilis J. Tsotras, Comparison of access methods for time-evolving data, ACM Computing Surveys (CSUR), v.31 n.2, p.158-221, June 1999 [doi〉10.1145/319806.319816]