Balancing Two-Dimensional Straight-Line Programs
Fuente:
arXiv
Saved in:
| Main Authors: | Boneh, Itai, Gabory, Estéban, Gawrychowski, Paweł, Górkiewicz, Adam |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Better Indexing for Rectangular Pattern Matching
by: Gawrychowski, Paweł, et al.
Published: (2025)
by: Gawrychowski, Paweł, et al.
Published: (2025)
Faster two-dimensional pattern matching with $k$ mismatches
by: Ellert, Jonas, et al.
Published: (2024)
by: Ellert, Jonas, et al.
Published: (2024)
Faster ED-String Matching with $k$ Mismatches
by: Gawrychowski, Paweł, et al.
Published: (2025)
by: Gawrychowski, Paweł, et al.
Published: (2025)
On Incremental Approximate Shortest Paths in Directed Graphs
by: Górkiewicz, Adam, et al.
Published: (2025)
by: Górkiewicz, Adam, et al.
Published: (2025)
Iterated Straight-Line Programs
by: Navarro, Gonzalo, et al.
Published: (2024)
by: Navarro, Gonzalo, et al.
Published: (2024)
Generalized Straight-Line Programs
by: Navarro, Gonzalo, et al.
Published: (2024)
by: Navarro, Gonzalo, et al.
Published: (2024)
Enumerating All Directed Spanning Trees in Optimal Time
by: Gawrychowski, Paweł, et al.
Published: (2026)
by: Gawrychowski, Paweł, et al.
Published: (2026)
Optimal Distance Labeling for Permutation Graphs
by: Gawrychowski, Paweł, et al.
Published: (2024)
by: Gawrychowski, Paweł, et al.
Published: (2024)
The Complexity of Dynamic LZ77 is $\tildeΘ(n^{2/3})$
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
Bounded Weighted Edit Distance: Dynamic Algorithms and Matching Lower Bounds
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
Core-Sparse Monge Matrix Multiplication: Improved Algorithm and Applications
by: Gawrychowski, Paweł, et al.
Published: (2024)
by: Gawrychowski, Paweł, et al.
Published: (2024)
Dynamic Longest Common Substring in Polylogarithmic Time
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)
by: Charalampopoulos, Panagiotis, et al.
Published: (2020)
Enumerating m-Length Walks in Directed Graphs with Constant Delay
by: Adamson, Duncan, et al.
Published: (2024)
by: Adamson, Duncan, et al.
Published: (2024)
Equivalences between Non-trivial Variants of 3LDT and Conv3LDT
by: Dudek, Bartłomiej, et al.
Published: (2020)
by: Dudek, Bartłomiej, et al.
Published: (2020)
Finding perfect matchings in bridgeless cubic multigraphs without dynamic (2-)connectivity
by: Gawrychowski, Paweł, et al.
Published: (2024)
by: Gawrychowski, Paweł, et al.
Published: (2024)
Hamming Distance Oracle
by: Boneh, Itai, et al.
Published: (2024)
by: Boneh, Itai, et al.
Published: (2024)
Optimal Bounds for Distinct Quartics
by: Charalampopoulos, Panagiotis, et al.
Published: (2024)
by: Charalampopoulos, Panagiotis, et al.
Published: (2024)
Faster Construction of a Planar Distance Oracle with Õ(1) Query Time
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
Longest Common Extensions with Wildcards: Trade-off and Applications
by: Bathie, Gabriel, et al.
Published: (2024)
by: Bathie, Gabriel, et al.
Published: (2024)
Deterministic Longest Common Subsequence Approximation in Near-Linear Time
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
Searching 2D-Strings for Matching Frames
by: Boneh, Itai, et al.
Published: (2023)
by: Boneh, Itai, et al.
Published: (2023)
Suffix Random Access via Function Inversion: A Key for Asymmetric Streaming String Algorithms
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)
by: Charalampopoulos, Panagiotis, et al.
Published: (2026)
String Consensus Problems with Swaps and Substitutions
by: Gabory, Estéban, et al.
Published: (2025)
by: Gabory, Estéban, et al.
Published: (2025)
On Planar Straight-Line Dominance Drawings
by: Angelini, Patrizio, et al.
Published: (2025)
by: Angelini, Patrizio, et al.
Published: (2025)
Space-Efficient Indexes for Uncertain Strings
by: Gabory, Esteban, et al.
Published: (2024)
by: Gabory, Esteban, et al.
Published: (2024)
Generalized De Bruijn Words, Invertible Necklaces, and the Burrows-Wheeler Transform
by: Fici, Gabriele, et al.
Published: (2025)
by: Fici, Gabriele, et al.
Published: (2025)
Elastic-Degenerate String Comparison
by: Gabory, Esteban, et al.
Published: (2024)
by: Gabory, Esteban, et al.
Published: (2024)
String 2-Covers with No Length Restrictions
by: Boneh, Itai, et al.
Published: (2024)
by: Boneh, Itai, et al.
Published: (2024)
Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
by: Gawrychowski, Pawel, et al.
Published: (2024)
by: Gawrychowski, Pawel, et al.
Published: (2024)
Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
by: Boneh, Itai, et al.
Published: (2025)
by: Boneh, Itai, et al.
Published: (2025)
Approximating the shortest path problem with scenarios
by: Kasperski, Adam, et al.
Published: (2018)
by: Kasperski, Adam, et al.
Published: (2018)
Hairpin Completion Distance Lower Bound
by: Boneh, Itai, et al.
Published: (2024)
by: Boneh, Itai, et al.
Published: (2024)
Improved Time-Space Tradeoffs for 3SUM-Indexing
by: Dinur, Itai, et al.
Published: (2025)
by: Dinur, Itai, et al.
Published: (2025)
Improved Online Load Balancing in the Two-Norm
by: Borst, Sander, et al.
Published: (2025)
by: Borst, Sander, et al.
Published: (2025)
Recoverable robust shortest path problem under interval budgeted uncertainty representations
by: Jackiewicz, Marcel, et al.
Published: (2024)
by: Jackiewicz, Marcel, et al.
Published: (2024)
Unclustered BWTs of any Length over Non-Binary Alphabets
by: Fici, Gabriele, et al.
Published: (2025)
by: Fici, Gabriele, et al.
Published: (2025)
Balancing the Spread of Two Opinions in Sparse Social Networks
by: Knop, Dušan, et al.
Published: (2021)
by: Knop, Dušan, et al.
Published: (2021)
Generalization of Repetitiveness Measures for Two-Dimensional Strings
by: Carfagna, Lorenzo, et al.
Published: (2025)
by: Carfagna, Lorenzo, et al.
Published: (2025)
Even Faster Knapsack via Rectangular Monotone Min-Plus Convolution and Balancing
by: Bringmann, Karl, et al.
Published: (2024)
by: Bringmann, Karl, et al.
Published: (2024)
Characterizing and Testing Configuration Stability in Two-Dimensional Threshold Cellular Automata
by: Nakar, Yonatan, et al.
Published: (2025)
by: Nakar, Yonatan, et al.
Published: (2025)
Similar Items
-
Better Indexing for Rectangular Pattern Matching
by: Gawrychowski, Paweł, et al.
Published: (2025) -
Faster two-dimensional pattern matching with $k$ mismatches
by: Ellert, Jonas, et al.
Published: (2024) -
Faster ED-String Matching with $k$ Mismatches
by: Gawrychowski, Paweł, et al.
Published: (2025) -
On Incremental Approximate Shortest Paths in Directed Graphs
by: Górkiewicz, Adam, et al.
Published: (2025) -
Iterated Straight-Line Programs
by: Navarro, Gonzalo, et al.
Published: (2024)