The power of nonmonotonicity in geometric searching

DOI10.1145/513400.513411zbMATH Open1414.68113OpenAlexW2038080079MaRDI QIDQ4557540FDOQ4557540

Authors: Bernard Chazelle 

Publication date: 23 November 2018

Published in: Proceedings of the eighteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/513400.513411

Recommendations

• The power of nonmonotonicity in geometric searching
• A Spectral Approach to Lower Bounds with Applications to Geometric Searching
• Lower bounds for orthogonal range searching: part II. The arithmetic model
• On range searching with semialgebraic sets
• Lower bounds for off-line range searching

zbMATH Keywords

Fourier transformrange searchingcircuit complexityspectral bounds

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (3)

• Title not available (Why is that?)
• The power of nonmonotonicity in geometric searching
• The Geometry of Generalized Binary Search

This page was built for publication: The power of nonmonotonicity in geometric searching

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4557540)