Randomized splay trees

Authors:
Martin Fürer
Affiliations:
Department of Computer Science and Engineering, Pennsylvania State University, University Park, PA
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Randomized splay trees: theoretical and experimental results

Information Processing Letters
Platypus: Design and Implementation of a Flexible High Performance Object Store

POS-9 Revised Papers from the 9th International Workshop on Persistent Object Systems
Data structures for limited oblivious execution of programs while preserving locality of reference

Proceedings of the 2007 ACM workshop on Digital Rights Management
When to use splay trees

Software—Practice & Experience
Chain-splay trees, or, how to achieve and prove loglogN-competitiveness by splaying

Information Processing Letters
Query Responsive Index Structures

GIScience '08 Proceedings of the 5th international conference on Geographic Information Science
Reducing splaying by taking advantage of working sets

WEA'08 Proceedings of the 7th international conference on Experimental algorithms
How to splay for loglogn-competitiveness

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms

Hi-index	0.00