Amanote Research

Amanote Research

    RegisterSign In

Lower Bounds for Oblivious Near-Neighbor Search

doi 10.1137/1.9781611975994.68
Full Text
Open PDF
Abstract

Available in full text

Date

January 1, 2020

Authors
Kasper Green LarsenTal MalkinOmri WeinsteinKevin Yeo
Publisher

Society for Industrial and Applied Mathematics


Related search

Near-Neighbor Search in Pattern Distance Spaces

2005English

Near-Optimal Small-Depth Lower Bounds for Small Distance Connectivity

2016English

Tabu Search and Lower Bounds for a Combined Production–transportation Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2013English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Lower Bounds for Z-Numbers

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
2009English

Lower Bounds for Dynamic Connectivity

2004English

Partially Specified Nearest Neighbor Search

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Lower Bounds for Measurable Chromatic Numbers

Geometric and Functional Analysis
GeometryAnalysisTopology
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy