Lower Bounds for Oblivious Near-Neighbor Search

DOI10.1137/1.9781611975994.68OpenAlexW4211254699MaRDI QIDQ5146839

Kevin Yeo, Kasper Green Larsen, Omri Weinstein, Tal Malkin

Publication date: 2 February 2021

Published in: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1904.04828

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (3)

A logarithmic lower bound for oblivious RAM (for all Parameters) ⋮ Lower bound framework for differentially private and oblivious data structures ⋮ Limits of breach-resistant and snapshot-oblivious RAMs

This page was built for publication: Lower Bounds for Oblivious Near-Neighbor Search