Daniel D. Sleator
90 works · 11,655 citations · h-index 33
Top works
- Amortized efficiency of list update and paging rules
- Self-adjusting binary search trees
- Competitive snoopy caching
- A locally adaptive data compression scheme
- A data structure for dynamic trees
- Parsing English with a Link Grammar
- Competitive algorithms for on-line problems
- Competitive paging algorithms
- Competitive algorithms for server problems
- Making data structures persistent
- A strongly competitive randomized paging algorithm
- A 2.5 times optimal algorithm for packing in two dimensions
- Self-adjusting binary trees
- An 0 (nm log n) algorithm for maximum network flow
- Self-Adjusting Heaps
- Competitive snoopy caching
- Making data structures persistent
- The pairing heap: A new form of self-adjusting heap
- Parsing English with a Link Grammar
- Two algorithms for maintaining order in a list