Cover Image

Dorst-Smeulders Coding for Arbitrary Binary Words

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	De Luca, Alessandro, Fici, Gabriele
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Data Structures and Algorithms Formal Languages and Automata Theory Combinatorics 68R15 (Primary) 68W32 (Secondary) G.2.1; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Some Results on Digital Segments and Balanced Words
by: De Luca, Alessandro, et al.
Published: (2022)

Computing Maximal Repeating Subsequences in a String
by: Gong, Mingyang, et al.
Published: (2026)

Digital Convexity and Combinatorics on Words
by: De Luca, Alessandro, et al.
Published: (2025)

Templated Assembly Theory: An Extension of the Canonical Assembly Index with Block-Compressed Template
by: Masierak, Piotr
Published: (2026)

Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
by: Bilardi, Gianfranco, et al.
Published: (2022)

The Shortest Interesting Binary Words
by: Fici, Gabriele
Published: (2024)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
by: Zhong, Xianghui
Published: (2019)

Checking and producing word attractors
by: Béal, Marie-Pierre, et al.
Published: (2025)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
by: Buchbinder, Niv, et al.
Published: (2024)

Stringological sequence prediction I: efficient algorithms for predicting highly repetitive sequences
by: Kosoy, Vanessa
Published: (2026)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
by: Gabryelski, Wojciech, et al.
Published: (2026)

Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)

Bicriteria Submodular Maximization
by: Feldman, Moran, et al.
Published: (2025)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
by: Date, Vinicius T. V., et al.
Published: (2025)

Adjacency Labeling Schemes for Small Classes
by: Bonnet, Édouard, et al.
Published: (2024)

Words with factor complexity $2n+1$ and minimal critical exponent
by: Currie, James D.
Published: (2025)

Searching in trees with monotonic query times
by: Dereniowski, Dariusz, et al.
Published: (2024)

Unclustered BWTs of any Length over Non-Binary Alphabets
by: Fici, Gabriele, et al.
Published: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
by: Hougardy, Stefan, et al.
Published: (2025)

From Historical Puzzles to Grammatical Constraints: Circular Partitions, Generalized Run-Length Encodings, and Polynomial-Time Decidability
by: Khormali, Omid, et al.
Published: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
by: Buchbinder, Niv, et al.
Published: (2024)

Pliability and Approximating Max-CSPs
by: Romero, Miguel, et al.
Published: (2019)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
by: Michel, Stefan
Published: (2025)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
by: Rockel-Wolff, Benjamin
Published: (2024)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
by: Feldman, Moran, et al.
Published: (2025)

Probabilistic Analysis of Edge Elimination for Euclidean TSP
by: Zhong, Xianghui
Published: (2018)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
by: Sopp, Braeden, et al.
Published: (2026)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

Grammar-Constrained (CFL) Reachability: Subcubic Preprocessing, Indexing Trade-offs, and Structured Decoding Semantics
by: Alpay, Faruk, et al.
Published: (2026)

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

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
by: Heimann, Sophia, et al.
Published: (2025)

String 2-Covers with No Length Restrictions
by: Boneh, Itai, et al.
Published: (2024)

Hairpin Completion Distance Lower Bound
by: Boneh, Itai, et al.
Published: (2024)

Maximizing Diversity in (near-)Median String Selection
by: Chakraborty, Diptarka, et al.
Published: (2026)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
by: Crochemore, Maxime, et al.
Published: (2025)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)