Daniel Dominic Sleator

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Wythoff's Nim with Finite Alterations
(available as arXiv preprint)
2024-01-01Paper
<i>O</i>(log log <i>n</i>)-competitive dynamic binary search trees
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06
2010-08-16Paper
Skip-Splay: Toward Achieving the Unified Bound in the BST Model
Lecture Notes in Computer Science
2009-10-20Paper
Competitive paging algorithms
Journal of Algorithms
1992-06-28Paper
The pairing heap: A new form of self-adjusting heap
Algorithmica
1986-01-01Paper
Self-Adjusting Heaps
SIAM Journal on Computing
1986-01-01Paper
Self-adjusting binary search trees
Journal of the ACM
1985-01-01Paper
A 2.5 times optimal algorithm for packing in two dimensions
Information Processing Letters
1980-01-01Paper


Research outcomes over time


This page was built for person: Daniel Dominic Sleator