On-the-Fly Array Initialization in Less Space * release_vdzjmrgjlbggbf2tk6aa4y3m5u

by Torben Hagerup, Frank Kammer

Released as a article-journal .


We show that for all given n, t, w ∈ {1, 2,. . .} with n < 2 w , an array of n entries of w bits each can be represented on a word RAM with a word length of w bits in at most nw + n(t/(2w)) t bits of uninitialized memory to support constant-time initialization of the whole array and O(t)-time reading and writing of individual array entries. At one end of this tradeoff, we achieve initializa-tion and access (i.e., reading and writing) in constant time with nw + n/w t bits for arbitrary fixed t, to be compared with nw + Θ(n) bits for the best previous solution, and at the opposite end, still with constant-time initialization, we support O(log n)-time access with just nw + 1 bits, which is optimal for arbitrary access times if the initialization executes fewer than n steps.
In text/plain format

Archived Files and Locations

application/pdf  530.4 kB
web.archive.org (webarchive)
drops.dagstuhl.de (web)
Read Archived PDF
Preserved and Accessible
Type  article-journal
Stage   unknown
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 0188b599-8849-44b3-af14-d45376cd95b5