A library for self-adjusting computation

Electronic Notes in Theoretical Computer Science

Volumn 148, Issue 2, 2006, Pages 127-154

  Acar, Umut ^a   Blelloch, Guy ^b   Blume, Matthias ^a   Harper, Robert ^b   Tangwongsan, Kanat ^b  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Change propagation; Computational geometry; Convex hulls; Incremental computation; Quickhull; Selective memoization

Indexed keywords

CHANGE PROPAGATION; CONVEX HULLS; INCREMENTAL COMPUTATION; QUICKHULL; SELECTIVE MEMORIZATION;

COMPUTATION THEORY; COMPUTATIONAL GEOMETRY; DATA REDUCTION; INTERFACES (COMPUTER); PROBLEM SOLVING; TECHNICAL WRITING;

LIBRARIES;

EID: 33644915821     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.11.043     Document Type: Conference Paper

References (22)

1. Acar, U.A., "Self-Adjusting Computation," Ph.D. thesis, Department of Computer Science, Carnegie Mellon University (2005)
2. Acar, U.A., G.E. Blelloch and R. Harper, Adaptive functional programming, in: Proceedings of the 29th Annual ACM Symposium on Principles of Programming Languages, 2002, pp. 247-259. URL citeseer.nj.nec.com/article/acar01adaptive. html
3. Acar, U.A., G.E. Blelloch and R. Harper, Selective memoization, in: Proceedings of the 30th Annual ACM Symposium on Principles of Programming Languages, 2003
4. Acar, U.A., 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
5. Brodal, G.S. and R. Jacob, Dynamic planar convex hull, in: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 617-626
6. Carlsson, M., Monads for incremental computing, in: Proceedings of the seventh ACM SIGPLAN international conference on Functional programming (2002), pp. 26-35
7. F. Darema Dynamic data driven applications systems: A new paradigm for application simulations and measurements Proceedings of Thirteenth International Symposium on Algorithms and Computation (ISAAC) Lecture Notes in Computer Science 3038 2004 662 669
8. F. Darema Dynamic data driven applications systems: New capabilities for application simulations and measurements Proceedings of Thirteenth International Symposium on Algorithms and Computation (ISAAC) Lecture Notes in Computer Science 3515 2005 610 615
9. M. de Berg, O. Schwarzkopf, M. van Kreveld, and M. Overmars Computational Geometry: Algorithms and Applications 2000 Springer-Verlag
10. Demers, A., 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, 1981, pp. 105-116
11. Erkök, L. and J. Launchbury, Recursive monadic bindings, in: ICFP '00: Proceedings of the fifth ACM SIGPLAN international conference on Functional programming (2000), pp. 174-185
12. R.L. Graham An efficient algorithm for determining the convex hull of a finete planar set Information Processing Letters 1 1972 132 133
13. Heydon, A., R. Levin and Y. Yu, Caching function calls using precise dependencies, in: Proceedings of the 2000 ACM SIGPLAN Conference on PLDI, 2000, pp. 311-320. URL citeseer.nj.nec.com/heydon00caching.html
14. Y.A. Liu, and T. Teitelbaum Systematic derivation of incremental programs Science of Computer Programming 24 1995 1 39 URL citeseer.nj.nec.com/ liu95systematic.html
15. Moore, C.H. and G.C. Leach, FORTH - A language for interactive computing (1970), amsterdam, NY: Mohasco Industries Inc. (internal pub.)
16. Mulmuley, K., Randomized multidimensional search trees: Lazy balancing and dynamic shuffling (extended abstract), in: Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science, 1991, pp. 180-196
17. M.H. Overmars The Design of Dynamic Data Structures 1983 Springer
18. M.H. Overmars, and J. van Leeuwen Maintenance of configurations in the plane Journal of Computer and System Sciences 23 1981 166 204
19. W. Pugh Skip lists: A probabilistic alternative to balanced trees Communications of the ACM 33 1990 668 676
20. Pugh, W. and T. Teitelbaum, Incremental computation via function caching, in: Proceedings of the 16th Annual ACM Symposium on Principles of Programming Languages, 1989, pp. 315-328
21. S. Weeks, M. Fluet, H. Cejtin, and S. Jagannathan Mlton http://mlton.org/ 2005
22. Wegman, M.N. and L. Carter, New classes and applications of hash functions, in: Proceedings of the 20th Annual IEEE Symposium on Foundations of Computer Science, 1979, pp. 175-182