Daniel Sleator: Difference between revisions
Minor wording fixes. |
No edit summary |
||
| Line 1: | Line 1: | ||
{{Infobox scientist |
|||
|name = Daniel Sleator |
|||
|image = |
|||
|image_size = |
|||
|caption = |
|||
|birth_date = |
|||
|birth_place = |
|||
|death_date = |
|||
|death_place = |
|||
|residence = [[Pittsburgh]] |
|||
|citizenship = |
|||
|nationality = |
|||
|ethnicity = |
|||
|fields = [[Computer Science]] |
|||
|workplaces = [[Carnegie Mellon University]] |
|||
|alma_mater = |
|||
|doctoral_advisor = |
|||
|academic_advisors = |
|||
|doctoral_students = |
|||
|notable_students = |
|||
|thesis_url = |
|||
|thesis_title = |
|||
|thesis_year = |
|||
|known_for = |
|||
|author_abbrev_bot = |
|||
|author_abbrev_zoo = |
|||
|influences = |
|||
|influenced = |
|||
|awards = |
|||
|religion = |
|||
|signature = |
|||
|footnotes = |
|||
}} |
|||
'''Daniel Dominic Kaplan Sleator''' (born 10 December 1953 in [[St. Louis]])<ref>''American Men and Women of Science'', Thomson Gale, 2004</ref> is a Professor of [[Computer Science]] at [[Carnegie Mellon University]], [[Pittsburgh]], United States. In 1999, he won the [[Association for Computing Machinery|ACM]] [[Paris Kanellakis Award]] (jointly with [[Robert Tarjan]]) for the [[splay tree]] data structure.<ref>[http://www.acm.org/announcements/pk_award_1999.html Citation for Sleator and Tarjan Kanellakis Award]</ref> |
'''Daniel Dominic Kaplan Sleator''' (born 10 December 1953 in [[St. Louis]])<ref>''American Men and Women of Science'', Thomson Gale, 2004</ref> is a Professor of [[Computer Science]] at [[Carnegie Mellon University]], [[Pittsburgh]], United States. In 1999, he won the [[Association for Computing Machinery|ACM]] [[Paris Kanellakis Award]] (jointly with [[Robert Tarjan]]) for the [[splay tree]] data structure.<ref>[http://www.acm.org/announcements/pk_award_1999.html Citation for Sleator and Tarjan Kanellakis Award]</ref> |
||
Revision as of 18:50, 31 March 2014
Daniel Sleator | |
|---|---|
| Scientific career | |
| Fields | Computer Science |
| Institutions | Carnegie Mellon University |
Daniel Dominic Kaplan Sleator (born 10 December 1953 in St. Louis)[1] is a Professor of Computer Science at Carnegie Mellon University, Pittsburgh, United States. In 1999, he won the ACM Paris Kanellakis Award (jointly with Robert Tarjan) for the splay tree data structure.[2]
He was one of the pioneers in amortized analysis of algorithms, early examples of which were the analyses of the move-to-front heuristic,[3] and splay trees.[4] 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[3] 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.[5] Sleator also developed the theory of link grammars, and the Serioso music analyzer for analyzing meter and harmony in written music.
Personal life
Sleator commercialized the volunteer-based Internet Chess Server into the Internet Chess Club despite outcry from fellow volunteers. The ICS has since become one of the most successful internet-based commercial chess servers.
He is the brother of William Sleator, who wrote science fiction for young adults.
Sleator has hosted the progressive talk show Left Out on WRCT-FM with fellow host and School of Computer Science faculty member Bob Harper.
References
- ^ American Men and Women of Science, Thomson Gale, 2004
- ^ Citation for Sleator and Tarjan Kanellakis Award
- ^ a b Sleator, Daniel D.; Tarjan, Robert E. (1985), "Amortized efficiency of list update and paging rules" (PDF), Communications of the ACM (Association for Computing Machinery), 28 (2): 202–208, doi:10.1145/2786.2793
- ^ Sleator, Daniel D.; Tarjan, Robert E. (1985), "Self-Adjusting Binary Search Trees" (PDF), Journal of the ACM (Association for Computing Machinery), 32 (3): 652–686, doi:10.1145/3828.3835
- ^ Karlin, Anna R.; Manasse, Mark S.; Rudolph, Larry; Sleator, Daniel D. (1988), "Competitive snoopy caching", Algorithmica, 3 (1): 79–119, doi:10.1007/BF01762111, MR 0925479