Cover Image

Closed Repeats

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Kosolobov, Dmitry
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Relating Left and Right Extensions of Maximal Repeats
by: Inenaga, Shunsuke, et al.
Published: (2024)

Simplified Tight Bounds for Monotone Minimal Perfect Hashing
by: Kosolobov, Dmitry
Published: (2024)

Compressed Index with Construction in Compressed Space
by: Kosolobov, Dmitry
Published: (2026)

Efficiency of ANS Entropy Encoders
by: Kosolobov, Dmitry
Published: (2022)

Construction of Sparse Suffix Trees and LCE Indexes in Optimal Time and Space
by: Kosolobov, Dmitry, et al.
Published: (2021)

Exact (n + 2) Comparison Complexity for the N-Repeated Element Problem
by: Au, Andrew
Published: (2026)

R-enum Revisited: Speedup and Extension for Context-Sensitive Repeats and Net Frequencies
by: Kimura, Kotaro, et al.
Published: (2025)

Sketching Cuts in Graphs and Hypergraphs
by: Kogan, Dmitry, et al.
Published: (2014)

Unbreakable Decomposition in Close-to-Linear Time
by: Anand, Aditya, et al.
Published: (2024)

Efficient Algorithms to Compute Closed Substrings
by: Jain, Samkith K, et al.
Published: (2025)

Advances in Exact and Approximate Group Closeness Centrality Maximization
by: Schulz, Christian, et al.
Published: (2026)

String Indexing for Top-$k$ Close Consecutive Occurrences
by: Bille, Philip, et al.
Published: (2020)

Closing the Gap Between Directed Hopsets and Shortcut Sets
by: Bernstein, Aaron, et al.
Published: (2022)

The Complexity of Maximal/Closed Frequent Tree Mining for Bounded Height Trees
by: Komoto, Kenta, et al.
Published: (2026)

Online and Offline Algorithms for Counting Distinct Closed Factors via Sliding Suffix Trees
by: Mieno, Takuya, et al.
Published: (2024)

An improvement of degree-based hashing (DBH) graph partition method, using a novel metric
by: Mastikhina, Anna, et al.
Published: (2024)

Online Algorithms for Repeated Optimal Stopping: Balancing Baseline Guarantees and Regret
by: Harada, Tsubasa, et al.
Published: (2025)

Efficient Online Sensitivity Analysis For The Injective Bottleneck Path Problem
by: Kaymakov, Kirill V., et al.
Published: (2024)

Faster Algorithms for Sparse ILP and Hypergraph Multi-Packing/Multi-Cover Problems
by: Gribanov, Dmitry, et al.
Published: (2022)

A Complexity Analysis of the c-Closed Vertex Deletion Problem
by: Lehner, Lisa, et al.
Published: (2025)

Placing Green Bridges Optimally, with Close-Range Habitats in Sparse Graphs
by: Wallisch, Christian, et al.
Published: (2025)

Self-referential instances of the dominating set problem are irreducible
by: Zhou, Guangyan
Published: (2026)

Profit Maximization in Closed Social Networks
by: Sharma, Poonam, et al.
Published: (2026)

Repeated Descent: A Framework for Online Budget-Feasible Auctions
by: Charalampopoulos, Andreas, et al.
Published: (2026)

Provable Quantization with Randomized Hadamard Transform
by: Feng, Ying, et al.
Published: (2026)

Sampling Permutations with Cell Probes is Hard
by: Alekseev, Yaroslav, et al.
Published: (2025)

Equalizing Closeness Centralities via Edge Additions
by: Crane, Alex, et al.
Published: (2025)

Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)

Sampling Colorings Close to the Maximum Degree: Non-Markovian Coupling and Local Uniformity
by: Jain, Vishesh, et al.
Published: (2026)

Edge-Minimum Walk of Modular Length in Polynomial Time
by: Amarilli, Antoine, et al.
Published: (2024)

Concurrent Composition for Differentially Private Continual Mechanisms
by: Henzinger, Monika, et al.
Published: (2024)

Weighted Reservoir Sampling With Replacement from Data Streams
by: Meligrana, Adriano, et al.
Published: (2024)

A Comprehensive Survey of Data Reduction Rules for the Maximum Weighted Independent Set Problem
by: Großmann, Ernestine, et al.
Published: (2024)

Single-Source Regular Path Querying in Terms of Linear Algebra
by: Belyanin, Georgiy, et al.
Published: (2024)

Faster Weighted and Unweighted Tree Edit Distance and APSP Equivalence
by: Nogler, Jakob, et al.
Published: (2024)

Compressed Game Solving
by: Considine, Jeffrey
Published: (2024)

Fair Set Cover
by: Dehghankar, Mohsen, et al.
Published: (2024)

Fair and Efficient Ridesharing: A Dynamic Programming-based Relocation Approach
by: Makhdomi, Aqsa Ashraf, et al.
Published: (2024)

Correlation Clustering Beyond the Pivot Algorithm
by: Behnezhad, Soheil, et al.
Published: (2024)

A Lock-free Binary Trie
by: Ko, Jeremy
Published: (2024)