Implicit dictionaries supporting searches and amortized updates in O(log n log log n) time

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 670-678

  Franceschini, Gianni ^a   Grossi, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; GRAPH THEORY; MATHEMATICAL MODELS; RANDOM ACCESS STORAGE; STORAGE ALLOCATION (COMPUTER);

AMORTIZED UPDATES; IMPLICIT DATA STRUCTURES;

DATA STRUCTURES;

EID: 0038415994     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Gianni Franceschini, Roberto Grossi, J. Ian Munro, and Linda Pagli. Implicit B-trees: New results for the dictionary problem. In IEEE Symposium on Foundations of Computer Science (FOCS), to appear, 2002.
2. Greg N. Frederickson. Self-organizing heuristics for implicit data structures. SIAM Journal on Computing, 13(2):277-291, 1984.
3. J. Ian Munro and Hendra Suwanda. Implicit data structures for fast search and update. Journal of Computer and System Sciences, 21(2):236-250, 1980.
4. 2n) time. Journal of Computer and System Sciences, 33(1):66-74, 1986.
5. J.W.J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7:347-348, 1964.
6. Andrew C. Yao. Should tables be sorted? J. Assoc. Comput. Mach., 31:245-281, 1984.