About: Daniel Sleator     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Whole100003553, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon
http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDaniel_Sleator&invfp=IFP_OFF&sas=SAME_AS_OFF

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. He was one of the pioneers in amortized analysis of algorithms, early examples of which were the analyses of the move-to-front heuristic, and splay trees. He invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps.

AttributesValues
rdf:type
rdfs:label
  • Daniel Sleator (en)
  • Daniel Sleator (de)
  • Daniel Sleator (es)
  • Деніел Слітор (uk)
rdfs:comment
  • Daniel Dominic Kaplan Sleator es un profesor de informática en Carnegie Mellon University. Descubrió el e inventó muchas estructuras de datos junto con Robert Tarjan, como por ejemplo los splay trees, y la . También fue pionero de la , y desarrolló la técnica del para . Por su contribución a las ciencias de la computación, le fue concedido el en 1999. Sleator fundó y ayuda a administrar el , uno de los servidores comerciales de ajedrez más populares en Internet. Es hermano de , escritor de ciencia ficción para jóvenes. (es)
  • Даніел Домінік Каплан Слітор нар. 10 грудня 1953, Сент-Луїс) — американський науковейь, професоро комп'ютерних наук в Університеті Карнегі-Меллон у Піттсбурзі, США. (uk)
  • Daniel Dominic Kaplan Sleator (* 10. Dezember 1953 in St. Louis) ist ein US-amerikanischer Informatiker. Er ist Professor an der Carnegie-Mellon University. Sleator erhielt seinen Bachelor-Abschluss an der University of Illinois und wurde 1981 bei Robert Tarjan an der Stanford University promoviert (An O(nm log n) algorithm for maximum network flow). 1981 bis 1985 war er an den Bell Laboratories, bevor er Professor an der Carnegie-Mellon wurde. Er hatte eine Talkshow auf dem freien Radiosender WRCT in Pittsburgh und ist der Bruder des Science-Fiction-Autors William Sleator. (de)
  • 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. He was one of the pioneers in amortized analysis of algorithms, early examples of which were the analyses of the move-to-front heuristic, and splay trees. He invented many data structures with Robert Tarjan, such as splay trees, link/cut trees, and skew heaps. (en)
foaf:name
  • Daniel Sleator (en)
name
  • Daniel Sleator (en)
birth place
birth place
birth date
dcterms:subject
Wikipage page ID
Wikipage revision ID
Link from a Wikipage to another Wikipage
Link from a Wikipage to an external page
Faceted Search & Find service v1.17_git139 as of Feb 29 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software