|
Daniel Sleator
Daniel Dominic Kaplan Sleator (born 10 December 1953) 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 was born to William Warner Sleator, Jr., a professor of physiology and biophysics, and Esther Kaplan Sleator, a pediatrician who did pioneering research on attention deficit disorder (ADD).[6] He is the younger brother of William Sleator, who wrote science fiction for young adults. 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. 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 of the competitive programming platform Codeforces.[7] References
External links |
||||||||||||||||||
Portal di Ensiklopedia Dunia
