Self-adjusting binary search trees
Journal of the ACM (JACM)
Incremental graph evaluation (attribute grammar)
Incremental graph evaluation (attribute grammar)
A data structure for dynamic trees
Journal of Computer and System Sciences
Incremental computation via function caching
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental reduction in the lambda calculus
LFP '90 Proceedings of the 1990 ACM conference on LISP and functional programming
INC: a language for incremental computations
ACM Transactions on Programming Languages and Systems (TOPLAS)
Incremental reduction in the lambda calculus and related reduction systems
Incremental reduction in the lambda calculus and related reduction systems
Dynamic expression trees and their applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Analysis and caching of dependencies
Proceedings of the first ACM SIGPLAN international conference on Functional programming
A data structure for dynamically maintaining rooted trees
Journal of Algorithms
Dynamic trees as search trees via Euler tours, applied to the network simplex algorithm
Mathematical Programming: Series A and B
Sparsification—a technique for speeding up dynamic graph algorithms
Journal of the ACM (JACM)
Static caching for incremental computation
ACM Transactions on Programming Languages and Systems (TOPLAS)
Implementation of dynamic trees with in-subtree operations
Journal of Experimental Algorithmics (JEA)
Data structures for mobile data
Journal of Algorithms
Data structures for mobile data
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Average case analysis of dynamic geometric optimization
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Incremental and decremental maintenance of planar width
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Randomized fully dynamic graph algorithms with polylogarithmic time per operation
Journal of the ACM (JACM)
Caching function calls using precise dependencies
PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
An optimal real-time algorithm for planar convex hulls
Communications of the ACM
Adaptive functional programming
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Incremental evaluation for attribute grammars with application to syntax-directed editors
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monads for incremental computing
Proceedings of the seventh ACM SIGPLAN international conference on Functional programming
Optimal-time incremental semantic analysis for syntax-directed editors
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithmic issues in modeling motion
ACM Computing Surveys (CSUR)
POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Minimizing Diameters of Dynamic Trees
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Maintaining Minimum Spanning Trees in Dynamic Graphs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
On Maintaining the Width and Diameter of a Planar Point-Set Online
ISA '91 Proceedings of the 2nd International Symposium on Algorithms
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Dynamic Planar Convex Hull Operations in Near-Logarithmic Amortized Time
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Dynamic Programming
Dynamizing static algorithms, with applications to dynamic trees and history independence
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
An empirical comparison of techniques for updating Delaunay triangulations
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Self-adjusting computation
An experimental analysis of self-adjusting computation
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Kinetic 3D convex hulls via self-adjusting computation
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
A package for exact kinetic data structures and sweepline algorithms
Computational Geometry: Theory and Applications
DITTO: automatic incrementalization of data structure invariant checks (in Java)
Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Kinetic algorithms via self-adjusting computation
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Kinetic data structures in practice
Kinetic data structures in practice
Imperative self-adjusting computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Memory management for self-adjusting computation
Proceedings of the 7th international symposium on Memory management
Parallel tree contraction and its application
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Compiling self-adjusting programs with continuations
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming
A cost semantics for self-adjusting computation
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
CEAL: a C-based language for self-adjusting computation
Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
A consistent semantics of self-adjusting computation
ESOP'07 Proceedings of the 16th European conference on Programming
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Kinetic and dynamic data structures for convex hulls and upper envelopes
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Dyna: extending datalog for modern AI
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
| Hi-index | 0.00 |
In self-adjusting computation, programs respond automatically and efficiently to modifications to their data by tracking the dynamic data dependences of the computation and incrementally updating the output as needed. In this tutorial, we describe the self-adjusting-computation model and present the language ΔML (Delta ML) for writing self-adjusting programs.