| 词条 | Daniel Sleator |
| 释义 |
|name = Daniel Sleator |image = |image_size = |caption = |birth_date = {{b-da|10 December 1953}} |birth_place = |death_date = |death_place = |residence = Pittsburgh |citizenship = |nationality = |ethnicity = |fields = Computer Science |workplaces = Carnegie Mellon University |alma_mater = University of Illinois at Urbana–Champaign, Stanford University |doctoral_advisor = Robert Tarjan |academic_advisors = |doctoral_students = |notable_students = |thesis_url = |thesis_title = |thesis_year = |known_for = |author_abbrev_bot = |author_abbrev_zoo = |influences = |influenced = |awards = Paris Kanellakis Award {{small|(1999)}} |religion = |signature = |footnotes = }}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 lifeSleator 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. From 2003 to 2008, Sleator co-hosted the progressive talk show Left Out on WRCT-FM with Carnegie Mellon University School of Computer Science faculty member Bob Harper. He is also an active member on the competitive programming platform, Codeforces under the handle "Darooha". References1. ^American Men and Women of Science, Thomson Gale, 2004 2. ^Citation for Sleator and Tarjan Kanellakis Award {{webarchive|url=https://web.archive.org/web/20120211141406/http://www.acm.org/announcements/pk_award_1999.html |date=2012-02-11}} 3. ^1 {{Citation |first1=Daniel D. |last1=Sleator |first2=Robert E. |last2=Tarjan |title=Amortized efficiency of list update and paging rules |url=http://www.cs.cmu.edu/~sleator/papers/amortized-efficiency.pdf |journal=Communications of the ACM |volume=28 |issue=2 |pages=202–208 |year=1985 |doi=10.1145/2786.2793|citeseerx=10.1.1.367.6317 }} 4. ^{{Citation |first1=Daniel D. |last1=Sleator |first2=Robert E. |last2=Tarjan |title=Self-Adjusting Binary Search Trees |url=http://www.cs.cmu.edu/~sleator/papers/self-adjusting.pdf |journal=Journal of the ACM |volume=32 |issue=3 |pages=652–686 |year= 1985 |doi=10.1145/3828.3835}} 5. ^{{citation |last1=Karlin |first1=Anna R. |last2=Manasse |first2=Mark S. |last3=Rudolph |first3=Larry |last4=Sleator |first4=Daniel D. |doi=10.1007/BF01762111 |issue=1 |journal=Algorithmica |mr=925479 |pages=79–119 |title=Competitive snoopy caching |volume=3 |year=1988}} External links
6 : American computer scientists|Carnegie Mellon University faculty|Living people|1953 births|Theoretical computer scientists|Stanford University alumni |
| 随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。