Image de couverture de livre

Efficient Algorithms to Compute Closed Substrings

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Jain, Samkith K, Mhaskar, Neerja
Format:	Preprint
Publié:	2025
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

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

On the Complexity of Finding Approximate LCS of Multiple Strings
par: Hasibi, Hamed, et autres
Publié: (2025)

Practical KMP/BM Style Pattern-Matching on Indeterminate Strings
par: Dehghani, Hossein, et autres
Publié: (2022)

V-Words, Lyndon Words and Galois Words
par: Daykin, Jacqueline W., et autres
Publié: (2024)

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

Faster Algorithms for Shortest Unique or Absent Substrings
par: Charalampopoulos, Panagiotis, et autres
Publié: (2026)

Maximal Closed Substrings
par: Badkobeh, Golnaz, et autres
Publié: (2022)

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

LZ78 Substring Compression in Compressed Space
par: Shibata, Hiroki, et autres
Publié: (2025)

Counting Distinct Square Substrings in Sublinear Time
par: Charalampopoulos, Panagiotis, et autres
Publié: (2025)

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

Substring Compression Variations and LZ78-Derivates
par: Köppl, Dominik
Publié: (2024)

Fast and Optimal Differentially Private Frequent-Substring Mining
par: Guo, Peaker, et autres
Publié: (2026)

Differentially Private Substring and Document Counting with Near-Optimal Error
par: Bernardini, Giulia, et autres
Publié: (2024)

Efficient Algorithms for Personalized PageRank Computation: A Survey
par: Yang, Mingji, et autres
Publié: (2024)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
par: Chekuri, Chandra, et autres
Publié: (2024)

An Improved Algorithm for Sparse Instances of SAT
par: Jain, Sanjay, et autres
Publié: (2024)

Streaming Algorithms for Network Design
par: Chekuri, Chandra, et autres
Publié: (2025)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
par: Chekuri, Chandra, et autres
Publié: (2024)

Parameterized Algorithms for Computing Pareto Sets
par: Könen, Joshua, et autres
Publié: (2025)

Parameterized Algorithms for Computing MAD Trees
par: Breitkopf, Tom-Lukas, et autres
Publié: (2026)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
par: Mieno, Takuya, et autres
Publié: (2024)

New Algorithms for Parity-SAT and Its Bounded-Occurrence Versions
par: Jain, Sanjay, et autres
Publié: (2026)

Improved Algorithms for Effective Resistance Computation on Graphs
par: Yang, Yichun, et autres
Publié: (2025)

Beyond Worst Case Local Computation Algorithms
par: Biswas, Amartya Shankha, et autres
Publié: (2024)

Faster Algorithm for Structured John Ellipsoid Computation
par: Cao, Yang, et autres
Publié: (2022)

Efficient Parallel Algorithms for Hypergraph Matching
par: Reinstädtler, Henrik, et autres
Publié: (2026)

Lower Bounds for Non-adaptive Local Computation Algorithms
par: Azarmehr, Amir, et autres
Publié: (2025)

Streaming Graph Algorithms in the Massively Parallel Computation Model
par: Czumaj, Artur, et autres
Publié: (2025)

High Probability Work Efficient Parallel Algorithms
par: Hutton, Chase, et autres
Publié: (2026)

Efficient Algorithms and New Characterizations for CSP Sparsification
par: Khanna, Sanjeev, et autres
Publié: (2024)

Efficient Kernelization Algorithm for Bipartite Graph Matching
par: Wu, Guang, et autres
Publié: (2024)

Local Computation Algorithms for (Minimum) Spanning Trees on Expander Graphs
par: Peng, Pan, et autres
Publié: (2026)

Stochastic Matching via In-n-Out Local Computation Algorithms
par: Azarmehr, Amir, et autres
Publié: (2024)

Perfect Simulation of Las Vegas Algorithms via Local Computation
par: Fu, Xinyu, et autres
Publié: (2023)

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
par: Zhang, Guangyi, et autres
Publié: (2025)

Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
par: Wan, Zongqi, et autres
Publié: (2024)

Space-Efficient Algorithm for Integer Programming with Few Constraints
par: Rohwedder, Lars, et autres
Publié: (2024)

Algorithms for Efficient, Compact Online Data Stream Curation
par: Moreno, Matthew Andres, et autres
Publié: (2024)