Daniel Dominic Sleator

2006
34	EE	Chengwen Chris Wang, Jonathan Derryberry, Daniel Dominic Sleator: O(log log n)-competitive dynamic binary search trees. SODA 2006: 374-383
2002
33	EE	Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young: Competitive Paging Algorithms CoRR cs.DS/0205038: (2002)
1995
32	EE	Dennis Grinberg, John D. Lafferty, Daniel Dominic Sleator: A Robust Parsing Algorithm For Link Grammars CoRR abs/cmp-lg/9508003: (1995)
31	EE	Daniel Dominic Sleator, David Temperley: Parsing English with a Link Grammar CoRR abs/cmp-lg/9508004: (1995)
1994
30		Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator: Randomized Competitive Algorithms for the List Update Problem. Algorithmica 11(1): 15-32 (1994)
29	EE	James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan: Fully Persistent Lists with Catenation. J. ACM 41(5): 943-959 (1994)
1992
28		Shmuel Ur, Michael A. Trick, Daniel Dominic Sleator: Analysis of Online Algorithms for Organ Allocation. IFIP Congress (1) 1992: 458-464
27		Daniel Dominic Sleator: Data Structures and Terminating Petri Nets. LATIN 1992: 488-497
26		Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston: Short Encodings of Evolving Structures. SIAM J. Discrete Math. 5(3): 428-450 (1992)
1991
25		Sandy Irani, Nick Reingold, Jeffery Westbrook, Daniel Dominic Sleator: Randomized Competitive Algorithms for the List Update Problem. SODA 1991: 251-260
24		James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan: Fully Persistent Lists with Catenation. SODA 1991: 89-99
23		Lyle A. McGeoch, Daniel Dominic Sleator: A Strongly Competitive Randomized Paging Algorithm. Algorithmica 6(6): 816-825 (1991)
22		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)
1990
21		Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator: Competitive Algorithms for Server Problems. J. Algorithms 11(2): 208-230 (1990)
1989
20		David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan: A Tight Amortized Bound for Path Reversal. Inf. Process. Lett. 31(1): 3-5 (1989)
19		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
18		Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator: Competitive Algorithms for On-line Problems STOC 1988: 322-333
17		Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator: Competitive Snoopy Caching. Algorithmica 3: 77-119 (1988)
1987
16		Paul F. Dietz, Daniel Dominic Sleator: Two Algorithms for Maintaining Order in a List STOC 1987: 365-372
1986
15		Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator: Competitive Snoopy Caching FOCS 1986: 244-254
14		James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan: Making Data Structures Persistent STOC 1986: 109-121
13		Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston: Rotation Distance, Triangulations, and Hyperbolic Geometry STOC 1986: 122-135
12		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)
11		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)
10		Daniel Dominic Sleator, Robert Endre Tarjan: Self-Adjusting Heaps. SIAM J. Comput. 15(1): 52-69 (1986)
1985
9		Daniel Dominic Sleator, Robert Endre Tarjan: Amortized Efficiency of List Update and Paging Rules. Commun. ACM 28(2): 202-208 (1985)
8	EE	Daniel Dominic Sleator, Robert Endre Tarjan: Self-Adjusting Binary Search Trees J. ACM 32(3): 652-686 (1985)
7		Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan: Biased Search Trees. SIAM J. Comput. 14(3): 545-568 (1985)
1984
6		Daniel Dominic Sleator, Robert Endre Tarjan: Amortized Efficiency of List Update Rules STOC 1984: 488-492
1983
5		Daniel Dominic Sleator, Robert Endre Tarjan: Self-Adjusting Binary Trees STOC 1983: 235-245
4		Daniel Dominic Sleator, Robert Endre Tarjan: A Data Structure for Dynamic Trees. J. Comput. Syst. Sci. 26(3): 362-391 (1983)
1981
3		Daniel Dominic Sleator, Robert Endre Tarjan: A Data Structure for Dynamic Trees STOC 1981: 114-122
1980
2		Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan: Biased 2-3 Trees FOCS 1980: 248-254
1		Daniel Dominic Sleator: A 2.5 Times Optimal Algorithm for Packing in Two Dimensions. Inf. Process. Lett. 10(1): 37-40 (1980)

Coauthor Index

1	Samuel W. Bent	[2] [7]
2	Jon Louis Bentley	[11]
3	Jonathan Derryberry	[34]
4	Paul F. Dietz	[16]
5	James R. Driscoll	[14] [19] [24] [29]
6	Amos Fiat	[22] [33]
7	Michael L. Fredman	[12]
8	David Ginat	[20]
9	Dennis Grinberg	[32]
10	Sandy Irani	[25]
11	Anna R. Karlin	[15] [17]
12	Richard M. Karp	[22] [33]
13	John D. Lafferty	[32]
14	Michael Luby	[22] [33]
15	Mark S. Manasse (Mark Manasse)	[15] [17] [18] [21]
16	Lyle A. McGeoch	[18] [21] [22] [23] [33]
17	Nick Reingold	[25] [30]
18	Larry Rudolph	[15] [17]
19	Neil Sarnak	[14] [19]
20	Robert Sedgewick	[12]
21	Robert Endre Tarjan	[2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14] [19] [20] [24] [26] [29]
22	David Temperley	[31]
23	William P. Thurston	[13] [26]
24	Michael A. Trick	[28]
25	Shmuel Ur	[28]
26	Chengwen Chris Wang	[34]
27	Victor K.-W. Wei (Victor K. Wei, Victor Keh-Wei Wei)	[11]
28	Jeffery Westbrook	[25] [30]
29	Neal E. Young	[22] [33]

Colors in the list of coauthors