:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Cicalese, Ferdinando, Lipták, Zsuzsanna, Rossi, Massimiliano
Format:	Preprint
Published:	2017
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/1712.05876
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

On the complexity and approximability of Bounded access Lempel Ziv coding
by: Cicalese, Ferdinando, et al.
Published: (2024)

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

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

On constrained intersection representations of graphs and digraphs
by: Cicalese, Ferdinando, et al.
Published: (2025)

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

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

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

A Fast Algorithm for Computing Prefix Probabilities
by: Nowak, Franz, et al.
Published: (2023)

Algorithms for Galois Words: Detection, Factorization, and Rotation
by: Hendrian, Diptarama, et al.
Published: (2024)

Adaptive Flip Graph Algorithm for Matrix Multiplication
by: Arai, Yamato, et al.
Published: (2023)

LLM Query Scheduling with Prefix Reuse and Latency Constraints
by: Dexter, Gregory, et al.
Published: (2025)

Small Space Encoding and Recognition of $k$-Palindromic Prefixes
by: Bathie, Gabriel, et al.
Published: (2024)

Revisit the Partial Coloring Method: Prefix Spencer and Sampling
by: Cai, Dongrun, et al.
Published: (2024)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
by: Kikuchi, Masaru, et al.
Published: (2024)

V-Words, Lyndon Words and Galois Words
by: Daykin, Jacqueline W., et al.
Published: (2024)

A Sierpinski Triangle Data Structure for Efficient Array Value Update and Prefix Sum Calculation
by: Harrison, Brent, et al.
Published: (2024)

Prefix Sums via Kronecker Products
by: Sobczyk, Aleksandros, et al.
Published: (2025)

Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
by: Kempa, Dominik, et al.
Published: (2025)

Popping Bubbles in Pangenome Graphs
by: Mwaniki, Njagi, et al.
Published: (2024)

Subsequence Covers of Words
by: Charalampopoulos, Panagiotis, et al.
Published: (2025)

FlipHash: A Constant-Time Consistent Range-Hashing Algorithm
by: Masson, Charles, et al.
Published: (2024)

New Algorithm for Combinatorial $n$-folds and Applications
by: Jansen, Klaus, et al.
Published: (2024)

New Algorithms and Hardness Results for Connected Clustering
by: Eube, Jan, et al.
Published: (2025)

Efficient Algorithms and New Characterizations for CSP Sparsification
by: Khanna, Sanjeev, et al.
Published: (2024)

New Algorithms and Lower Bounds for Streaming Tournaments
by: Ghosh, Prantar, et al.
Published: (2024)

New Algorithms for #2-SAT and #3-SAT
by: Peng, Junqiang, et al.
Published: (2025)

Characterization of Circular-arc Graphs: II. McConnell Flipping
by: Cao, Yixin, et al.
Published: (2024)

Word Break on SLP-Compressed Texts
by: De, Rajat, et al.
Published: (2025)

Exploring Word-Representable Temporal Graphs
by: Adamson, Duncan
Published: (2025)

Prefix-bounded matrices
by: Borsik, Nóra A., et al.
Published: (2025)

New Parallel and Streaming Algorithms for Directed Densest Subgraph
by: Mitrović, Slobodan, et al.
Published: (2025)

New Structures and Algorithms for Length-Constrained Expander Decompositions
by: Haeupler, Bernhard, et al.
Published: (2024)

Fantastic Flips and Where to Find Them: A General Framework for Parameterized Local Search on Partitioning Problems
by: Grüttemeier, Niels, et al.
Published: (2025)

New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions
by: Jain, Sanjay, et al.
Published: (2026)