Imagen de Portada

Dynamic Range Minimum Queries on the Ultra-Wide Word RAM

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bille, Philip, Gørtz, Inge Li, Stordalen, Tord, López, Máximo Pérez
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Succinct Data Structures for Segments
por: Bille, Philip, et al.
Publicado: (2024)

Improved Extended Regular Expression Matching
por: Bille, Philip, et al.
Publicado: (2025)

Fast Practical Compression of Deterministic Finite Automata
por: Bille, Philip, et al.
Publicado: (2023)

String Indexing with Compressed Patterns
por: Bille, Philip, et al.
Publicado: (2019)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
por: Bille, Philip, et al.
Publicado: (2022)

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

Differentially Private Substring and Document Counting with Near-Optimal Error
por: Bernardini, Giulia, et al.
Publicado: (2024)

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

The Fine-Grained Complexity of Episode Matching
por: Bille, Philip, et al.
Publicado: (2021)

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

Fast and Compact Graph Cuts for the Boykov-Kolmogorov Algorithm
por: Mikkelstrup, Christian Møller, et al.
Publicado: (2026)

Encodings for Range Minimum Queries over Bounded Alphabets
por: Jo, Seungbum, et al.
Publicado: (2026)

Dynamic Indexing Through Learned Indices with Worst-case Guarantees
por: Gæde, Emil Toftegaard, et al.
Publicado: (2025)

Quantum Data Structure for Range Minimum Query
por: Wang, Qisheng, et al.
Publicado: (2026)

On the Hardness Hierarchy for the $O(n \sqrt{\log n})$ Complexity in the Word RAM
por: Kempa, Dominik, et al.
Publicado: (2025)

How many users have been here for a long time? Efficient solutions for counting long aggregated visits
por: Afshani, Peyman, et al.
Publicado: (2026)

Size-constrained Weighted Ancestors with Applications
por: Bille, Philip, et al.
Publicado: (2023)

Minimum $s$--$t$ Cuts with Fewer Cut Queries
por: Jiang, Yonggang, et al.
Publicado: (2025)

Sorted Range Reporting and Range Minima Queries
por: Akram, Waseem, et al.
Publicado: (2021)

Computing k-mers in Graphs
por: Alanko, Jarno N., et al.
Publicado: (2025)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Fine-Grained Dichotomies for Conjunctive Queries with Minimum or Maximum
por: Carmeli, Nofar, et al.
Publicado: (2025)

All-Pairs Minimum Cut using $\tilde{O}(n^{7/4})$ Cut Queries
por: Kenneth-Mordoch, Yotam, et al.
Publicado: (2025)

GTA -- An ATSP Method: Shifting the Bottleneck from Algorithm to RAM
por: Nakhle, Wissam
Publicado: (2025)

Towards Efficient Data Structures for Approximate Search with Range Queries
por: Kian, Ladan, et al.
Publicado: (2026)

Range (Rényi) Entropy Queries and Partitioning
por: Esmailpour, Aryan, et al.
Publicado: (2023)

Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation
por: El-Hayek, Antoine, et al.
Publicado: (2024)

GPU-RMQ: Accelerating Range Minimum Queries on Modern GPUs
por: Kreis, Lara, et al.
Publicado: (2026)

Fast Leaf-to-Ancestor Minimum Query in the Oracle Model
por: Upirvitskiy, Aleksey, et al.
Publicado: (2026)

V-Words, Lyndon Words and Galois Words
por: Daykin, Jacqueline W., et al.
Publicado: (2024)

Grafite: Taming Adversarial Queries with Optimal Range Filters
por: Costa, Marco, et al.
Publicado: (2023)

Toward Greener Matrix Operations by Lossless Compressed Formats
por: Tosoni, Francesco, et al.
Publicado: (2024)

A Simpler Approach for Monotone Parametric Minimum Cut: Finding the Breakpoints in Order
por: Beines, Arne, et al.
Publicado: (2024)

Explaining the Inherent Tradeoffs for Suffix Array Functionality: Equivalences between String Problems and Prefix Range Queries
por: Kempa, Dominik, et al.
Publicado: (2025)

Query-decision Regression between Shortest Path and Minimum Steiner Tree
por: Tong, Guangmo, et al.
Publicado: (2024)

Approximate Graph Propagation Revisited: Dynamic Parameterized Queries, Tighter Bounds and Dynamic Updates
por: Zhao, Zhuowei, et al.
Publicado: (2025)

Dynamic $((1+ε)\ln n)$-Approximation Algorithms for Minimum Set Cover and Dominating Set
por: Solomon, Shay, et al.
Publicado: (2023)

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

Deterministic Near-Linear Time Minimum Cut in Weighted Graphs
por: Henzinger, Monika, et al.
Publicado: (2024)

Data Structures for Range Sorted Consecutive Occurrence Queries
por: Akram, Waseem, et al.
Publicado: (2024)