Daniel Sleator
Computer Scientist
1953 –
Who is Daniel Sleator?
Daniel Dominic Kaplan Sleator is a Professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 1999, he won the ACM Paris Kanellakis Award for the splay tree data structure.
He was one of the pioneers in amortized analysis of algorithms, early examples of which were the analyses of the move-to-front heuristic, and splay trees. He invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps.
The Sleator and Tarjan paper on the move-to-front heuristic first suggested the idea of comparing an online algorithm to an optimal offline algorithm, for which the term competitive analysis was later coined in a paper of Karlin, Manasse, Rudolph, and Sleator. Sleator also developed the theory of link grammars, and the Serioso music analyzer for analyzing meter and harmony in written music.
We need you!
Help us build the largest biographies collection on the web!
- Born
- 1953
- Nationality
- United States of America
- Profession
- Employment
- Carnegie Mellon University
- Lived in
- Pittsburgh
Submitted
on July 23, 2013
Citation
Use the citation below to add to a bibliography:
Style:MLAChicagoAPA
"Daniel Sleator." Biographies.net. STANDS4 LLC, 2024. Web. 10 May 2024. <https://www.biographies.net/people/en/daniel_sleator>.
Discuss this Daniel Sleator biography with the community:
Report Comment
We're doing our best to make sure our content is useful, accurate and safe.
If by any chance you spot an inappropriate comment while navigating through our website please use this form to let us know, and we'll take care of it shortly.
Attachment
You need to be logged in to favorite.
Log In