Daniel Dominic Sleator

41 papers A* 12B 3Journal 22Unranked 2

Year	Rank	Type	Title / Venue / Authors
2019	B	`conf`	Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity. WADS Richard Peng, Bryce Sandlund, Daniel Dominic Sleator
2017	J	`jnl`	Offline Dynamic Higher Connectivity. CoRR Richard Peng, Bryce Sandlund, Daniel Dominic Sleator
2016	—	`ch.`	O(log log n)-Competitive Binary Search Tree. Encyclopedia of Algorithms Chengwen Chris Wang, Daniel Dominic Sleator
2009	B	`conf`	Skip-Splay: Toward Achieving the Unified Bound in the BST Model. WADS Jonathan Derryberry, Daniel Dominic Sleator
2002	J	`jnl`	Competitive Paging Algorithms CoRR Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
1999	J	`jnl`	Modeling Meter and Harmony: A Preference-Rule Approach. Comput. Music. J. David Temperley, Daniel Dominic Sleator
1995	J	`jnl`	A Robust Parsing Algorithm For Link Grammars CoRR Dennis Grinberg, John D. Lafferty, Daniel Dominic Sleator
1995	—	`conf`	A Robust Parsing Algorithm for Link Grammars. IWPT Dennis Grinberg, John Lafferty, Daniel Dominic Sleator
1995	J	`jnl`	Parsing English with a Link Grammar CoRR Daniel Dominic Sleator, David Temperley
1994	J	`jnl`	Fully Persistent Lists with Catenation. J. ACM James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan
1994	A*	`ed.`	Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, Arlington, Virginia, USA. SODA Daniel Dominic Sleator
1994	J	`jnl`	Randomized Competitive Algorithms for the List Update Problem. Algorithmica Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator
1992	—	`conf`	Analysis of Online Algorithms for Organ Allocation. IFIP Congress (1) Shmuel Ur, Michael A. Trick, Daniel Dominic Sleator
1992	B	`conf`	Data Structures and Terminating Petri Nets. LATIN Daniel Dominic Sleator
1992	—	`ed.`	On-Line Algorithms, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, February 11-13, 1991 On-Line Algorithms Lyle A. McGeoch, Daniel Dominic Sleator
1992	J	`jnl`	Short Encodings of Evolving Structures. SIAM J. Discret. Math. Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston
1991	J	`jnl`	A Strongly Competitive Randomized Paging Algorithm. Algorithmica Lyle A. McGeoch, Daniel Dominic Sleator
1991	J	`jnl`	Competitive Paging Algorithms. J. Algorithms Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young
1991	A*	`conf`	Fully Persistent Lists with Catenation. SODA James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan
1991	A*	`conf`	Randomized Competitive Algorithms for the List Update Problem. SODA Sandy Irani, Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator
1990	J	`jnl`	Competitive Algorithms for Server Problems. J. Algorithms Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator
1989	J	`jnl`	A Tight Amortized Bound for Path Reversal. Inf. Process. Lett. David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan
1989	J	`jnl`	Making Data Structures Persistent. J. Comput. Syst. Sci. James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan
1988	A*	`conf`	Competitive Algorithms for On-line Problems STOC Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator
1988	J	`jnl`	Competitive Snoopy Caching. Algorithmica Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator
1987	A*	`conf`	Two Algorithms for Maintaining Order in a List STOC Paul F. Dietz, Daniel Dominic Sleator
1986	J	`jnl`	A Locally Adaptive Data Compression Scheme. Commun. ACM Jon Louis Bentley, Daniel Dominic Sleator, Robert Endre Tarjan, Victor K. Wei
1986	A*	`conf`	Competitive Snoopy Caching FOCS Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator
1986	A*	`conf`	Making Data Structures Persistent STOC James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan
1986	A*	`conf`	Rotation Distance, Triangulations, and Hyperbolic Geometry STOC Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston
1986	J	`jnl`	Self-Adjusting Heaps. SIAM J. Comput. Daniel Dominic Sleator, Robert Endre Tarjan
1986	J	`jnl`	The Pairing Heap: A New Form of Self-Adjusting Heap. Algorithmica Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan
1985	J	`jnl`	Amortized Efficiency of List Update and Paging Rules. Commun. ACM Daniel Dominic Sleator, Robert Endre Tarjan
1985	J	`jnl`	Biased Search Trees. SIAM J. Comput. Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan
1985	J	`jnl`	Self-Adjusting Binary Search Trees J. ACM Daniel Dominic Sleator, Robert Endre Tarjan
1984	A*	`conf`	Amortized Efficiency of List Update Rules STOC Daniel Dominic Sleator, Robert Endre Tarjan
1983	J	`jnl`	A Data Structure for Dynamic Trees. J. Comput. Syst. Sci. Daniel Dominic Sleator, Robert Endre Tarjan
1983	A*	`conf`	Self-Adjusting Binary Trees STOC Daniel Dominic Sleator, Robert Endre Tarjan
1981	A*	`conf`	A Data Structure for Dynamic Trees STOC Daniel Dominic Sleator, Robert Endre Tarjan
1980	J	`jnl`	A 2.5 Times Optimal Algorithm for Packing in Two Dimensions. Inf. Process. Lett. Daniel Dominic Sleator
1980	A*	`conf`	Biased 2-3 Trees FOCS Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan