An Algorithm for Finding Best Matches in Logarithmic Expected Time

Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977). An Algorithm for Finding Best Matches in Logarithmic Expected Time. ACM Transactions on Mathematical Software, 209-226.

Type

Journal article

Intellectual base

Primary research

Year

1977

Pages

209-226

DOI

10.1145/355744.355745

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/355744.355745

Cited by

1 citation across 1 artifact.

Domain-specific

• K-d Tree
  • Average-query claims require these construction, query and dimension conditions.

Verification

Does it exist? Not checked yet. This work's DOI is recorded above but has not been resolved against an external catalogue, so nothing here confirms the work exists.

Does it back the claim? Not recorded. The single citation of this work carries no recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:d6dc143a0750 · see in the full table