"On the I/O complexity of the k-nearest neighbor problem."

Mayank Goswami, Riko Jacob, Rasmus Pagh (2020)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2020-09-28

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-2002-04870
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2002-04870
Mayank Goswami, Riko Jacob, Rasmus Pagh:
On the I/O complexity of the k-nearest neighbor problem. CoRR abs/2002.04870 (2020)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.