Kinetic algorithms via self-adjusting computation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4168 LNCS, Issue , 2006, Pages 636-647

  Acar, Umut A ^a   Blelloch, Guy E ^b   Tangwongsan, Kanat ^b   Vittes, Jorge L ^c  

^a TOYOTA TECHNOLOGICAL INSTITUTE   (Japan)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SCIENCE; MATHEMATICAL TRANSFORMATIONS; ROBUSTNESS (CONTROL SYSTEMS); SYNTACTICS;

FLOATING-POINT ARITHMETIC; KINETIC ALGORITHMS; STATIC ALGORITHMS;

ALGORITHMS;

EID: 33750693712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11841036_57     Document Type: Conference Paper

References (21)

1. Umut A. Acar. Self-Adjusting Computation. PhD thesis, Department of Computer Science, Carnegie Mellon University, May 2005.
2. Umut A. Acar, Guy E. Blelloch, Matthias Blume, Robert Harper, and Kanal Tangwongsan. A library for self-adjusting computation. In ACM SIGPLAN Workshop on ML, 2005.
3. Umut A. Acar, Guy E. Bleiloch, Matthias Blume, and Kanal Tangwongsan. An experimental analysis of self-adjusting computation, 2006. Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation.
4. Umut A. Acar, Guy E. Blelloch, and Robert Harper. Adaptive functional programming. In Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages, pages 247-259, 2002.
5. Umut A. Acar, Guy E. Blelloch, and Robert Harper. Selective memoization. In Proceedings of the 30th Annual ACM Symposium on Principles of Programming Languages, 2003.
6. Umut A. Acar, Guy E. Blelloch, Robert Harper, Jorge L. Vittes, and Maverick Woo. Dynamizing static algorithms with applications to dynamic trees and history independence. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.
7. Umut A. Acar, Guy E. Blelloch, Kanat Tangwongsan, and Jorge L. Vittes. Kinetic algorithms via self-adjusting computation. Technical Report CMU-CS-06-115, Department of Computer Science, Carnegie Mellon University, March 2006.
8. Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, and Monika Rauch Henzinger. Parametric and kinetic minimum spanning trees. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 596-605, 1998.
9. Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger, and Eric Veach. Maintaining the extent of a moving set of points. Discrete and Computational Geometry, 26(3):353-374, 2001.
10. Giora Alexandron, Haim Kaplan, and Micha Sharir. Kinetic and dynamic data structures for convex hulls and upper envelopes. In 9th Workshop on Algorithms and Data Structures (WADS). Lecture Notes in Computer Science, volume 3608, pages 269-281, aug 2005.
11. C. Bradford Barber, David P. Dobkin, and Hannu Huhdanpaa. The quickhull algorithm for convex hulls. ACM Trans. Math. Softw., 22(4):469-483, 1996.
12. Julien Basch. Kinetic Data Structures. PhD thesis, Department of Computer Science, Stanford University, June 1999.
13. Julien Basch, Leonidas J. Guibas, and John Hershberger. Data structures for mobile data. Journal of Algorithms, 31(1):l-28, 1999.
14. Julien Basch, Leonidas J. Guibas, Craig D. Silverstein, and Li Zhang. A practical evaluation of kinetic data structures. In SCG '97: Proceedings of the thirteenth annual symposium on Computational geometry, pages 388-390, New York, NY, USA, 1997. ACM Press.
15. Timothy M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete and Computational Geometry, 16:361-368, 1996.
16. R. L. Graham. An efficient algorithm for determining the convex hull of a finete planar set. Information Processing Letters, 1:132-133, 1972.
17. Leonidas Guibas, Menelaos Karaveles, and Daniel Russel. A computational framework for handling motion. In Proceedings of teh Sixth Workshop on Algorithm Engineering and Experiments, pages 129-141, 2004.
18. Leonidas Guibas and Daniel Russel. An empirical comparison of techniques for updating delaunay triangulations. In SCG '04: Proceedings of the twentieth annual symposium on Computational geometry, pages 170-179, New York, NY, USA, 2004. ACM Press.
19. Leonidas J. Guibas and Menelaos I. Karavelas. Interval methods for kinetic simulations. In SCG '99: Proceedings of the fifteenth annual symposium on Computational geometry, pages 255-264. ACM Press, 1999.
20. F. P. Preparata and M. I. Shamos. Computational Geometry. Springer-Verlag Inc., 1985.
21. Michael I. Shamos. Computational Geometry. PhD thesis, Department of Computer Science, Yale University, 1978.