Daniel Dominic Sleator

According to our database, Daniel Dominic Sleator authored at least 34 papers between 1980 and 2019.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2019

Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity.

Richard Peng, Bryce Sandlund, Daniel Dominic Sleator

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2017

Offline Dynamic Higher Connectivity.

Richard Peng, Bryce Sandlund, Daniel Dominic Sleator

CoRR, 2017

2016

O(log log n)-Competitive Binary Search Tree.

Chengwen Chris Wang, Daniel Dominic Sleator

Encyclopedia of Algorithms, 2016

2009

Skip-Splay: Toward Achieving the Unified Bound in the BST Model.

Jonathan Derryberry, Daniel Dominic Sleator

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2006

<i>O</i>(log log <i>n</i>)-competitive dynamic binary search trees.

Chengwen Chris Wang, Jonathan Derryberry, Daniel Dominic Sleator

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

1999

Modeling Meter and Harmony: A Preference-Rule Approach.

David Temperley, Daniel Dominic Sleator

Comput. Music. J., 1999

1995

Parsing English with a Link Grammar

Daniel Dominic Sleator, David Temperley

CoRR, 1995

A Robust Parsing Algorithm for Link Grammars.

Dennis Grinberg, John Lafferty, Daniel Dominic Sleator

Proceedings of the Fourth International Workshop on Parsing Technologies, 1995

1994

Fully Persistent Lists with Catenation.

James R. Driscoll, Daniel Dominic Sleator, Robert Endre Tarjan

J. ACM, 1994

Randomized Competitive Algorithms for the List Update Problem.

Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator

Algorithmica, 1994

1992

Short Encodings of Evolving Structures.

Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston

SIAM J. Discret. Math., 1992

Data Structures and Terminating Petri Nets.

Daniel Dominic Sleator

Proceedings of the LATIN '92, 1992

Analysis of Online Algorithms for Organ Allocation.

Shmuel Ur, Michael A. Trick, Daniel Dominic Sleator

Proceedings of the Algorithms, Software, Architecture, 1992

1991

Competitive Paging Algorithms.

Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel Dominic Sleator, Neal E. Young

J. Algorithms, 1991

A Strongly Competitive Randomized Paging Algorithm.

Lyle A. McGeoch, Daniel Dominic Sleator

Algorithmica, 1991

Randomized Competitive Algorithms for the List Update Problem.

Sandy Irani, Nick Reingold, Jeffery R. Westbrook, Daniel Dominic Sleator

Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990

Competitive Algorithms for Server Problems.

Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator

J. Algorithms, 1990

1989

Making Data Structures Persistent.

James R. Driscoll, Neil Sarnak, Daniel Dominic Sleator, Robert Endre Tarjan

J. Comput. Syst. Sci., 1989

A Tight Amortized Bound for Path Reversal.

David Ginat, Daniel Dominic Sleator, Robert Endre Tarjan

Inf. Process. Lett., 1989

1988

Competitive Snoopy Caching.

Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator

Algorithmica, 1988

Competitive Algorithms for On-line Problems

Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

Two Algorithms for Maintaining Order in a List

Paul F. Dietz, Daniel Dominic Sleator

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986

Self-Adjusting Heaps.

Daniel Dominic Sleator, Robert Endre Tarjan

SIAM J. Comput., 1986

A Locally Adaptive Data Compression Scheme.

Jon Louis Bentley, Daniel Dominic Sleator, Robert Endre Tarjan, Victor K. Wei

Commun. ACM, 1986

The Pairing Heap: A New Form of Self-Adjusting Heap.

Michael L. Fredman, Robert Sedgewick, Daniel Dominic Sleator, Robert Endre Tarjan

Algorithmica, 1986

Rotation Distance, Triangulations, and Hyperbolic Geometry

Daniel Dominic Sleator, Robert Endre Tarjan, William P. Thurston

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985

Self-Adjusting Binary Search Trees

Daniel Dominic Sleator, Robert Endre Tarjan

J. ACM, July, 1985

Biased Search Trees.

Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan

SIAM J. Comput., 1985

Amortized Efficiency of List Update and Paging Rules.

Daniel Dominic Sleator, Robert Endre Tarjan

Commun. ACM, 1985

1984

Amortized Efficiency of List Update Rules

Daniel Dominic Sleator, Robert Endre Tarjan

Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983

A Data Structure for Dynamic Trees.

Daniel Dominic Sleator, Robert Endre Tarjan

J. Comput. Syst. Sci., 1983

Self-Adjusting Binary Trees

Daniel Dominic Sleator, Robert Endre Tarjan

Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1980

A 2.5 Times Optimal Algorithm for Packing in Two Dimensions.

Daniel Dominic Sleator

Inf. Process. Lett., 1980

Biased 2-3 Trees

Samuel W. Bent, Daniel Dominic Sleator, Robert Endre Tarjan

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980