
TL;DR
This paper introduces an in-place, space-efficient algorithm for initializable arrays that supports constant-time read, write, and initialization operations using only one extra bit, optimizing previous solutions.
Contribution
It presents a novel in-place algorithm for initializable arrays that uses minimal extra space and achieves optimal time complexity for all operations.
Findings
Supports all operations in constant worst-case time
Uses only 1 extra bit beyond normal array storage
Improves space efficiency over previous methods
Abstract
An initializable array is an array that supports the read and write operations for any element and the initialization of the entire array. This paper proposes a simple in-place algorithm to implement an initializable array of length containing bits entries in bits on the word RAM model with bits word size, i.e., the proposed array requires only 1 extra bit on top of a normal array of length containing bits entries. Our algorithm supports the all three operations in constant worst-case time, that is, it runs in-place using at most constant number of words bits during each operation. The time and space complexities are optimal since it was already proven that there is no implementation of an initializable array with no extra bit supporting all the operations in constant worst-case time [Hagerup and Kammer, ISAAC 2017]. Our algorithm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
