Image de couverture de livre

Nearly Optimal Internal Dictionary Matching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chen, Jingbang, Dai, Jiangqi, Mang, Qiuyang, Shi, Qingyu, Xu, Tingqiang
Format:	Preprint
Publié:	2023
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

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

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
par: Chen, Jingbang, et autres
Publié: (2024)

Sandpile Prediction on Undirected Graphs
par: Chang, Ruinian, et autres
Publié: (2023)

Pattern Masking for Dictionary Matching
par: Charalampopoulos, Panagiotis, et autres
Publié: (2020)

Improved Circular Dictionary Matching
par: Cotumaccio, Nicola
Publié: (2025)

Near-Optimal Property Testers for Pattern Matching
par: Jin, Ce, et autres
Publié: (2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
par: Kuszmaul, William, et autres
Publié: (2024)

Optimal Static Fully Indexable Dictionaries
par: Liang, Jingxun, et autres
Publié: (2025)

Compressed Dictionary Matching on Run-Length Encoded Strings
par: Bille, Philip, et autres
Publié: (2025)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
par: Bhattacharya, Sayan, et autres
Publié: (2023)

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
par: Larsen, Kasper Green, et autres
Publié: (2023)

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

Entrywise Approximate Laplacian Solving
par: Chen, Jingbang, et autres
Publié: (2024)

Internal Pattern Matching in Small Space and Applications
par: Bathie, Gabriel, et autres
Publié: (2024)

On the Power of Learning-Augmented Search Trees
par: Chen, Jingbang, et autres
Publié: (2022)

Finding the Balance Rate of Uncertain Signed Graphs
par: Wang, Zeyu, et autres
Publié: (2026)

Nearly Optimal List Labeling
par: Bender, Michael A., et autres
Publié: (2024)

Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching
par: Kociumaka, Tomasz, et autres
Publié: (2024)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
par: Duyster, Anouk, et autres
Publié: (2025)

Sketching and Streaming for Dictionary Compression
par: Becker, Ruben, et autres
Publié: (2023)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
par: Chen, Daoyuan, et autres
Publié: (2024)

Transposition is Nearly Optimal for IID List Update
par: Coester, Christian
Publié: (2026)

Near-Optimal Directed Low-Diameter Decompositions
par: Bringmann, Karl, et autres
Publié: (2025)

Near-Optimal Dimension Reduction for Facility Location
par: Huang, Lingxiao, et autres
Publié: (2024)

Near-Optimal Heaps and Dijkstra on Pointer Machines
par: van der Hoog, Ivor, et autres
Publié: (2026)

Nearly Optimal Bounds for Stochastic Online Sorting
par: Hu, Yang
Publié: (2025)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
par: Chhabra, Adil, et autres
Publié: (2025)

Near-Optimal Algorithm for Directed Expander Decompositions
par: Sulser, Aurelio L., et autres
Publié: (2024)

Nearly Optimal Fault Tolerant Distance Oracle
par: Dey, Dipan, et autres
Publié: (2024)

Optimal Rounding for Two-Stage Bipartite Matching
par: Pollner, Tristan, et autres
Publié: (2025)

A Near-Optimal Kernel for a Coloring Problem
par: Haviv, Ishay, et autres
Publié: (2025)

Near Optimal Dual Fault Tolerant Distance Oracle
par: Dey, Dipan, et autres
Publié: (2024)

Near-Optimal Trace Reconstruction for Mildly Separated Strings
par: Aamand, Anders, et autres
Publié: (2024)

Deterministic $k$-Median Clustering in Near-Optimal Time
par: Costa, Martín, et autres
Publié: (2025)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
par: Dughmi, Shaddin, et autres
Publié: (2025)

Near-Optimal Bayesian Online Assortment of Reusable Resources
par: Feng, Yiding, et autres
Publié: (2025)

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
par: Hoppenworth, Gary, et autres
Publié: (2025)

Near-Optimal Four-Cycle Counting in Graph Streams
par: Lüderssen, Sebastian, et autres
Publié: (2026)

Ultra-Resilient Superimposed Codes: Near-Optimal Construction and Applications
par: De Marco, Gianluca, et autres
Publié: (2025)

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
par: Bhanja, Koustav, et autres
Publié: (2025)