Daniel Dominic Sleator

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Optimal Offline Dynamic 2, 3-Edge/Vertex Connectivity.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

2017
Offline Dynamic Higher Connectivity.
CoRR, 2017

2016
O(log log n)-Competitive Binary Search Tree.
Encyclopedia of Algorithms, 2016

2009
Skip-Splay: Toward Achieving the Unified Bound in the BST Model.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

2006
O(log log n)-competitive dynamic binary search trees.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

1999
Modeling Meter and Harmony: A Preference-Rule Approach.
Computer Music Journal, 1999

1995
Parsing English with a Link Grammar
CoRR, 1995

A Robust Parsing Algorithm For Link Grammars
CoRR, 1995

1994
Fully Persistent Lists with Catenation.
J. ACM, 1994

Randomized Competitive Algorithms for the List Update Problem.
Algorithmica, 1994

1992
Short Encodings of Evolving Structures.
SIAM J. Discrete Math., 1992

Data Structures and Terminating Petri Nets.
Proceedings of the LATIN '92, 1992

Analysis of Online Algorithms for Organ Allocation.
Proceedings of the Algorithms, Software, Architecture, 1992

1991
Competitive Paging Algorithms.
J. Algorithms, 1991

A Strongly Competitive Randomized Paging Algorithm.
Algorithmica, 1991

Randomized Competitive Algorithms for the List Update Problem.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Competitive Algorithms for Server Problems.
J. Algorithms, 1990

1989
Making Data Structures Persistent.
J. Comput. Syst. Sci., 1989

A Tight Amortized Bound for Path Reversal.
Inf. Process. Lett., 1989

1988
Competitive Snoopy Caching.
Algorithmica, 1988

Competitive Algorithms for On-line Problems
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987
Two Algorithms for Maintaining Order in a List
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

1986
Self-Adjusting Heaps.
SIAM J. Comput., 1986

A Locally Adaptive Data Compression Scheme.
Commun. ACM, 1986

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

Rotation Distance, Triangulations, and Hyperbolic Geometry
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

1985
Self-Adjusting Binary Search Trees
J. ACM, July, 1985

Biased Search Trees.
SIAM J. Comput., 1985

Amortized Efficiency of List Update and Paging Rules.
Commun. ACM, 1985

1984
Amortized Efficiency of List Update Rules
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

1983
A Data Structure for Dynamic Trees.
J. Comput. Syst. Sci., 1983

Self-Adjusting Binary Trees
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

1980
A 2.5 Times Optimal Algorithm for Packing in Two Dimensions.
Inf. Process. Lett., 1980

Biased 2-3 Trees
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980


  Loading...