:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Nishimoto, Takaaki, Tabei, Yasuo
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2404.07510
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dynamic Grammar-Compressed Self-Index in $δ$-Optimal Space
by: Nishimoto, Takaaki, et al.
Published: (2026)

Dynamic r-index: An Updatable Self-Index in LCP-bounded Time
by: Nishimoto, Takaaki, et al.
Published: (2025)

Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
by: Kempa, Dominik, et al.
Published: (2023)

jXBW: Fast Substructure Search for Large-Scale JSONL Datasets with LLM Applications
by: Tabei, Yasuo
Published: (2025)

Suffixient Arrays: a New Efficient Suffix Array Compression Technique
by: Cenzato, Davide, et al.
Published: (2024)

Compressing Hypergraphs using Suffix Sorting
by: Adler, Enno, et al.
Published: (2025)

Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025)

Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
by: Kosolobov, Dmitry, et al.
Published: (2021)

Fast and Lightweight Distributed Suffix Array Construction -- First Results
by: Haag, Manuel, et al.
Published: (2024)

Sparse Suffix and LCP Array: Simple, Direct, Small, and Fast
by: Ayad, Lorraine A. K., et al.
Published: (2023)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
by: Kikuchi, Masaru, et al.
Published: (2024)

Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
by: Kempa, Dominik, et al.
Published: (2025)

Suffix sorting via matching statistics
by: Lipták, Zsuzsanna, et al.
Published: (2022)

NP-Completeness for the Space-Optimality of Double-Array Tries
by: Bannai, Hideo, et al.
Published: (2024)

Online Computation of Palindromes and Suffix Trees on Tries
by: Shibata, Hiroki, et al.
Published: (2026)

Compressed Index with Construction in Compressed Space
by: Kosolobov, Dmitry
Published: (2026)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
by: Mieno, Takuya, et al.
Published: (2024)

LZ78 Substring Compression in Compressed Space
by: Shibata, Hiroki, et al.
Published: (2025)

Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)

In-Place BWT and Lyndon Array Construction in Constant Space
by: Louza, Felipe A., et al.
Published: (2025)

Space-time Trade-offs for the LCP Array of Wheeler DFAs
by: Cotumaccio, Nicola, et al.
Published: (2023)

Optimal-Time Mapping in Run-Length Compressed PBWT
by: Bonizzoni, Paola, et al.
Published: (2026)

Tight Lower Bounds for Central String Queries in Compressed Space
by: Kempa, Dominik, et al.
Published: (2025)

Engineering Fast and Space-Efficient Recompression from SLP-Compressed Text
by: Adudodla, Ankith Reddy, et al.
Published: (2025)

Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings
by: De, Rajat, et al.
Published: (2025)

Optimal Extended Formulations from Optimal Dynamic Programming Algorithms
by: Oliveira, Mateus de Oliveira, et al.
Published: (2026)

A Dynamic Working Set Method for Compressed Sensing
by: Cheng, Siu-Wing, et al.
Published: (2025)

Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
by: Domingues, Gabriel Marques
Published: (2026)

Fast, Space-Optimal Streaming Algorithms for Clustering and Subspace Embeddings
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Random Access in Grammar-Compressed Strings: Optimal Trade-Offs in Almost All Parameter Regimes
by: Duyster, Anouk, et al.
Published: (2026)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
by: Duyster, Anouk, et al.
Published: (2025)

Optimal Neighborhood Exploration for Dynamic Independent Sets
by: Borowitz, Jannick, et al.
Published: (2024)

(Worst-Case) Optimal Adaptive Dynamic Bitvectors
by: Navarro, Gonzalo
Published: (2024)

Nearly Space-Optimal Graph and Hypergraph Sparsification in Insertion-Only Data Streams
by: Cohen-Addad, Vincent, et al.
Published: (2025)

Dynamic Metric Embedding into $\ell_p$ Space
by: Banihashem, Kiarash, et al.
Published: (2024)

Linear-size Suffix Tries and Linear-size CDAWGs Simplified and Improved
by: Inenaga, Shunsuke
Published: (2024)

ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
by: Lehmann, Hans-Peter, et al.
Published: (2023)

Constructing Suffixient Arrays Revisited
by: Bonizzoni, Paola, et al.
Published: (2026)

Almost Optimal Fully Dynamic $k$-Center Clustering with Recourse
by: Bhattacharya, Sayan, et al.
Published: (2024)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
by: Bhattacharya, Sayan, et al.
Published: (2023)