An experimental analysis of self-adjusting computation

ACM SIGPLAN Notices

Volumn 41, Issue 6, 2006, Pages 96-107

  Acar, Umut A ^a   Blelloch, Guy E ^b   Blume, Matthias ^a   Tangwongsan, Kanal ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE   (Japan)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Computational geometry; Dynamic algorithms; Dynamic dependence graphs; Memoization; Performance; Self adjusting computation

Indexed keywords

DYNAMIC ALGORITHMS; DYNAMIC DEPENDENCE GRAPHS; MEMOIZATION; SELF ADJUSTING COMPUTATION;

ADAPTIVE ALGORITHMS; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; DYNAMIC PROGRAMMING; GRAPH THEORY; PERFORMANCE;

COMPUTER PROGRAMMING;

EID: 33745206541     PISSN: 03621340     EISSN: 03621340     Source Type: Journal    
DOI: 10.1145/1133255.1133993     Document Type: Article

References (34)

1. M. Abadi, B. W. Lampson, and J.-J. Levy. Analysis and caching of dependencies. In International Conference on Functional Programming, pages 83-91, 1996.
2. U. A. Acar. Self-Adjusting Computation. PhD thesis, Department of Computer Science, Carnegie Mellon University, May 2005.
3. U. A. Acar, G. E. Blelloch, M. Blume, R. Harper, and K. Tangwongsan. A library for self-adjusting computation. In ACM SIGPLAN Workshop on ML, 2005.
4. U. A. Acar, G. E. Blelloch, and R. Harper. Adaptive functional programming. In Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages, pages 247-259, 2002.
5. U. A. Acar, G. E. Blelloch, and R. Harper. Selective memoization. In Proceedings of the 30th Annual ACM Symposium on Principles of Programming Languages, 2003.
6. U. A. Acar, G. E. Blelloch, R. Harper, J. L. Vittes, and M. Woo. Dynamizing static algorithms with applications to dynamic trees and history independence. In ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.
7. U. A. Acar, G. E. Blelloch, K. Tangwongsan, and J. Vittes. Kinetic algorithms via self-adjusting computation. Technical Report CMU-CS-06-115, Department of Computer Science, Carnegie Mellon University, March 2006.
8. U. A. Acar, G. E. Blelloch, and J. L. Vittes. An experimental analysis of change propagation in dynamic trees. In Workshop on Algorithm. Engineering and Experimentation, 2005.
9. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The quickhull algorithm for convex hulls. ACM Trans. Math. Softw., 22(4):469-483, 1996.
10. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
11. M. A. Bender, R. Cole, E. D. Demaine, M. Farach-Colton, and J. Zito. Two simplified algorithms for maintaining order in a list. In Lecture Notes in Computer Science, pages 152-164, 2002.
12. G. S. Brodal and R. Jacob. Dynamic planar convex hull. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 617-626, 2002.
13. M. Carlsson. Monads for incremental computing. In Proceedings of the seventh ACM SICPLAN international conference on Functional programming, pages 26-35. ACM Press, 2002.
14. T. M. Chan. Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete and Computational Geometry, 16:361-368, 1996.
15. T. M. Chan. Dynamic planar convex hull operations in near-logarithmic amortized time. J. ACM, 48(1):1-12, 2001.
16. Y.-J. Chiang and R. Tamassia. Dynamic algorithms in computational geometry. Proceedings of the. IEEE, 80(9): 1412-1434, 1992.
17. A. Demers, T. Reps, and T. Teitelbaum. Incremental evaluation of attribute grammars with application to syntax directed editors. In Proceedings of the 8th Annual ACM Symposium on Principles of Programming Languages, pages 105-116, 1981.
18. P. F. Dietz and D. D. Sleator. Two algorithms for maintaining order in a list. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 365-372, 1987.
19. D. Eppstein, Z. Galil, and G. F. Italiano. Dynamic graph algorithms. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, chapter 8. CRC Press, 1999.
20. R. L. Graham. An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1:132-133, 1972.
21. A. Heydon, R. Levin, and Y. Yu. Caching function calls using precise dependencies. In Proceedings of the 2000 ACM SIGPLAN Conference on PLDI, pages 311-320, May 2000.
22. D. G. Kirkpatrick and R. Seidel. The ultimate planar convex hull algorithm. SIAM Journal on Computing, 15(2):287-299, 1986.
23. D. Knuth. The Art of Computer Programming: Sorting and Searching. Addison Wesley, 1998.
24. Y. A. Liu, S. Stoller, and T. Teitelbaum. Discovering auxiliary information for incremental computation. In Proceedings of the 23rd Annual ACM Symposium, on Principles of Programming Languages, pages 157-170, 1996.
25. Y. A. Liu, S. Stoller, and T. Teitelbaum. Static caching for incremental computation. ACM Transactions on Programming Languages and Systems, 20(3):546-585, 1998.
26. J. McCarthy. A Basis for a Mathematical Theory of Computation. In P. Braffort and D. Hirschberg, editors, Computer Programming and Formal Systems, pages 33-70. North-Holland, Amsterdam, 1963.
27. D. Michie. Memo functions and machine learning. Nature, 218:19-22, 1968.
28. M. H. Overmans and J. van Leeuwen. Maintenance of configurations in the plane. Journal of Computer and System Sciences, 23:166-204, 1981.
29. W. Pugh. Incremental computation via function caching. PhD thesis, Department of Computer Science, Cornell University, August 1988.
30. W. Pugh and T. Teitelbaum. Incremental computation via function caching. In Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, pages 315-328, 1989.
31. G. Ramalingam and T. Reps. A categorized bibliography on incremental computation. In Conference Record of the 20th Annual ACM Symposium on POPL, pages 502-510, Jan. 1993.
32. R. Seidel. Linear programming and convex hulls made easy. In SCG 90: Proceedings of the sixth annual symposium on Computational geometry, pages 211-215, New York, NY, USA, 1990. ACM Press.
33. M. I. Shamos. Computational Geometry. PhD thesis, Department of Computer Science, Yale University, 1978.
34. R. Wenger. Randomized quickhull. Algorithmic, 17(3):322-329, 1997.