Daniel Sleator
Affiliations: | Carnegie Mellon University, Pittsburgh, PA |
Area:
Computer ScienceGoogle:
"Daniel Sleator"Children
Sign in to add trainee| Chengwen C. Wang | grad student | 2006 | Carnegie Mellon |
| Jonathan C. Derryberry | grad student | 2009 | Carnegie Mellon |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Wang CC, Derryberry J, Sleator DD. (2006) O(log log n)-competitive dynamic binary search trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 374-383 |
| Reingold N, Westbrook J, Sleator DD. (1994) Randomized competitive algorithms for the list update problem Algorithmica. 11: 15-32 |
| Fiat A, Karp RM, Luby M, et al. (1991) Competitive paging algorithms Journal of Algorithms. 12: 685-699 |
| McGeoch LA, Sleator DD. (1991) A strongly competitive randomized paging algorithm Algorithmica. 6: 816-825 |
| Manasse MS, McGeoch LA, Sleator DD. (1990) Competitive algorithms for server problems Journal of Algorithms. 11: 208-230 |
| Ginat D, Sleator DD, Tarjan RE. (1989) A tight amortized bound for path reversal Information Processing Letters. 31: 3-5 |
| Manasse MS, McGeoch LA, Sleator DD. (1988) Competitive algorithms for on-line problems Proceedings of the Annual Acm Symposium On Theory of Computing. 322-333 |
| Sleator DD, Tarjan RE, Thurston WP. (1988) Rotation distance, triangulations, and hyperbolic geometry Journal of the American Mathematical Society. 1: 647-681 |
| Dietz PF, Sleator DD. (1987) TWO ALGORITHMS FOR MAINTAINING ORDER IN A LIST Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 365-372 |
| Sleator DD, Tarjan RE. (1985) Self-Adjusting Binary Search Trees Journal of the Acm (Jacm). 32: 652-686 |