:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Navarro, Gonzalo, Urbina, Cristian
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2402.09232
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Balancing Two-Dimensional Straight-Line Programs
by: Boneh, Itai, et al.
Published: (2025)

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

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
by: Fujimaru, Hiroto, et al.
Published: (2025)

On Planar Straight-Line Dominance Drawings
by: Angelini, Patrizio, et al.
Published: (2025)

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

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

Generalization of Repetitiveness Measures for Two-Dimensional Strings
by: Carfagna, Lorenzo, et al.
Published: (2025)

Exploring Repetitiveness Measures for Two-Dimensional Strings
by: Romana, Giuseppe, et al.
Published: (2024)

On Occurrence-Preserving Morphisms
by: Kishi, Kaisei, et al.
Published: (2026)

BAT-LZ Out of Hell
by: Lipták, Zsuzsanna, et al.
Published: (2024)

A Textbook Solution for Dynamic Strings
by: Lipták, Zsuzsanna, 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)

Sensitivity of Repetitiveness Measures to String Reversal
by: Bannai, Hideo, et al.
Published: (2026)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
by: Im, Sungjin, et al.
Published: (2023)

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)

Bit catastrophes for the Burrows-Wheeler Transform
by: Giuliani, Sara, 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)

The clustered Sparrow algorithm
by: Dumitrescu, Cristian
Published: (2018)

Faster Iterative $ϕ$ Queries on the Positional BWT
by: Bonizzoni, Paola, et al.
Published: (2026)

$k$-Clustering via Iterative Randomized Rounding
by: Byrka, Jarosław, et al.
Published: (2026)

On the Advice Complexity of Online Matching on the Line
by: Csaba, Béla, et al.
Published: (2024)

Competitive Search in the Line and the Star with Predictions
by: Angelopoulos, Spyros
Published: (2023)

Selection Improvements on the Parallel Iterative Algorithm for Stable Matching
by: Wynn, Scott, et al.
Published: (2024)

Learning Minimum Linear Arrangement of Cliques and Lines
by: Dallot, Julien, et al.
Published: (2024)

Online Drone Coverage of Targets on a Line
by: Dobrev, Stefan, et al.
Published: (2026)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
by: Antoniadis, Antonios, et al.
Published: (2020)

The Power of Greedy for Online Minimum Cost Matching on the Line
by: Balkanski, Eric, et al.
Published: (2022)

An EPTAS for Cardinality Constrained Multiple Knapsack via Iterative Randomized Rounding
by: Doron-Arad, Ilan, et al.
Published: (2023)

Fast Iteration of Spaced k-mers
by: Czech, Lucas
Published: (2026)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
by: Di Battista, Giuseppe, et al.
Published: (2021)

Online Deterministic Minimum Cost Bipartite Matching with Delays on a Line
by: Kuo, Tung-Wei
Published: (2024)

Approximating Unrelated Machine Weighted Completion Time Using Iterative Rounding and Computer Assisted Proofs
by: Li, Shi
Published: (2024)

Morphisms and BWT-run Sensitivity
by: Fici, Gabriele, et al.
Published: (2025)

Learning-Augmented Online TRP on a Line
by: Guragain, Swapnil, et al.
Published: (2026)

Line Coverage with Multiple Robots: Algorithms and Experiments
by: Agarwal, Saurav, et al.
Published: (2022)

On Integer Programs That Look Like Paths
by: Briański, Marcin, et al.
Published: (2025)