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
Connections
In Field
Source Wikipedia: Daniel Sleator
In the Other Atlases
Nationality
Also in Geography Atlas: the nationality of this subject.
Sources
1. Wikidata: Daniel Sleator
- Wikidata Q5218783, class allow-list match (w-wdresolver-0926)
- Wikidata Q5218783 P569 (date of birth)
2. Wikipedia: Daniel Sleator
Wikimedia Foundationlead 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
- In Field: Algorithms and Complexity Theory, Lead paragraph
View the Source Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.