A consistent semantics of self-adjusting computation
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- A Data Structure for Dynamically Maintaining Rooted Trees
- A data structure for dynamic trees
- A framework for defining logics
- An efficient algorithm for determining the convex hull of a finite planar set
- Computer programming and formal systems
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Maintenance of configurations in the plane
- Mechanizing metatheory in a logical framework
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Self-adjusting binary search trees
- Sparsification—a technique for speeding up dynamic graph algorithms
Cited in
(8)- Computing in unpredictable environments: semantics, reduction strategies, and program transformations
- Compiling self-adjusting programs with continuations
- A cost semantics for self-adjusting computation
- Imperative self-adjusting computation
- Implicit self-adjusting computation for purely functional programs
- Paraconsistent arithmetic with a local consistency operator and global selfreference
- Non-monotonic self-adjusting computation
- A Consistent Semantics of Self-adjusting Computation
This page was built for publication: A consistent semantics of self-adjusting computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5398334)
