scientific article; zbMATH DE number 7376009
From MaRDI portal
DOI10.4230/LIPIcs.ICALP.2018.82zbMath1499.68080arXiv1804.08237MaRDI QIDQ5002761
Shay Moran, Shachar Lovett, Daniel M. Kane
Publication date: 28 July 2021
Full work available at URL: https://arxiv.org/abs/1804.08237
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items
A nearly quadratic bound for point-location in hyperplane arrangements, in the linear decision tree model, Decomposing arrangements of hyperplanes: VC-dimension, combinatorial dimension, and point location, Unnamed Item
Cites Work
- Unnamed Item
- Point location in arrangements of hyperplanes
- User-friendly tail bounds for sums of random matrices
- On a reverse form of the Brascamp-Lieb inequality
- How good is the information theory bound in sorting?
- A linear lower bound on the unbounded error probabilistic communication complexity.
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
- A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
