Data structures and network algorithms
Data structures and network algorithms
Tight bounds for dynamic storage allocation
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Statistical Properties of the Buddy System
Journal of the ACM (JACM)
An Estimate of the Store Size Necessary for Dynamic Storage Allocation
Journal of the ACM (JACM)
Bounds for Some Functions Concerning Dynamic Storage Allocation
Journal of the ACM (JACM)
Representing dynamic binary trees succinctly
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
The Art of Computer Programming, 2nd Ed. (Addison-Wesley Series in Computer Science and Information
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Resizable Arrays in Optimal Time and Space
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Succinct Dynamic Data Structures
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Fast allocation and deallocation with an improved buddy system
Acta Informatica
Operating System Concepts
Dynamic ordered sets with exponential search trees
Journal of the ACM (JACM)
Dynamic Succinct Ordered Trees
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Dynamic rank/select structures with applications to run-length encoded texts
Theoretical Computer Science
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
FOCS '10 Proceedings of the 2010 IEEE 51st Annual Symposium on Foundations of Computer Science
Chunked extendible dense arrays for scientific data storage
Parallel Computing
| Hi-index | 0.00 |
We study the performance of several alternatives for implementing extendible arrays, which allow random access to elements stored in them, whilst allowing the arrays to be grown and shrunk. The study not only looks at the basic operations of grow/shrink and accessing data, but also the effects of memory fragmentation on performance.