Biased dictionaries with fast insert/deletes

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2001, Pages 483-491

  Ergun, Funda ^a   Sahinalp, S Cenk ^a   Sharp, Jonathan ^b   Sinha, Rakesh ^c  

^a CASE WESTERN RESERVE UNIVERSITY   (United States)

^b UNIVERSITY OF WARWICK   (United Kingdom)

^c Signal Integrity

Author keywords

[No Author keywords available]

Indexed keywords

GLOSSARIES; PROBABILITY; THEOREM PROVING; TREES (MATHEMATICS);

DICTIONARY PROBLEMS;

DATA STRUCTURES;

EID: 0034825998     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/380752.380843     Document Type: Conference Paper

References (24)

1. Biased search trees
2. A locally adaptive data compression scheme
3. Web caching and zipf-like distributions: Evidence and implications
4. A block-sorting lossless data compression algorithm
5. Fractional cascading
6. A parameterizable methodology for internet traffic flow profiling
7. An approximate analysis of the LRU and FIFO buffer replacement schemes
8. A dynamic lookup scheme for bursty access patterns
9. Biased skip lists for highly skewed access patterns
10. Opportunistic data structures with applications
11. The parentheses tree
12. A simulation study of IP switching
13. Dynamic binary search
14. Arbitrary weight changes in dynamic trees
15. Dynamic fractional cascading
16. Algorithm design and software libraries: Recent developments in leda project
17. Data structures
18. The LRU-K page replacement algorithm for database disk buffering
19. Skip lists: A probabilistic alternative to balanced trees
20. Randomized search trees
21. Self-adjusting binary search trees