In-place initializable arrays

DOI10.1016/J.TCS.2022.03.004MaRDI QIDQ2143131zbMATH OpenOpenAlexFDO

Authors Takashi Katoh, Keisuke Goto

Publication date 31 May 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1709.08900

zbMATH Keywords

in-place algorithminitializable arrayspace efficient data structure

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On-the-fly array initialization in less space
• Extra space during initialization of succinct data structures and dynamical initializable arrays
• Compact dynamic rewritable (CDRW) arrays
• scientific article; zbMATH DE number 2185599
• scientific article; zbMATH DE number 1830754

Cites work

• Extra space during initialization of succinct data structures and dynamical initializable arrays
• Fast breadth-first search in still less space
• Highly succinct dynamic data structures
• scientific article; zbMATH DE number 3887059 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• On-the-fly array initialization in less space
• Spaces, trees, and colors: the algorithmic landscape of document retrieval on sequences

Cited in

(3)

• Space-efficient vertex separators for treewidth
• Inferring complete initialization of arrays
• Sorting and ranking of self-delimiting numbers with applications to outerplanar graph isomorphism

This page was built for publication: In-place initializable arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2143131)