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 was founded in 1981 with Robert Tarjan at Stanford University PhD (An O ( nm log n ) algorithm for maximum network flow). 1981 to 1985 he was at Bell Laboratories before he became a professor at Carnegie-Mellon.

He led link grammars (Link Grammar ) in the syntax of a theory. He developed the maturity Amortized Analysis of Algorithms ( Amortized Analysis) and the competitive analysis of online algorithms.

In 1999 he was awarded with Robert Tarjan the Paris Kanellakis Award for splay tree data structures. With Tarjan he also led other data structures (Link / Cut Trees 1982, Skew Heaps ).

He was one of the volunteers who built the Internet Chess Server (ICS ) (as main programmer from 1992) and commercialized it in 1995 to the Internet Chess Club (ICC). Some of his ICS colleagues were against it, and then founded the Free Internet Chess Server ( FICS ).

He had a talk show on the free radio station WRCT in Pittsburgh and is the brother of science-fiction author William Sleator.