Amortized efficiency of list update and paging rules
- D. Sleator, R. Tarjan
- Computer ScienceCACM
- 1 February 1985
This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.
Self-adjusting binary search trees
- D. Sleator, R. Tarjan
- Computer ScienceJACM
- 1 July 1985
The splay tree, a self-adjusting form of binary search tree, is developed and analyzed and is found to be as efficient as balanced trees when total running time is the measure of interest.
A data structure for dynamic trees
- D. Sleator, R. Tarjan
- Computer ScienceSymposium on the Theory of Computing
- 11 May 1981
An O(mn log n)-time algorithm is obtained to find a maximum flow in a network of n vertices and m edges, beating by a factor of log n the fastest algorithm previously known for sparse graphs.
Parsing English with a Link Grammar
- D. Sleator, D. Temperley
- Computer Science, LinguisticsInternational Workshop/Conference on Parsing…
- 2 August 1995
This work has encoded English grammar into a new formal grammatical system called a link grammar, and written a program (based on new algorithms) for efficiently parsing with this very complex grammar.
Making data structures persistent
- James R. Driscoll, Neil Sarnak, D. Sleator, R. Tarjan
- Computer ScienceSymposium on the Theory of Computing
- 1 November 1986
This paper develops simple, systematic, and efficient techniques for making linked data structures persistent, and uses them to devise persistent forms of binary search trees with logarithmic access, insertion, and deletion times and O (1) space bounds for insertion and deletion.
Competitive Algorithms for Server Problems
- M. Manasse, L. A. McGeoch, D. Sleator
- Computer ScienceJ. Algorithms
- 1 May 1990
Two algorithms for maintaining order in a list
- Paul F. Dietz, D. Sleator
- Computer ScienceSymposium on the Theory of Computing
- 1 January 1987
The order maintenance problem is that of maintaining a list under a sequence of Insert and Delete operations, while answering Order queries (determine which of two elements comes first in the list).…
Competitive snoopy caching
- Anna R. Karlin, M. Manasse, L. Rudolph, D. Sleator
- Computer Science27th Annual Symposium on Foundations of Computer…
- 27 October 1986
This work presents new on-line algorithms to be used by the caches of snoopy cache multiprocessor systems to decide which blocks to retain and which to drop in order to minimize communication over the bus.
Rotation distance, triangulations, and hyperbolic geometry
- D. Sleator, R. Tarjan, W. Thurston
- Computer ScienceSymposium on the Theory of Computing
- 1 November 1986
A tight bound is established on the maximum rotation distance between two A2-node trees for all large n, using volumetric arguments in hyperbolic 3-space, and is given on the minimum number of tetrahedra needed to dissect a polyhedron in the worst case.
A locally adaptive data compression scheme
- J. Bentley, D. Sleator, R. Tarjan, V. K. Wei
- Computer ScienceCACM
- 1 April 1986
A data compression scheme that exploits locality of reference, such as occurs when words are used frequently over short intervals and then fall into long periods of disuse, is described and proves that it never performs much worse than Huffman coding and can perform substantially better.
...
...