:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lipták, Zsuzsanna, Masillo, Francesco, Navarro, Gonzalo
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2403.09893
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Textbook Solution for Dynamic Strings
by: Lipták, Zsuzsanna, et al.
Published: (2024)

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

Prefix-free parsing for merging big BWTs
by: Diaz-Dominguez, Diego, et al.
Published: (2025)

A survey of BWT variants for string collections
by: Cenzato, Davide, et al.
Published: (2022)

Incongruity-sensitive access to highly compressed strings
by: Cicalese, Ferdinando, et al.
Published: (2026)

Bubble-Flip -- A New Generation Algorithm for Prefix Normal Words
by: Cicalese, Ferdinando, et al.
Published: (2017)

Pattern Discovery in Colored Strings
by: Lipták, Zsuzsanna, et al.
Published: (2020)

BWT for string collections
by: Cenzato, Davide, et al.
Published: (2025)

Bit catastrophes for the Burrows-Wheeler Transform
by: Giuliani, Sara, et al.
Published: (2024)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
by: Burcsi, Péter, et al.
Published: (2020)

Substring Compression Variations and LZ78-Derivates
by: Köppl, Dominik
Published: (2024)

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

Lempel-Ziv (LZ77) Factorization in Sublinear Time
by: Kempa, Dominik, et al.
Published: (2024)

Computing the LZ-End parsing: Easy to implement and practically efficient
by: Dinklage, Patrick
Published: (2024)

RLZ-r and LZ-End-r: Enhancing Move-r
by: Dinklage, Patrick, et al.
Published: (2025)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
by: Giuliani, Sara, et al.
Published: (2020)

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

The Complexity of Dynamic LZ77 is $\tildeΘ(n^{2/3})$
by: Boneh, Itai, et al.
Published: (2025)

Analyzing and Leveraging the $k$-Sensitivity of LZ77
by: Bathie, Gabriel, et al.
Published: (2026)

LZBE: an LZ-style compressor supporting $O(\log n)$-time random access
by: Shibata, Hiroki, et al.
Published: (2025)

Iterated Straight-Line Programs
by: Navarro, Gonzalo, et al.
Published: (2024)

Counting on General Run-Length Grammars
by: Navarro, Gonzalo, et al.
Published: (2024)

Tight Additive Sensitivity on LZ-style Compressors and String Attractors
by: Fujie, Yuto, et al.
Published: (2025)

Generalized Straight-Line Programs
by: Navarro, Gonzalo, et al.
Published: (2024)

Fast and Small Subsampled R-indexes
by: Cobas, Dustin, et al.
Published: (2024)

Compressed Set Representations based on Set Difference
by: Gagie, Travis, et al.
Published: (2026)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
by: Arroyuelo, Diego, et al.
Published: (2023)

Faster run-length compressed suffix arrays
by: Brown, Nathaniel K., et al.
Published: (2024)

Space/time-efficient RDF stores based on circular suffix sorting
by: Brisaboa, Nieves R., et al.
Published: (2020)

New Compressed Indices for Multijoins on Graph Databases
by: Arroyuelo, Diego, et al.
Published: (2024)

Stochastic Matching via In-n-Out Local Computation Algorithms
by: Azarmehr, Amir, et al.
Published: (2024)

(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow
by: Trabelsi, Ohad
Published: (2023)

MOMENTI: Scalable Motif Mining in Multidimensional Time Series
by: Ceccarello, Matteo, et al.
Published: (2025)

Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach
by: Boninsegna, Fabrizio, et al.
Published: (2024)

Robust Out-of-Order Retrieval for Grid-Based Storage at Maximum Capacity
by: Geft, Tzvika, et al.
Published: (2026)

Efficient Computation of Periods and Covers Using Sampling
by: Lecroq, Thierry, et al.
Published: (2024)

Differentially Private High-Dimensional Approximate Range Counting, Revisited
by: Aumüller, Martin, et al.
Published: (2024)

Dimensionality Reduction on Complex Vector Spaces for Euclidean Distance with Dynamic Weights
by: Moretti, Simone, et al.
Published: (2022)

Efficient Enumeration of At Most $k$-Out Polygons
by: Akram, Waseem, et al.
Published: (2025)

Taxonomic classification with maximal exact matches in KATKA kernels and minimizer digests
by: Draesslerová, Dominika, et al.
Published: (2024)