An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching

Amit Chakrabarti, Oded Regev. An Optimal Randomised Cell Probe Lower Bound for Approximate Nearest Neighbour Searching. Electronic Colloquium on Computational Complexity (ECCC), (070), 2003. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.