:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Brisaboa, Nieves R., Cerdeira-Pena, Ana, de Bernardo, Guillermo, Fariña, Antonio, Navarro, Gonzalo
Format:	Preprint
Published:	2020
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2009.10045
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Optimal prefix-suffix queries with applications
by: Pissis, Solon P.
Published: (2024)

Constant-time edge label and leaf pointer maintenance on sliding suffix trees
by: Leonard, Laurentius, et al.
Published: (2023)

Adaptive encodings for small and fast compressed suffix arrays
by: Díaz-Domínguez, Diego, et al.
Published: (2026)

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

Optimization in Sanger Sequencing
by: Carpente, Luisa, et al.
Published: (2024)

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

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

Optimal antimatroid sorting
by: Berendsohn, Benjamin Aram
Published: (2025)

ExpoSort: Breaking the quasi-polynomial-time barrier for reluctant sorting
by: Abrahamsen, Mikkel
Published: (2024)

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

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

A fast implementation of the good-suffix array for the Boyer-Moore string matching algorithm
by: Lecroq, Thierry
Published: (2024)

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

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)

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

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

Space-efficient SLP encoding for $O(\log N)$-time random access
by: Takasaka, Akito, et al.
Published: (2024)

SquareSort: a cache-oblivious sorting algorithm
by: Koucký, Michal, et al.
Published: (2024)

bsort: A theoretically efficient non-comparison-based sorting algorithm for integer and floating-point numbers
by: Guzmán, Benjamín
Published: (2026)

Fast and explainable clustering based on sorting
by: Chen, Xinye, et al.
Published: (2022)

Fast and exact fixed-radius neighbor search based on sorting
by: Chen, Xinye, et al.
Published: (2022)

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

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

Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries
by: Jo, Seungbum, et al.
Published: (2022)

Online sorting and online TSP: randomized, stochastic, and high-dimensional
by: Abrahamsen, Mikkel, et al.
Published: (2024)

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
by: Ould-Khessal, Nadir, et al.
Published: (2026)

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

Latency Guarantees for Caching with Delayed Hits
by: Gurushankar, Keerthana, et al.
Published: (2025)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
by: Paul-Pena, Daniel, et al.
Published: (2025)

Towards universally optimal sorting algorithms
by: Sen, Sandeep
Published: (2025)

Simple and efficient four-cycle counting on sparse graphs
by: Burkhardt, Paul, et al.
Published: (2023)

A more efficient algorithm to compute the Rand Index for change-point problems
by: Prates, Lucas de Oliveira
Published: (2021)

Round-efficient Fully-scalable MPC algorithms for k-Means
by: Jiang, Shaofeng H. -C., et al.
Published: (2026)

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

A simple and efficient preprocessing step for convex hull problem
by: Heydari, Mohammad, et al.
Published: (2023)

Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
by: Becchetti, Luca, et al.
Published: (2025)

Downstream: efficient cross-platform algorithms for fixed-capacity stream downsampling
by: Yang, Connor, et al.
Published: (2025)

The self-concordant perceptron is efficient on a sub-family feasibility instances
by: Chan-Hon-Tong, Adrien
Published: (2019)