Competitive tree-structured dictionaries

Authors:
Michael T. Goodrich
Affiliations:
Dept. of Computer Science, Johns Hopkins Univ., Baltimore, MD
Venue:
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Year:
2000

Citing 5
Cited 0

Amortized efficiency of list update and paging rules

Communications of the ACM
Self-adjusting binary search trees

Journal of the ACM (JACM)
Competitive algorithms for on-line problems

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Scapegoat trees

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Design of Dynamic Data Structures

Design of Dynamic Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract