default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Dominic Sleator
Person information
- affiliation: Carnegie Mellon University, Department of Computer Science
- award (1999): Paris Kanellakis Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[c17]Richard Peng, Bryce Sandlund, Daniel Dominic Sleator:
Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. WADS 2019: 553-565- 2017
- [i4]Richard Peng, Bryce Sandlund, Daniel Dominic Sleator:
Offline Dynamic Higher Connectivity. CoRR abs/1708.03812 (2017) - 2016
- [r1]Chengwen Chris Wang, Daniel Dominic Sleator:
O(log log n)-Competitive Binary Search Tree. Encyclopedia of Algorithms 2016: 1423-1426
2000 – 2009
- 2009
- [c16]Jonathan Derryberry, Daniel Dominic Sleator:
Skip-Splay: Toward Achieving the Unified Bound in the BST Model. WADS 2009: 194-205 - 2006
- [c15]Chengwen Chris Wang, Jonathan Derryberry, Daniel Dominic Sleator:
O(log log n)-competitive dynamic binary search trees. SODA 2006: 374-383 - 2002
- [i3]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young:
Competitive Paging Algorithms. CoRR cs.DS/0205038 (2002)
1990 – 1999
- 1999
- [j18]David Temperley, Daniel Dominic Sleator:
Modeling Meter and Harmony: A Preference-Rule Approach. Comput. Music. J. 23(1): 10-27 (1999) - 1995
- [c14]Dennis Grinberg, John Lafferty, Daniel Dominic Sleator:
A Robust Parsing Algorithm for Link Grammars. IWPT 1995: 111-125 - [i2]Dennis Grinberg, John D. Lafferty, Daniel Dominic Sleator:
A Robust Parsing Algorithm For Link Grammars. CoRR abs/cmp-lg/9508003 (1995) - [i1]Daniel Dominic Sleator, David Temperley:
Parsing English with a Link Grammar. CoRR abs/cmp-lg/9508004 (1995) - 1994
- [j17]Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem. Algorithmica 11(1): 15-32 (1994) - [j16]James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan:
Fully Persistent Lists with Catenation. J. ACM 41(5): 943-959 (1994) - [e2]Daniel Dominic Sleator:
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA. ACM/SIAM 1994, ISBN 0-89871-329-3 [contents] - 1992
- [j15]Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston:
Short Encodings of Evolving Structures. SIAM J. Discret. Math. 5(3): 428-450 (1992) - [c13]Shmuel Ur, Michael A. Trick, Daniel Dominic Sleator:
Analysis of Online Algorithms for Organ Allocation. IFIP Congress (1) 1992: 458-464 - [c12]Daniel Dominic Sleator:
Data Structures and Terminating Petri Nets. LATIN 1992: 488-497 - [e1]Lyle A. McGeoch, Daniel Dominic Sleator:
On-Line Algorithms, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, February 11-13, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 7, DIMACS/AMS 1992, ISBN 978-0-8218-6596-5 [contents] - 1991
- [j14]Lyle A. McGeoch, Daniel Dominic Sleator:
A Strongly Competitive Randomized Paging Algorithm. Algorithmica 6(6): 816-825 (1991) - [j13]Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
:
Competitive Paging Algorithms. J. Algorithms 12(4): 685-699 (1991) - [c11]James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan:
Fully Persistent Lists with Catenation. SODA 1991: 89-99 - [c10]Sandy Irani, Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator:
Randomized Competitive Algorithms for the List Update Problem. SODA 1991: 251-260 - 1990
- [j12]Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for Server Problems. J. Algorithms 11(2): 208-230 (1990)
1980 – 1989
- 1989
- [j11]David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan:
A Tight Amortized Bound for Path Reversal. Inf. Process. Lett. 31(1): 3-5 (1989) - [j10]James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan:
Making Data Structures Persistent. J. Comput. Syst. Sci. 38(1): 86-124 (1989) - 1988
- [j9]Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator:
Competitive Snoopy Caching. Algorithmica 3: 77-119 (1988) - [c9]Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for On-line Problems. STOC 1988: 322-333 - 1987
- [c8]Paul F. Dietz, Daniel Dominic Sleator:
Two Algorithms for Maintaining Order in a List. STOC 1987: 365-372 - 1986
- [j8]Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan:
The Pairing Heap: A New Form of Self-Adjusting Heap. Algorithmica 1(1): 111-129 (1986) - [j7]Jon Louis Bentley, Daniel Dominic Sleator, Robert Endre Tarjan, Victor K. Wei:
A Locally Adaptive Data Compression Scheme. Commun. ACM 29(4): 320-330 (1986) - [j6]Daniel Dominic Sleator, Robert Endre Tarjan:
Self-Adjusting Heaps. SIAM J. Comput. 15(1): 52-69 (1986) - [c7]Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator:
Competitive Snoopy Caching. FOCS 1986: 244-254 - [c6]James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan:
Making Data Structures Persistent. STOC 1986: 109-121 - [c5]Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston:
Rotation Distance, Triangulations, and Hyperbolic Geometry. STOC 1986: 122-135 - 1985
- [j5]Daniel Dominic Sleator, Robert Endre Tarjan:
Amortized Efficiency of List Update and Paging Rules. Commun. ACM 28(2): 202-208 (1985) - [j4]Daniel Dominic Sleator, Robert Endre Tarjan:
Self-Adjusting Binary Search Trees. J. ACM 32(3): 652-686 (1985) - [j3]Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan:
Biased Search Trees. SIAM J. Comput. 14(3): 545-568 (1985) - 1984
- [c4]Daniel Dominic Sleator, Robert Endre Tarjan:
Amortized Efficiency of List Update Rules. STOC 1984: 488-492 - 1983
- [j2]Daniel Dominic Sleator, Robert Endre Tarjan:
A Data Structure for Dynamic Trees. J. Comput. Syst. Sci. 26(3): 362-391 (1983) - [c3]Daniel Dominic Sleator, Robert Endre Tarjan:
Self-Adjusting Binary Trees. STOC 1983: 235-245 - 1981
- [c2]Daniel Dominic Sleator, Robert Endre Tarjan:
A Data Structure for Dynamic Trees. STOC 1981: 114-122 - 1980
- [j1]Daniel Dominic Sleator:
A 2.5 Times Optimal Algorithm for Packing in Two Dimensions. Inf. Process. Lett. 10(1): 37-40 (1980) - [c1]Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan:
Biased 2-3 Trees. FOCS 1980: 248-254
Coauthor Index
aka: Robert Endre Tarjan
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-05-14 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
