:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Navarro, Gonzalo, Olivares, Francisco, Urbina, Cristian
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2404.07057
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Iterated Straight-Line Programs
par: Navarro, Gonzalo, et autres
Publié: (2024)

Balancing Two-Dimensional Straight-Line Programs
par: Boneh, Itai, et autres
Publié: (2025)

Incongruity-sensitive access to highly compressed strings
par: Cicalese, Ferdinando, et autres
Publié: (2026)

Smallest Suffixient Sets: Effectiveness, Resilience, and Calculation
par: Fujimaru, Hiroto, et autres
Publié: (2025)

On Planar Straight-Line Dominance Drawings
par: Angelini, Patrizio, et autres
Publié: (2025)

Counting on General Run-Length Grammars
par: Navarro, Gonzalo, et autres
Publié: (2024)

Generalization of Repetitiveness Measures for Two-Dimensional Strings
par: Carfagna, Lorenzo, et autres
Publié: (2025)

(Worst-Case) Optimal Adaptive Dynamic Bitvectors
par: Navarro, Gonzalo
Publié: (2024)

Exploring Repetitiveness Measures for Two-Dimensional Strings
par: Romana, Giuseppe, et autres
Publié: (2024)

On Occurrence-Preserving Morphisms
par: Kishi, Kaisei, et autres
Publié: (2026)

Testing Suffixient Sets
par: Cenzato, Davide, et autres
Publié: (2025)

BAT-LZ Out of Hell
par: Lipták, Zsuzsanna, et autres
Publié: (2024)

A Textbook Solution for Dynamic Strings
par: Lipták, Zsuzsanna, et autres
Publié: (2024)

Fast and Small Subsampled R-indexes
par: Cobas, Dustin, et autres
Publié: (2024)

Compressed Set Representations based on Set Difference
par: Gagie, Travis, et autres
Publié: (2026)

Sensitivity of Repetitiveness Measures to String Reversal
par: Bannai, Hideo, et autres
Publié: (2026)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
par: Arroyuelo, Diego, et autres
Publié: (2023)

Faster run-length compressed suffix arrays
par: Brown, Nathaniel K., et autres
Publié: (2024)

Bit catastrophes for the Burrows-Wheeler Transform
par: Giuliani, Sara, et autres
Publié: (2024)

Space/time-efficient RDF stores based on circular suffix sorting
par: Brisaboa, Nieves R., et autres
Publié: (2020)

Suffixient Arrays: a New Efficient Suffix Array Compression Technique
par: Cenzato, Davide, et autres
Publié: (2024)

New Compressed Indices for Multijoins on Graph Databases
par: Arroyuelo, Diego, et autres
Publié: (2024)

The clustered Sparrow algorithm
par: Dumitrescu, Cristian
Publié: (2018)

On the Advice Complexity of Online Matching on the Line
par: Csaba, Béla, et autres
Publié: (2024)

Competitive Search in the Line and the Star with Predictions
par: Angelopoulos, Spyros
Publié: (2023)

Learning Minimum Linear Arrangement of Cliques and Lines
par: Dallot, Julien, et autres
Publié: (2024)

Online Drone Coverage of Targets on a Line
par: Dobrev, Stefan, et autres
Publié: (2026)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
par: Antoniadis, Antonios, et autres
Publié: (2020)

The Power of Greedy for Online Minimum Cost Matching on the Line
par: Balkanski, Eric, et autres
Publié: (2022)

From Tutte to Floater and Gotsman: On the Resolution of Planar Straight-line Drawings and Morphs
par: Di Battista, Giuseppe, et autres
Publié: (2021)

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

Morphisms and BWT-run Sensitivity
par: Fici, Gabriele, et autres
Publié: (2025)

Learning-Augmented Online TRP on a Line
par: Guragain, Swapnil, et autres
Publié: (2026)

Line Coverage with Multiple Robots: Algorithms and Experiments
par: Agarwal, Saurav, et autres
Publié: (2022)

On Integer Programs That Look Like Paths
par: Briański, Marcin, et autres
Publié: (2025)

Randomized Rounding over Dynamic Programs
par: Bamas, Etienne, et autres
Publié: (2025)

Solving Linear Programs with Differential Privacy
par: Ene, Alina, et autres
Publié: (2025)

From Dynamic Programs to Greedy Algorithms
par: van Melkebeek, Dieter
Publié: (2025)

Solving Positive Linear Programs with Differential Privacy
par: Ene, Alina, et autres
Publié: (2026)

Space-Efficient Algorithm for Integer Programming with Few Constraints
par: Rohwedder, Lars, et autres
Publié: (2024)