Year |
Citation |
Score |
2006 |
Wang CC, Derryberry J, Sleator DD. O(log log n)-competitive dynamic binary search trees Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 374-383. |
0.608 |
|
1994 |
Reingold N, Westbrook J, Sleator DD. Randomized competitive algorithms for the list update problem Algorithmica. 11: 15-32. DOI: 10.1007/BF01294261 |
0.644 |
|
1991 |
Fiat A, Karp RM, Luby M, McGeoch LA, Sleator DD, Young NE. Competitive paging algorithms Journal of Algorithms. 12: 685-699. DOI: 10.1016/0196-6774(91)90041-V |
0.577 |
|
1991 |
McGeoch LA, Sleator DD. A strongly competitive randomized paging algorithm Algorithmica. 6: 816-825. DOI: 10.1007/BF01759073 |
0.601 |
|
1990 |
Manasse MS, McGeoch LA, Sleator DD. Competitive algorithms for server problems Journal of Algorithms. 11: 208-230. DOI: 10.1016/0196-6774(90)90003-W |
0.505 |
|
1989 |
Ginat D, Sleator DD, Tarjan RE. A tight amortized bound for path reversal Information Processing Letters. 31: 3-5. DOI: 10.1016/0020-0190(89)90101-4 |
0.584 |
|
1988 |
Manasse MS, McGeoch LA, Sleator DD. Competitive algorithms for on-line problems Proceedings of the Annual Acm Symposium On Theory of Computing. 322-333. DOI: 10.1145/62212.62243 |
0.518 |
|
1988 |
Sleator DD, Tarjan RE, Thurston WP. Rotation distance, triangulations, and hyperbolic geometry Journal of the American Mathematical Society. 1: 647-681. DOI: 10.1090/S0894-0347-1988-0928904-4 |
0.322 |
|
1987 |
Dietz PF, Sleator DD. TWO ALGORITHMS FOR MAINTAINING ORDER IN A LIST Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 365-372. |
0.671 |
|
1985 |
Sleator DD, Tarjan RE. Self-Adjusting Binary Search Trees Journal of the Acm (Jacm). 32: 652-686. DOI: 10.1145/3828.3835 |
0.438 |
|
1985 |
Sleator DD, Tarjan RE. Amortized efficiency of list update and paging rules Communications of the Acm. 28: 202-208. DOI: 10.1145/2786.2793 |
0.386 |
|
1985 |
Bent SW, Sleator DD, Tarjan RE. BIASED SEARCH TREES Siam Journal On Computing. 14: 545-568. |
0.481 |
|
1983 |
Sleator DD, Endre Tarjan R. A data structure for dynamic trees Journal of Computer and System Sciences. 26: 362-391. DOI: 10.1016/0022-0000(83)90006-5 |
0.534 |
|
1980 |
Sleator DDKDB. A 2.5 times optimal algorithm for packing in two dimensions Information Processing Letters. 10: 37-40. DOI: 10.1016/0020-0190(80)90121-0 |
0.562 |
|
Show low-probability matches. |