Daniel Dominic Sleator

Jonathan Derryberry, Daniel Dominic Sleator: Skip-Splay: Toward Achieving the Unified Bound in the BST Model. WADS 2009: 194-205

Chengwen Chris Wang, Jonathan Derryberry, Daniel Dominic Sleator: O(log log n)-competitive dynamic binary search trees. SODA 2006: 374-383

Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young: Competitive Paging Algorithms. CoRR cs.DS/0205038 (2002)

Dennis Grinberg, John D. Lafferty, Daniel Dominic Sleator: A Robust Parsing Algorithm For Link Grammars. CoRR abs/cmp-lg/9508003 (1995)

Daniel Dominic Sleator, David Temperley: Parsing English with a Link Grammar. CoRR abs/cmp-lg/9508004 (1995)

Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator: Randomized Competitive Algorithms for the List Update Problem. Algorithmica 11(1): 15-32 (1994)

James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan: Fully Persistent Lists with Catenation. J. ACM 41(5): 943-959 (1994)

Daniel Dominic Sleator (Ed.): Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia. ACM/SIAM 1994, isbn 0-89871-329-3

Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston: Short Encodings of Evolving Structures. SIAM J. Discrete Math. 5(3): 428-450 (1992)

Shmuel Ur, Michael A. Trick, Daniel Dominic Sleator: Analysis of Online Algorithms for Organ Allocation. IFIP Congress (1) 1992: 458-464

Daniel Dominic Sleator: Data Structures and Terminating Petri Nets. LATIN 1992: 488-497

Lyle A. McGeoch, Daniel Dominic Sleator: A Strongly Competitive Randomized Paging Algorithm. Algorithmica 6(6): 816-825 (1991)

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)

James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan: Fully Persistent Lists with Catenation. SODA 1991: 89-99

Sandy Irani, Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator: Randomized Competitive Algorithms for the List Update Problem. SODA 1991: 251-260

Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator: Competitive Algorithms for Server Problems. J. Algorithms 11(2): 208-230 (1990)

David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan: A Tight Amortized Bound for Path Reversal. Inf. Process. Lett. 31(1): 3-5 (1989)

James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan: Making Data Structures Persistent. J. Comput. Syst. Sci. 38(1): 86-124 (1989)

Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator: Competitive Snoopy Caching. Algorithmica 3: 77-119 (1988)

Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator: Competitive Algorithms for On-line Problems. STOC 1988: 322-333

Paul F. Dietz, Daniel Dominic Sleator: Two Algorithms for Maintaining Order in a List. STOC 1987: 365-372

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)

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)

Daniel Dominic Sleator, Robert Endre Tarjan: Self-Adjusting Heaps. SIAM J. Comput. 15(1): 52-69 (1986)

Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator: Competitive Snoopy Caching. FOCS 1986: 244-254

James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan: Making Data Structures Persistent. STOC 1986: 109-121

Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston: Rotation Distance, Triangulations, and Hyperbolic Geometry. STOC 1986: 122-135

Daniel Dominic Sleator, Robert Endre Tarjan: Amortized Efficiency of List Update and Paging Rules. Commun. ACM 28(2): 202-208 (1985)

Daniel Dominic Sleator, Robert Endre Tarjan: Self-Adjusting Binary Search Trees. J. ACM 32(3): 652-686 (1985)

Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan: Biased Search Trees. SIAM J. Comput. 14(3): 545-568 (1985)

Daniel Dominic Sleator, Robert Endre Tarjan: Amortized Efficiency of List Update Rules. STOC 1984: 488-492

Daniel Dominic Sleator, Robert Endre Tarjan: A Data Structure for Dynamic Trees. J. Comput. Syst. Sci. 26(3): 362-391 (1983)

Daniel Dominic Sleator, Robert Endre Tarjan: Self-Adjusting Binary Trees. STOC 1983: 235-245

Daniel Dominic Sleator, Robert Endre Tarjan: A Data Structure for Dynamic Trees. STOC 1981: 114-122

Daniel Dominic Sleator: A 2.5 Times Optimal Algorithm for Packing in Two Dimensions. Inf. Process. Lett. 10(1): 37-40 (1980)

Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan: Biased 2-3 Trees. FOCS 1980: 248-254