Daniel Sleator
Daniel Dominic Kaplan Sleator (born December 10, 1953 in St. Louis ) is an American computer scientist. He is a professor at Carnegie-Mellon University .
Sleator received his bachelor's degree from the University of Illinois and his PhD under Robert Tarjan at Stanford University in 1981 ( An O (nm log n) algorithm for maximum network flow ). From 1981 to 1985 he was at Bell Laboratories before becoming a professor at Carnegie-Mellon.
He introduced link grammars to syntax theory. He developed the amortized runtime analysis of algorithms (amortized analysis) and the competitive analysis of online algorithms .
In 1999 he and Robert Tarjan received the Paris Kanellakis Prize for Splay Tree Data Structures. With Tarjan he also introduced other data structures (Link / Cut Trees 1982, Skew Heaps).
He was one of the volunteers who set up the Internet Chess Server (ICS) (as main programmer since 1992) and commercialized it in 1995 as the Internet Chess Club (ICC). Some of his ICS colleagues were against it and founded the Free Internet Chess Server (FICS) at that time.
He had a talk show on the Pittsburgh free radio station WRCT and is the brother of science fiction writer William Sleator .
Web links
Individual evidence
- ↑ Life data according to American Men and Women of Science Thomson Gale 2004
- ↑ Daniel Sleator in the Mathematics Genealogy Project (English)
| personal data | |
|---|---|
| SURNAME | Sleator, Daniel |
| ALTERNATIVE NAMES | Sleator, Daniel Dominic Kaplan (full name) |
| BRIEF DESCRIPTION | American computer scientist |
| DATE OF BIRTH | December 10, 1953 |
| PLACE OF BIRTH | St. Louis |