Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5218783> ?p ?o }
Showing triples 1 to 68 of
68
with 100 triples per page.
- Q5218783 subject Q5312304.
- Q5218783 subject Q6647483.
- Q5218783 subject Q7006242.
- Q5218783 subject Q7067047.
- Q5218783 subject Q7480595.
- Q5218783 subject Q9580543.
- Q5218783 abstract "Daniel Dominic Kaplan Sleator (born 10 December 1953 in St. Louis) 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. The Sleator and Tarjan paper on the move-to-front heuristic 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. Sleator also developed the theory of link grammars, and the Serioso music analyzer for analyzing meter and harmony in written music.".
- Q5218783 almaMater Q41506.
- Q5218783 almaMater Q457281.
- Q5218783 award Q1164390.
- Q5218783 doctoralAdvisor Q92638.
- Q5218783 field Q21198.
- Q5218783 residence Q1342.
- Q5218783 wikiPageExternalLink citation.cfm?id=1104092&srt=all&aw=147&ao=KANELLAK.
- Q5218783 wikiPageExternalLink www.chessclub.com.
- Q5218783 wikiPageExternalLink ~sleator.
- Q5218783 wikiPageExternalLink www.leftout.info.
- Q5218783 wikiPageWikiLink Q1164390.
- Q5218783 wikiPageWikiLink Q11748.
- Q5218783 wikiPageWikiLink Q127992.
- Q5218783 wikiPageWikiLink Q1342.
- Q5218783 wikiPageWikiLink Q1515266.
- Q5218783 wikiPageWikiLink Q1667952.
- Q5218783 wikiPageWikiLink Q175263.
- Q5218783 wikiPageWikiLink Q190080.
- Q5218783 wikiPageWikiLink Q21198.
- Q5218783 wikiPageWikiLink Q2803.
- Q5218783 wikiPageWikiLink Q331716.
- Q5218783 wikiPageWikiLink Q38022.
- Q5218783 wikiPageWikiLink Q391842.
- Q5218783 wikiPageWikiLink Q41506.
- Q5218783 wikiPageWikiLink Q457281.
- Q5218783 wikiPageWikiLink Q4893208.
- Q5218783 wikiPageWikiLink Q5156350.
- Q5218783 wikiPageWikiLink Q5312304.
- Q5218783 wikiPageWikiLink Q6554218.
- Q5218783 wikiPageWikiLink Q6554304.
- Q5218783 wikiPageWikiLink Q6647483.
- Q5218783 wikiPageWikiLink Q7006242.
- Q5218783 wikiPageWikiLink Q7067047.
- Q5218783 wikiPageWikiLink Q7345273.
- Q5218783 wikiPageWikiLink Q7480595.
- Q5218783 wikiPageWikiLink Q786431.
- Q5218783 wikiPageWikiLink Q7954933.
- Q5218783 wikiPageWikiLink Q80729.
- Q5218783 wikiPageWikiLink Q92638.
- Q5218783 wikiPageWikiLink Q9580543.
- Q5218783 almaMater Q41506.
- Q5218783 almaMater Q457281.
- Q5218783 awards "Paris Kanellakis Award".
- Q5218783 doctoralAdvisor Q92638.
- Q5218783 fields Q21198.
- Q5218783 name "Daniel Sleator".
- Q5218783 residence Q1342.
- Q5218783 type Person.
- Q5218783 type Agent.
- Q5218783 type Person.
- Q5218783 type Scientist.
- Q5218783 type Agent.
- Q5218783 type NaturalPerson.
- Q5218783 type Thing.
- Q5218783 type Q215627.
- Q5218783 type Q5.
- Q5218783 type Q901.
- Q5218783 type Person.
- Q5218783 comment "Daniel Dominic Kaplan Sleator (born 10 December 1953 in St. Louis) 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.".
- Q5218783 label "Daniel Sleator".
- Q5218783 name "Daniel Sleator".