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]

Authors

Amit Chakrabarti

This author has not been identified. Look up 'Amit Chakrabarti' in Google

Oded Regev

This author has not been identified. Look up 'Oded Regev' in Google