Daniel Sleator

Daniel Sleator

Daniel Dominic Kaplan Sleator is a professor of computer science at Carnegie Mellon University. He discovered amortized analysis and he invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps. He also pioneered the theory of link grammars and developed the technique of competitive analysis for online algorithms. Because of his contribution in computer science, he won the Paris Kanellakis Award in 1999.

Personal life

Sleator commercialized the volunteer-based Internet Chess Server into the Internet Chess Club despite outcry from fellow volunteers. The ICC 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.

External links

v · d · eParis Kanellakis Award laureates

Adleman / Diffie / Hellman / Merkle / Rivest / Shamir (1996)  · Lempel / Ziv (1997)  · Bryant / Clarke / Emerson / McMillan (1998)  · Sleator / Tarjan (1999)  · Karmarkar (2000)  · Myers (2001)  · Franaszek (2002)  · Miller / Rabin / Solovay / Strassen (2003)  · Freund / Schapire (2004)  · Holzmann / Kurshan / Vardi / Wolper (2005)  · Brayton (2006)  · Buchberger (2007)  · Cortes / Vapnik (2008)  · Bellare / Rogaway (2009)



Wikimedia Foundation. 2010.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Daniel Sleator — Saltar a navegación, búsqueda Daniel Dominic Kaplan Sleator es un profesor de informática en Carnegie Mellon University. Descubrió el análisis amortizado e inventó muchas estructuras de datos junto con Robert Tarjan, como por ejemplo los splay… …   Wikipedia Español

  • William Sleator — Infobox Writer imagesize = 150px name = William Sleator caption = pseudonym = birthdate = birth date and age|1945|02|13 birthplace = Havre de Grace, Maryland deathdate = deathplace = occupation = Novelist, young adult writer, children s writer… …   Wikipedia

  • Splay tree — A splay tree is a self balancing binary search tree with the additional property that recently accessed elements are quick to access again. It performs basic operations such as insertion, look up and removal in O(log(n)) amortized time. For many… …   Wikipedia

  • K-server problem — The k server problem is a problem of theoretical computer science in the category of online algorithms, one of two abstract problems on metric spaces that are central to the theory of competitive analysis (the other being metrical task systems).… …   Wikipedia

  • Tree rotation — A tree rotation is an operation on a binary search tree that changes the structure without interfering with the order of the elements. A tree rotation moves one node up in the tree and one node down. They are used to change the shape of the tree …   Wikipedia

  • Link Grammar Parser — The Link Grammar Parser or LinkParser is a parser for English which analyzes sentences using the Link Grammar framework.It was written by Davy Temperley, Daniel Sleator, and John Lafferty of Carnegie Mellon University. Examples * Find the verb in …   Wikipedia

  • Internet Chess Club — The Internet Chess Club (ICC) is a commercial Internet chess server devoted to the play and discussion of chess and chess variants. ICC currently has over 30,000 subscribing members.[1] It was the first Internet chess server and is the first and… …   Wikipedia

  • Sprouts — Le Sprouts (germe en anglais) est un jeu à deux joueurs du type morpion, inventé en 1967 à l Université de Cambridge par les mathématiciens John Horton Conway et Michael Paterson. Sommaire 1 Règles du jeu 1.1 Principe 1.2 But du jeu …   Wikipédia en Français

  • Árbol biselado — Un Árbol biselado o Árbol Splay es un Árbol binario de búsqueda auto balanceable, con la propiedad adicional de que a los elementos accedidos recientemente se accederá más rápidamente en accesos posteriores. Realiza operaciones básicas como… …   Wikipedia Español

  • Link grammar — (LG) is a theory of syntax by Davy Temperley and Daniel Sleator which builds relations between pairs of words, rather than constructing constituents in a tree like hierarchy. There are two basic parameters: directionality and distance. Dependency …   Wikipedia

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”