Journal Article COMPETITIVE ALGORITHMS FOR SERVER PROBLEMS 1990 • Journal of Algorithms in Cognition, Informatics and Logic • 11(2):208-230 MANASSE MS, MCGEOCH LA, SLEATOR DD
Journal Article A TIGHT AMORTIZED BOUND FOR PATH REVERSAL 1989 • Information Processing Letters • 31(1):3-5 GINAT D, SLEATOR DD, TARJAN RE
Chapter Competitive algorithms for on-line problems 1989 • Contemporary Mathematics • 89:45-53 Manasse MS, McGeoch LA, Sleator DD
Journal Article MAKING DATA-STRUCTURES PERSISTENT 1989 • Journal of Computer and System Sciences • 38(1):86-124 DRISCOLL JR, SARNAK N, SLEATOR DD, TARJAN RE
Conference Competitive algorithms for on-line problems 1988 • Annual ACM Symposium on Theory of Computing • 322-333 Manasse MS, McGeoch LA, Sleator DD
Journal Article COMPETITIVE SNOOPY CACHING 1988 • Algorithmica • 3(1):79-119 KARLIN AR, MANASSE MS, RUDOLPH L, SLEATOR DD
Journal Article Competitive snoopy caching 1988 • Algorithmica • 3(1):79-119 Karlin AR, Manasse MS, Rudolph L, Sleator DD
Journal Article Rotation distance, triangulations, and hyperbolic geometry 1988 • Journal of The American Mathematical Society • 1(3):647-681 Sleator DD, Tarjan RE, Thurston WP
Chapter COMPETITIVE SNOOPY CACHING11A preliminary version of this paper appeared in the Proceedings of the 27th Annual Symposium on the Foundations of Computer Science, IEEE, Toronto, Canada, 1986. A version of this paper containing all proofs and some... 1987 459-483 Karlin AR, Manasse MS, Rudolph L, Sleator DD
Conference TWO ALGORITHMS FOR MAINTAINING ORDER IN A LIST. 1987 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 365-372 Dietz PF, Sleator DD
Journal Article A LOCALLY ADAPTIVE DATA-COMPRESSION SCHEME 1986 • Communications of the ACM • 29(4):320-330 BENTLEY JL, SLEATOR DD, TARJAN RE, WEI VK
Conference COMPETITIVE SNOOPY CACHING. 1986 • Annual Symposium on Foundations of Computer Science • 244-254 Karlin AR, Manasse MS, Rudolph L, Sleator DD
Conference Making data structures persistent 1986 109-121 Driscoll JR, Sarnak N, Sleator DD, Tarjan RE
Conference Rotation distance, triangulations, and hyperbolic geometry 1986 122-135 Sleator DD, Tarjan RE, Thurston WP
Journal Article SELF-ADJUSTING HEAPS 1986 • SIAM journal on computing (Print) • 15(1):52-69 SLEATOR DD, TARJAN RE
Journal Article The Pairing Heap: A New Form of Self-Adjusting Heap 1986 • Algorithmica • 1(1-4):111-129 Fredman ML, Sedgewick R, Sleator DD, Tarjan RE
Journal Article AMORTIZED EFFICIENCY OF LIST UPDATE AND PAGING RULES 1985 • Communications of the ACM • 28(2):202-208 SLEATOR DD, TARJAN RE
Journal Article BIASED SEARCH-TREES 1985 • SIAM journal on computing (Print) • 14(3):545-568 BENT SW, SLEATOR DD, TARJAN RE
Journal Article SELF-ADJUSTING BINARY SEARCH-TREES 1985 • Journal of the ACM • 32(3):652-686 SLEATOR DD, TARJAN RE
Conference Amortized efficiency of list update rules 1984 • Annual ACM Symposium on Theory of Computing • Part F130362:488-492 Sleator DD, Tarjan RE
Journal Article A DATA STRUCTURE FOR DYNAMIC TREES 1983 • Journal of Computer and System Sciences • 26(3):362-391 SLEATOR DD, TARJAN RE
Conference SELF-ADJUSTING BINARY TREES. 1983 • Conference Proceedings of the Annual ACM Symposium on Theory of Computing • 235-245 Sleator DD, Tarjan RE
Conference A data structure for dynamic trees 1981 • Annual ACM Symposium on Theory of Computing • 114-122 Sleator DD, Tarjan RE
