Imagen de Portada

Dynamic Indexing Through Learned Indices with Worst-case Guarantees

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gæde, Emil Toftegaard, van der Hoog, Ivor, Rotenberg, Eva, Stordalen, Tord
Formato:	Preprint
Publicado:	2025
Materias:	Computational Geometry Data Structures and Algorithms E.1; D.2; F.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Presort Hierarchy for Geometric Problems
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Engineering Fully Dynamic Convex Hulls
por: van der Hoog, Ivor, et al.
Publicado: (2026)

Tight Universal Bounds for Partially Presorted Pareto Front and Convex Hull
por: van der Hoog, Ivor, et al.
Publicado: (2025)

On computing the (exact) Fréchet distance with a frog
por: Conradi, Jacobus, et al.
Publicado: (2025)

Data Structures for Approximate Discrete Fréchet Distance
por: van der Hoog, Ivor, et al.
Publicado: (2022)

Tight Better-Than-Worst-Case Bounds for Element Distinctness and Set Intersection
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Near-tight Bounds for Computing the Fréchet Distance in d-Dimensional Grid Graphs and the Implications for λ-low Dense Curves
por: Conradi, Jacobus, et al.
Publicado: (2026)

Efficient Greedy Discrete Subtrajectory Clustering
por: van der Hoog, Ivor, et al.
Publicado: (2025)

The Contiguous Art Gallery Problem is in Θ(n log n)
por: de Berg, Sarita, et al.
Publicado: (2025)

A dynamic $(1+\varepsilon)$-spanner for disk intersection graphs
por: de Berg, Sarita, et al.
Publicado: (2026)

Simpler Optimal Sorting from a Directed Acyclic Graph
por: van der Hoog, Ivor, et al.
Publicado: (2024)

Simpler Universally Optimal Dijkstra
por: van der Hoog, Ivor, et al.
Publicado: (2025)

Structure and Independence in Hyperbolic Uniform Disk Graphs
por: Bläsius, Thomas, et al.
Publicado: (2024)

Instance and Universally Optimal Bounds for Imprecise Pareto Fronts
por: de Berg, Sarita, et al.
Publicado: (2026)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
por: Bushnell, Brian
Publicado: (2026)

static_maps: consteval std::map and std::unordered_map Implementations in C++23
por: Myhal, Isaac D., et al.
Publicado: (2026)

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

The Chonkers Algorithm: Content-Defined Chunking with Provable Strict Guarantees on Size and Locality
por: Berger, Benjamin
Publicado: (2025)

The Voronoi Diagram of Weakly Smooth Planar Point Sets in $O(\log n)$ Deterministic Rounds on the Congested Clique
por: Jansson, Jesper, et al.
Publicado: (2024)

Better Algorithms for Constructing Minimum Cost Markov Chains and AIFV Codes
por: Dolatabadi, Reza Hosseini, et al.
Publicado: (2024)

Optimal Preprocessing for Answering On-Line Product Queries
por: Alon, Noga, et al.
Publicado: (2024)

Engineering Practical Succinct Bit Vectors: A Space-Time Pareto Analysis on Apple Silicon ARM64 Cores
por: Garg, Ishant
Publicado: (2026)

Bottom-up Rebalancing Binary Search Trees by Flipping a Coin
por: Brodal, Gerth Stølting
Publicado: (2024)

Towards a Unified Theory of Light Spanners I: Fast (Yet Optimal) Constructions
por: Le, Hung, et al.
Publicado: (2021)

Smallest Enclosing Disk Queries Using Farthest-Point Voronoi Diagrams
por: Buchin, Kevin, et al.
Publicado: (2026)

Maximum Polygon Packing: The CG:SHOP Challenge 2024
por: Fekete, Sándor P., et al.
Publicado: (2024)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025
por: Fekete, Sándor P., et al.
Publicado: (2025)

Optimal Window Queries on Line Segments using the Trapezoidal Search DAG
por: Brankovic, Milutin, et al.
Publicado: (2021)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

Online Maximum Independent Set of Hyperrectangles
por: Advani, Rishi, et al.
Publicado: (2023)

Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
por: Grandoni, Fabrizio, et al.
Publicado: (2024)

Approximating Multiplicatively Weighted Voronoi Diagrams: Efficient Construction with Linear Size
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
por: Deligkas, Argyrios, et al.
Publicado: (2026)

Guarding Polyominoes Under $k$-Hop Visibility
por: Filtser, Omrit, et al.
Publicado: (2023)

Sliding Squares in Parallel
por: Akitaya, Hugo A., et al.
Publicado: (2024)

A Tail Estimate with Exponential Decay for the Randomized Incremental Construction of Search Structures
por: Gudmundsson, Joachim, et al.
Publicado: (2021)

Guarding Offices with Maximum Dispersion
por: Fekete, Sándor P., et al.
Publicado: (2025)

A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
por: Gálvez, Waldo, et al.
Publicado: (2025)

Central Triangulation under Parallel Flip Operations: The CG:SHOP Challenge 2026
por: Aichholzer, Oswin, et al.
Publicado: (2026)

A Framework for Algorithm Stability
por: Meulemans, Wouter, et al.
Publicado: (2017)