:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autores principales:	Chen, Jingbang, Dai, Jiangqi, Mang, Qiuyang, Shi, Qingyu, Xu, Tingqiang
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms
Acceso en línea:	https://arxiv.org/abs/2312.11873
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Constant Approximation of Arboricity in Near-Optimal Sublinear Time
por: Dai, Jiangqi, et al.
Publicado: (2025)

Scalable Algorithm for Finding Balanced Subgraphs with Tolerance in Signed Networks
por: Chen, Jingbang, et al.
Publicado: (2024)

Sandpile Prediction on Undirected Graphs
por: Chang, Ruinian, et al.
Publicado: (2023)

Pattern Masking for Dictionary Matching
por: Charalampopoulos, Panagiotis, et al.
Publicado: (2020)

Improved Circular Dictionary Matching
por: Cotumaccio, Nicola
Publicado: (2025)

Tight Bounds and Phase Transitions for Incremental and Dynamic Retrieval
por: Kuszmaul, William, et al.
Publicado: (2024)

Near-Optimal Property Testers for Pattern Matching
por: Jin, Ce, et al.
Publicado: (2025)

Optimal Static Fully Indexable Dictionaries
por: Liang, Jingxun, et al.
Publicado: (2025)

Compressed Dictionary Matching on Run-Length Encoded Strings
por: Bille, Philip, et al.
Publicado: (2025)

Near-Optimal Dynamic Rounding of Fractional Matchings in Bipartite Graphs
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

Entrywise Approximate Laplacian Solving
por: Chen, Jingbang, et al.
Publicado: (2024)

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing
por: Larsen, Kasper Green, et al.
Publicado: (2023)

On the Power of Learning-Augmented Search Trees
por: Chen, Jingbang, et al.
Publicado: (2022)

Optimal Static Dictionary with Worst-Case Constant Query Time
por: Hu, Yang, et al.
Publicado: (2024)

Internal Pattern Matching in Small Space and Applications
por: Bathie, Gabriel, et al.
Publicado: (2024)

Finding the Balance Rate of Uncertain Signed Graphs
por: Wang, Zeyu, et al.
Publicado: (2026)

Near-Optimal-Time Quantum Algorithms for Approximate Pattern Matching
por: Kociumaka, Tomasz, et al.
Publicado: (2024)

Nearly Optimal List Labeling
por: Bender, Michael A., et al.
Publicado: (2024)

Logarithmic-Time Internal Pattern Matching Queries in Compressed and Dynamic Texts
por: Duyster, Anouk, et al.
Publicado: (2025)

Sketching and Streaming for Dictionary Compression
por: Becker, Ruben, et al.
Publicado: (2023)

Near-Feasible Stable Matchings: Incentives and Optimality
por: Glitzner, Frederik
Publicado: (2026)

Parallel and Distributed Expander Decomposition: Simple, Fast, and Near-Optimal
por: Chen, Daoyuan, et al.
Publicado: (2024)

Transposition is Nearly Optimal for IID List Update
por: Coester, Christian
Publicado: (2026)

Near-Optimal Directed Low-Diameter Decompositions
por: Bringmann, Karl, et al.
Publicado: (2025)

Near-Optimal Dimension Reduction for Facility Location
por: Huang, Lingxiao, et al.
Publicado: (2024)

Near-Optimal Heaps and Dijkstra on Pointer Machines
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Nearly Optimal Bounds for Stochastic Online Sorting
por: Hu, Yang
Publicado: (2025)

Near-Optimal Minimum Cuts in Hypergraphs at Scale
por: Chhabra, Adil, et al.
Publicado: (2025)

Near-Optimal Algorithm for Directed Expander Decompositions
por: Sulser, Aurelio L., et al.
Publicado: (2024)

Nearly Optimal Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)

Optimal Rounding for Two-Stage Bipartite Matching
por: Pollner, Tristan, et al.
Publicado: (2025)

A Near-Optimal Kernel for a Coloring Problem
por: Haviv, Ishay, et al.
Publicado: (2025)

Near Optimal Dual Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)

Near-Optimal Trace Reconstruction for Mildly Separated Strings
por: Aamand, Anders, et al.
Publicado: (2024)

Deterministic $k$-Median Clustering in Near-Optimal Time
por: Costa, Martín, et al.
Publicado: (2025)

Near-Optimal Sparsifiers for Stochastic Knapsack and Assignment Problems
por: Dughmi, Shaddin, et al.
Publicado: (2025)

Near-Optimal Bayesian Online Assortment of Reusable Resources
por: Feng, Yiding, et al.
Publicado: (2025)

Near-Optimal Fault-Tolerant Strong Connectivity Preservers
por: Hoppenworth, Gary, et al.
Publicado: (2025)

Near-Optimal Four-Cycle Counting in Graph Streams
por: Lüderssen, Sebastian, et al.
Publicado: (2026)

Compressing Dynamic Fully Indexable Dictionaries in Word-RAM
por: Domingues, Gabriel Marques
Publicado: (2026)