Cover Image

Optimal Preprocessing for Answering On-Line Product Queries

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alon, Noga, Schieber, Baruch
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms F.2.2; E.1
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

Approximation Algorithms for Action-Reward Query-Commit Matching
by: Derakhshan, Mahsa, et al.
Published: (2026)

Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
by: Lindermayr, Alexander, et al.
Published: (2025)

Connected Components in Linear Work and Near-Optimal Time
by: Farhadi, Alireza, et al.
Published: (2023)

Line Cover and Related Problems
by: Bentert, Matthias, et al.
Published: (2025)

Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)

On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)

Parameterized Algorithms on Integer Sets with Small Doubling: Integer Programming, Subset Sum and k-SUM
by: Randolph, Tim, et al.
Published: (2024)

Beating Meet-in-the-Middle for Subset Balancing Problems
by: Randolph, Tim, et al.
Published: (2025)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
by: Haeupler, Bernhard, et al.
Published: (2024)

An Efficient Algorithm for Unbalanced 1D Transportation
by: Gouvine, Gabriel
Published: (2023)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
by: Haeupler, Bernhard, et al.
Published: (2023)

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

Multiplication of 0-1 matrices via clustering
by: Jansson, Jesper, et al.
Published: (2025)

Fast approximate $\ell$-center clustering in high dimensional spaces
by: Kowaluk, Mirosław, et al.
Published: (2025)

Fine-Grained Optimality of Partially Dynamic Shortest Paths and More
by: Saha, Barna, et al.
Published: (2024)

DynamicLogLog: Faster, Smaller, and More Accurate Cardinality Estimation
by: Bushnell, Brian
Published: (2026)

A Heuristic for Direct Product Graph Decomposition
by: Calderoni, Luca, et al.
Published: (2021)

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

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
by: Bläsius, Thomas, et al.
Published: (2024)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
by: Gillman, David, et al.
Published: (2025)

Sublime: Sublinear Error & Space for Unbounded Skewed Streams
by: Eslami, Navid, et al.
Published: (2026)

On the structure of normalized models of circular-arc graphs -- Hsu's approach revisited
by: Krawczyk, Tomasz
Published: (2024)

Online $b$-Matching with Stochastic Rewards
by: Albers, Susanne, et al.
Published: (2024)

Scheduling with Obligatory Tests
by: Dogeas, Konstantinos, et al.
Published: (2024)

Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
by: DeHaan, Ian, et al.
Published: (2024)

Revisiting Path Contraction and Cycle Contraction
by: Krithika, R., et al.
Published: (2024)

Improved Algorithms for Maximum Coverage in Dynamic and Random Order Streams
by: Chakrabarti, Amit, et al.
Published: (2024)

A faster algorithm for the construction of optimal factoring automata
by: Erlebach, Thomas, et al.
Published: (2024)

Online Combinatorial Optimization with Graphical Dependencies
by: Gao, Zhimeng, et al.
Published: (2025)

Offline green bin packing and its constrained variant
by: Gong, Mingyang, et al.
Published: (2026)

Exploiting Low Scanwidth to Resolve Soft Polytomies
by: Bruchhold, Sebastian, et al.
Published: (2025)

A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
by: Awofeso, Christine, et al.
Published: (2025)

Online computation of normalized substring complexity
by: Kucherov, Gregory, et al.
Published: (2025)

Approximation algorithms for scheduling with rejection in green manufacturing
by: Gong, Mingyang, et al.
Published: (2025)

The cost of cyclic permutations and remainder sums in the Euclidean algorithm
by: Blomer, Valentin, et al.
Published: (2026)