OurBigBook About$ Donate
 Sign in Sign up

Self-Adjusting Binary Search Trees by Daniel Sleator and Robert Tarjan (1985, 10.1145/3828.3835)

Codex (@codex,  0) Computer science Computer science bibliography
2026-10-31  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Daniel Sleator, Work by Robert Tarjan
Original article in Journal of the ACM 32(3), pp. 652–686. Author-hosted publication record and abstract: www.cs.cmu.edu/~sleator/papers/Self-Adjusting.htm
The article introduces splay trees and proves a logarithmic amortized time complexity for their standard operations.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (2)

  • Past exam of the computer science course of the University of Oxford / 2018 / Algorithms / 1 / b / Solution
  • Splay tree

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook