In-place initializable arrays

DOI10.1016/j.tcs.2022.03.004OpenAlexW2758730948MaRDI QIDQ2143131

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)

Related Items (1)

Space-efficient vertex separators for treewidth

Cites Work

• Unnamed Item
• Unnamed Item
• Highly succinct dynamic data structures
• Fast breadth-first search in still less space
• Extra Space during Initialization of Succinct Data Structures and Dynamical Initializable Arrays.
• On-the-Fly Array Initialization in Less Space
• Spaces, Trees, and Colors

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