Computing Atlas

How Computing Was Built
Sign In
Text size
100%
Theme
Pioneer

Daniel Sleator

Also Known As Daniel Dominic Kaplan Sleator
Theory of Computation

Daniel Dominic Kaplan Sleator is a professor of computer science at Carnegie Mellon University who won the 1999 ACM Paris Kanellakis Award jointly with Robert Tarjan for the splay tree data structure. He was one of the pioneers of amortized analysis of algorithms, with early examples including the move-to-front heuristic and splay trees, and he invented several data structures with Tarjan, including splay trees, link/cut trees and skew heaps; the Sleator-Tarjan paper on the move-to-front heuristic first suggested comparing an online algorithm to an optimal offline algorithm, an idea later named competitive analysis. He also developed the theory of link grammars and the Serioso music analyzer for analyzing meter and harmony in written music.

Facts
Birth Year
1953 1
Birth Date
1953-12-10 1
Nationality
American 1
In the Other Atlases
Sources
1. Wikipedia: Daniel Sleator
Wikimedia Foundation
  • lead sentence
    Daniel Dominic Kaplan Sleator (born 10 December 1953) is a professor of computer science at Carnegie Mellon University, Pittsburgh, United States.
  • infobox short description
    American computer scientist
View the Source
Daniel Sleator (Wikidata)
  • Wikidata alias: Daniel Dominic Kaplan Sleator
    Daniel Dominic Kaplan Sleator
  • Wikidata P166: Paris Kanellakis Award
    Wikidata P166 (award received): Paris Kanellakis Award.
View the Source
Comments (0)
No comments yet. Be the first to share a thought.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.