Skip Navigation

The Computer Journal 2004 47(1):10-19; doi:10.1093/comjnl/47.1.10
© 2004 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Georgakopoulos, G. F.
Right arrow Articles by McClurkin, D. J.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Generalized Template Splay: A Basic Theory and Calculus

George F. Georgakopoulos1, and David J. McClurkin1,§

1 Computer Science Department, University of Crete, Knossou Ave., GR-71409, Heraklion, Crete, Greece

We generalize the technique of classic splay trees of Sleator and Tarjan, showing that almost all template-based rules for self-adjusting a multi-way tree have logarithmic amortized cost and other properties of splay trees, such as ‘static optimality’, the ‘static finger’ and ‘working set’ properties. We achieve this by defining in a new way (through ‘progress factors’) a potential on a weighted tree, and by introducing a new technique (which we call ‘± calculus’) for calculating the changes in potential.

Received 25 April 2002. Revised 31 May 2003.

* Email: ggeo{at}csd.uoc.gr

§ Email: davidmcc{at}csd.uoc.gr


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.