Compressed Index with Construction in Compressed Space
Fuente:
arXiv
Saved in:
| Main Author: | Kosolobov, Dmitry |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
by: Kosolobov, Dmitry, et al.
Published: (2021)
by: Kosolobov, Dmitry, et al.
Published: (2021)
Simplified Tight Bounds for Monotone Minimal Perfect Hashing
by: Kosolobov, Dmitry
Published: (2024)
by: Kosolobov, Dmitry
Published: (2024)
Closed Repeats
by: Kosolobov, Dmitry
Published: (2024)
by: Kosolobov, Dmitry
Published: (2024)
Efficiency of ANS Entropy Encoders
by: Kosolobov, Dmitry
Published: (2022)
by: Kosolobov, Dmitry
Published: (2022)
Relating Left and Right Extensions of Maximal Repeats
by: Inenaga, Shunsuke, et al.
Published: (2024)
by: Inenaga, Shunsuke, et al.
Published: (2024)
Dynamic Grammar-Compressed Self-Index in $δ$-Optimal Space
by: Nishimoto, Takaaki, et al.
Published: (2026)
by: Nishimoto, Takaaki, et al.
Published: (2026)
String Indexing with Compressed Patterns
by: Bille, Philip, et al.
Published: (2019)
by: Bille, Philip, et al.
Published: (2019)
LZ78 Substring Compression in Compressed Space
by: Shibata, Hiroki, et al.
Published: (2025)
by: Shibata, Hiroki, et al.
Published: (2025)
Collapsing the Hierarchy of Compressed Data Structures: Suffix Arrays in Optimal Compressed Space
by: Kempa, Dominik, et al.
Published: (2023)
by: Kempa, Dominik, et al.
Published: (2023)
The CDAWG Index and Pattern Matching on Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)
by: Cleary, Alan M., et al.
Published: (2024)
Dynamic Suffix Array in Optimal Compressed Space
by: Nishimoto, Takaaki, et al.
Published: (2024)
by: Nishimoto, Takaaki, et al.
Published: (2024)
Tight Lower Bounds for Central String Queries in Compressed Space
by: Kempa, Dominik, et al.
Published: (2025)
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)
by: Adudodla, Ankith Reddy, et al.
Published: (2025)
AutoCSF: Provably Space-Efficient Indexing of Skewed Key-Value Workloads via Filter-Augmented Compressed Static Functions
by: Ramos, David Torres, et al.
Published: (2026)
by: Ramos, David Torres, et al.
Published: (2026)
Compressed Game Solving
by: Considine, Jeffrey
Published: (2024)
by: Considine, Jeffrey
Published: (2024)
Sketching and Streaming for Dictionary Compression
by: Becker, Ruben, et al.
Published: (2023)
by: Becker, Ruben, et al.
Published: (2023)
Revisiting the Sparse Matrix Compression Problem
by: Jugé, Vincent, et al.
Published: (2026)
by: Jugé, Vincent, et al.
Published: (2026)
Compressing Hypergraphs using Suffix Sorting
by: Adler, Enno, et al.
Published: (2025)
by: Adler, Enno, et al.
Published: (2025)
Word Break on SLP-Compressed Texts
by: De, Rajat, et al.
Published: (2025)
by: De, Rajat, et al.
Published: (2025)
Compressing Suffix Trees by Path Decompositions
by: Becker, Ruben, et al.
Published: (2025)
by: Becker, Ruben, et al.
Published: (2025)
Compressed Set Representations based on Set Difference
by: Gagie, Travis, et al.
Published: (2026)
by: Gagie, Travis, et al.
Published: (2026)
LZD-style Compression Scheme with Truncation and Repetitions
by: Götz, Linus, et al.
Published: (2025)
by: Götz, Linus, et al.
Published: (2025)
Fast Practical Compression of Deterministic Finite Automata
by: Bille, Philip, et al.
Published: (2023)
by: Bille, Philip, et al.
Published: (2023)
Substring Compression Variations and LZ78-Derivates
by: Köppl, Dominik
Published: (2024)
by: Köppl, Dominik
Published: (2024)
Optimal-Time Mapping in Run-Length Compressed PBWT
by: Bonizzoni, Paola, et al.
Published: (2026)
by: Bonizzoni, Paola, et al.
Published: (2026)
Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
by: Domingues, Gabriel Marques
Published: (2026)
by: Domingues, Gabriel Marques
Published: (2026)
Compressed Dictionary Matching on Run-Length Encoded Strings
by: Bille, Philip, et al.
Published: (2025)
by: Bille, Philip, et al.
Published: (2025)
A Dynamic Working Set Method for Compressed Sensing
by: Cheng, Siu-Wing, et al.
Published: (2025)
by: Cheng, Siu-Wing, et al.
Published: (2025)
Output-Sparse Matrix Multiplication Using Compressed Sensing
by: Bennett, Huck, et al.
Published: (2025)
by: Bennett, Huck, et al.
Published: (2025)
Revisiting the Folklore Algorithm for Random Access to Grammar-Compressed Strings
by: Cleary, Alan M., et al.
Published: (2024)
by: Cleary, Alan M., et al.
Published: (2024)
Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
by: Ferragina, Paolo, et al.
Published: (2025)
by: Ferragina, Paolo, et al.
Published: (2025)
QuaRs: A Transform for Better Lossless Compression of Integers
by: Matt, Jonas G.
Published: (2025)
by: Matt, Jonas G.
Published: (2025)
Space-Efficient k-Mismatch Text Indexes
by: Kociumaka, Tomasz, et al.
Published: (2025)
by: Kociumaka, Tomasz, et al.
Published: (2025)
Indexing Tries within Entropy-Bounded Space
by: Carfagna, Lorenzo, et al.
Published: (2025)
by: Carfagna, Lorenzo, et al.
Published: (2025)
Suffixient Arrays: a New Efficient Suffix Array Compression Technique
by: Cenzato, Davide, et al.
Published: (2024)
by: Cenzato, Davide, et al.
Published: (2024)
Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
by: Duyster, Anouk, et al.
Published: (2025)
by: Duyster, Anouk, et al.
Published: (2025)
Accelerating Graph Neural Networks with a Novel Matrix Compression Format
by: Alves, João N. F., et al.
Published: (2024)
by: Alves, João N. F., et al.
Published: (2024)
Improved Time-Space Tradeoffs for 3SUM-Indexing
by: Dinur, Itai, et al.
Published: (2025)
by: Dinur, Itai, et al.
Published: (2025)
Effective Index Construction Algorithm for Optimal $(k,η)$-cores Computation
by: Sun, Shengli, et al.
Published: (2025)
by: Sun, Shengli, et al.
Published: (2025)
Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings
by: De, Rajat, et al.
Published: (2025)
by: De, Rajat, et al.
Published: (2025)
Similar Items
-
Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
by: Kosolobov, Dmitry, et al.
Published: (2021) -
Simplified Tight Bounds for Monotone Minimal Perfect Hashing
by: Kosolobov, Dmitry
Published: (2024) -
Closed Repeats
by: Kosolobov, Dmitry
Published: (2024) -
Efficiency of ANS Entropy Encoders
by: Kosolobov, Dmitry
Published: (2022) -
Relating Left and Right Extensions of Maximal Repeats
by: Inenaga, Shunsuke, et al.
Published: (2024)