Image de couverture de livre

Longest Common Extension of a Dynamic String in Parallel Constant Time

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Albert, Daniel
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dynamic Longest Common Substring in Polylogarithmic Time
par: Charalampopoulos, Panagiotis, et autres
Publié: (2020)

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
par: Li, Rao
Publié: (2024)

Longest Common Extensions with Wildcards: Trade-off and Applications
par: Bathie, Gabriel, et autres
Publié: (2024)

Faster Algorithms for Longest Common Substring
par: Charalampopoulos, Panagiotis, et autres
Publié: (2021)

Longest Unbordered Factors on Run-Length Encoded Strings
par: Sekizaki, Shoma, et autres
Publié: (2025)

Improved Lower Bounds on the Expected Length of Longest Common Subsequences
par: Heineman, George T., et autres
Publié: (2024)

The Longest Common Bitonic Subsequence: A Match-Sensitive Dynamic Programming Approach
par: Rahat, Md. Tanzeem, et autres
Publié: (2025)

Finding Diverse Strings and Longest Common Subsequences in a Graph
par: Shida, Yuto, et autres
Publié: (2024)

Deterministic Longest Common Subsequence Approximation in Near-Linear Time
par: Boneh, Itai, et autres
Publié: (2025)

Parallel Batch-Dynamic Algorithms for Spanners, and Extensions
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Range Longest Increasing Subsequence and its Relatives
par: S., Karthik C., et autres
Publié: (2024)

Minimizers in Semi-Dynamic Strings
par: Zuba, Wiktor, et autres
Publié: (2025)

Computing String Covers in Sublinear Time
par: Radoszewski, Jakub, et autres
Publié: (2024)

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

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
par: Cohen-Addad, Vincent, et autres
Publié: (2025)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
par: Clifford, Peter, et autres
Publié: (2026)

Time-Optimal Construction of String Synchronizing Sets
par: Ellert, Jonas, et autres
Publié: (2026)

Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
par: Dasdan, Ali
Publié: (2025)

Dynamic Deterministic Constant-Approximate Distance Oracles with $n^ε$ Worst-Case Update Time
par: Haeupler, Bernhard, et autres
Publié: (2024)

Zip-Tries: Simple Dynamic Data Structures for Strings
par: Eppstein, David, et autres
Publié: (2025)

Converting an Integer to a Decimal String in Under Two Nanoseconds
par: Gareau, Jaël Champagne, et autres
Publié: (2026)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
par: Bille, Philip, et autres
Publié: (2022)

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
par: Dai, Jiangqi, et autres
Publié: (2025)

All-Pairs Suffix-Prefix on Fully Dynamic Set of Strings
par: Kikuchi, Masaru, et autres
Publié: (2024)

Optimal Static Dictionary with Worst-Case Constant Query Time
par: Hu, Yang, et autres
Publié: (2024)

Polynomial-Time Constant-Approximation for Fair Sum-of-Radii Clustering
par: Nezhad, Sina Bagheri, et autres
Publié: (2025)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
par: Das, Debarati, et autres
Publié: (2025)

Aleph Filter: To Infinity in Constant Time
par: Dayan, Niv, et autres
Publié: (2024)

Dynamic Graph Coloring: Sequential, Parallel, and Distributed
par: Ghaffari, Mohsen, et autres
Publié: (2025)

An Algebraic Approach to the Longest Path Problem
par: Khazali, Omar Al -
Publié: (2023)

Online String Attractors
par: Whittington, Philip
Publié: (2024)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)

Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle
par: Khadiev, Kamil, et autres
Publié: (2025)

Towards Constant Time Multi-Call Rumor Spreading on Small-Set Expanders
par: Cruciani, Emilio, et autres
Publié: (2025)

Tree Embedding in High Dimensions: Dynamic and Massively Parallel
par: Goranci, Gramoz, et autres
Publié: (2025)

Parallelize Single-Site Dynamics up to Dobrushin Criterion
par: Liu, Hongyang, et autres
Publié: (2021)

A Combinatorial Characterization of Constant Mixing Time
par: Lau, Lap Chi, et autres
Publié: (2025)

Querying in Constant Expected Time with Learned Indexes
par: Croquevielle, Luis, et autres
Publié: (2024)

String Covering: A Survey
par: Mhaskar, Neerja, et autres
Publié: (2022)

Scalable Distributed String Sorting
par: Kurpicz, Florian, et autres
Publié: (2024)