Resizable arrays in optimal time and space
1999 (English)In: Algorithms and Data Structures: 6th International Workshop, WADS'99 Vancouver, Canada, August 11-14, 1999 Proceedings / [ed] Frank Dehne, Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1999, 37-48 p.Conference paper (Refereed)
We present simple, practical and efficient data structures for the fundamental problem of maintaining a resizable one-dimensional array, A[l..l + n - 1], of fixed-size elements, as elements are added to or removed from one or both ends. Our structures also support access to the element in position i. All operations are performed in constant time. The extra space (i.e., the space used past storing the n current elements) is O(√n) at any point in time. This is shown to be within a constant factor of optimal, even if there are no constraints on the time. If desired, each memory block can be made to have size 2k - c for a specified constant c, and hence the scheme works effectively with the buddy system. The data structures can be used to solve a variety of problems with optimal bounds on time and extra storage. These include stacks, queues, randomized queues, priority queues, and deques.
Place, publisher, year, edition, pages
Berlin: Encyclopedia of Global Archaeology/Springer Verlag, 1999. 37-48 p.
Lecture Notes in Computer Science, ISSN 0302-9743 ; 1663
Research subject Dependable Communication and Computation Systems
IdentifiersURN: urn:nbn:se:ltu:diva-26832DOI: 10.1007/3-540-48447-7Local ID: 0168a6a0-f0fd-11dc-ba03-000ea68e967bISBN: 3-540-66279-0OAI: oai:DiVA.org:ltu-26832DiVA: diva2:1000012
International Workshop on Algorithms and Data Structures : 11/08/1999 - 14/08/1999
Godkänd; 1999; 20080313 (ysko)2016-09-302016-09-30Bibliographically approved