A consistent semantics of self-adjusting computation
From MaRDI portal
Publication:5398334
DOI10.1017/S0956796813000099zbMath1310.68054MaRDI QIDQ5398334
Matthias Blume, Umut A. Acar, Jacob Donham
Publication date: 27 February 2014
Published in: Journal of Functional Programming (Search for Journal in Brave)
Theory of programming languages (68N15) Functional programming and lambda calculus (68N18) Semantics in the theory of computing (68Q55)
Cites Work
- Unnamed Item
- Computer programming and formal systems
- Maintenance of configurations in the plane
- A data structure for dynamic trees
- An efficient algorithm for determining the convex hull of a finite planar set
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Self-adjusting binary search trees
- A framework for defining logics
- A Data Structure for Dynamically Maintaining Rooted Trees
- Sparsification—a technique for speeding up dynamic graph algorithms
- Mechanizing metatheory in a logical framework
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
