Optimal cache-oblivious implicit dictionaries

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2719, Issue , 2003, Pages 316-331

  Franceschini, Gianni ^a   Grossi, Roberto ^a  

^a UNIVERSITY OF PISA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

BLOCK TRANSFER; CACHE-OBLIVIOUS; CACHE-OBLIVIOUS MODEL; DATA ACCESS; MEMORY CELL; MEMORY HIERARCHY;

CACHE MEMORY;

EID: 21144439966     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_27     Document Type: Article

References (20)

1. M. A. Bender, E. D. Demaine, and M. Farach-Colton. Cache-oblivious b-trees. In Proc. 41st Symposium on Foundations of Computer Science, pages 399-409, 2000.
2. Michael A. Bender, Richard Cole, and Rajeev Raman. Exponential structures for efficient cache-oblivious algorithms. Lecture Notes in Computer Science, 2380:195-207, 2002.
3. Michael A. Bender, Ziyang Duan, John Iacono, and Jing Wu. A locality-preserving cache-oblivious dynamic dictionary. In Proc. 13th Annual Symposium On Discrete Mathematics, pages 29-38, 2002.
4. Gerth Stølting Brodai, Rolf Fagerberg, and Riko Jacob. Cache-oblivious search trees via trees of small height. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 39-48, 2002.
5. Andrej Brodnik and J. Ian Munro. Membership in constant time and almost-minimum space. SIAM Journal on Computing, 28(5):1627-1640, 1999.
6. Amos Fiat, Moni Naor, Jeanette P. Schmidt, and Alan Siegel. Nonoblivious hashing. Journal of the ACM, 39(4):764-782, October 1992.
7. Robert W. Floyd. Algorithm 245 (TREESORT). Communications of the ACM, 7:701, 1964.
8. Gianni Franceschini and Roberto Grossi. Implicit dictionaries supporting searches and amortized updates in O(log n log log n). In Proc. 14th Annual Symposium on Discrete Algorithms, 2003.
9. 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), 2002.
10. Greg N. Frederickson. Implicit data structures for the dictionary problem. Journal of the ACM, 30(1):80-94, 1983.
11. Michael L. Fredman, János Komlós, and Endre Szemerédi. Storing a sparse table with O(1) worst case access time. J. ACM, 31(3):538-544, 1984.
12. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms. In Proc. 40th Annual Symposium on Foundations of Computer Science, pages 285-297, 1999.
13. Alon Itai, Alan G. Konheim, and Michael Rodeh. A sparse table implementation of priority queues. Proc. Intern. Colloquium on Automata, Languages and Programming, LNCS 115, pages 417-431, 1981.
14. D. E. Knuth. The Art of Computer Programming III: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973.
15. 2 n) time. Journal of Computer and System Sciences, 33(1):66-74, 1986.
16. 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.
17. Rasmus Pagh. Low redundancy in static dictionaries with constant query time. SIAM Journal on Computing, 31(2):353-363, 2002.
18. H. Prokop. Cache-oblivious algorithms. Master's thesis. MIT, Cambridge, MA, 1999.
19. Rajeev Raman, Venkatesh Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications tojencoding k-ary trees and multisets. In ACM-SIAM Symposium on Discrete Algorithms, pages 233-242, 2002.
20. J. W. J. Williams. Algorithm 232: Heapsort. Communications of the ACM, 7:347-348, 1964.