Learning Partition Trees for Nearest Neighbor Search | Paper Citation Record

Observation 395bfaa2-fe3e-46bd-b279-382e93831838 · outbound

This paper cites High-Dimensional Computational Geometry , url =.

Learning Partition Trees for Nearest Neighbor Search High-Dimensional Computational Geometry , url =

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d6be6f1-5fc5-4560-b9c7-cae1715eae83 · outbound

This paper cites 2021 , date-added =.

Learning Partition Trees for Nearest Neighbor Search 2021 , date-added =

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 470b2107-3d72-4828-91d3-ad60b0de6b63 · outbound

This paper cites Extremum problems with inequalities as subsidiary conditions , year =.

Learning Partition Trees for Nearest Neighbor Search Extremum problems with inequalities as subsidiary conditions , year =

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 545559a5-6f2b-40f0-a8c1-b14c97c86042 · outbound

This paper cites Spectral Approaches to Nearest Neighbor Search , year =.

Learning Partition Trees for Nearest Neighbor Search Spectral Approaches to Nearest Neighbor Search , year =

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d44f945-9828-4566-a5a4-dec079c6bdaa · outbound

This paper cites A Directed Isoperimetric Inequality with application to.

Learning Partition Trees for Nearest Neighbor Search A Directed Isoperimetric Inequality with application to

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4ba99ca6-29f2-4d62-826b-224c7a445dd7 · outbound

This paper cites Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality , year =.

Learning Partition Trees for Nearest Neighbor Search Approximate Bregman near neighbors in sublinear time: beyond the triangle inequality , year =

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 084447f8-cc96-4b6d-9798-b59485734153 · outbound

This paper cites Ahle and Rasmus Pagh and Ilya Razenshteyn and Francesco Silvestri , booktitle = PODS2016, note =.

Learning Partition Trees for Nearest Neighbor Search Ahle and Rasmus Pagh and Ilya Razenshteyn and Francesco Silvestri , booktitle = PODS2016, note =

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 146e19cc-69be-40fe-8141-5fc0c4a27e53 · outbound

This paper cites The Fast.

Learning Partition Trees for Nearest Neighbor Search The Fast

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8f7c313d-5446-4e67-b694-90c28cd88a4c · outbound

This paper cites Fast and.

Learning Partition Trees for Nearest Neighbor Search Fast and

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a83c27e8-4415-44ba-acde-22ff0c676fa2 · outbound

This paper cites Restricted Isometry Property for General p-Norms , year =.

Learning Partition Trees for Nearest Neighbor Search Restricted Isometry Property for General p-Norms , year =

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 30443621-e984-4f84-9ff3-3b1050bbd0f0 · outbound

This paper cites Exploiting the Structure: Stochastic Gradient Methods Using Raw Clusters , year =.

Learning Partition Trees for Nearest Neighbor Search Exploiting the Structure: Stochastic Gradient Methods Using Raw Clusters , year =

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ea3b442-8f20-4b56-b146-c060f595621e · outbound

This paper cites Chan and Ryan Williams , booktitle = FOCS2016, pages =.

Learning Partition Trees for Nearest Neighbor Search Chan and Ryan Williams , booktitle = FOCS2016, pages =

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f12674c9-ab9a-4006-ba65-caf31e16a7ad · outbound

This paper cites Nearest Neighbor Search: the Old, the New, and the Impossible , year =.

Learning Partition Trees for Nearest Neighbor Search Nearest Neighbor Search: the Old, the New, and the Impossible , year =

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 82ea6162-65ad-4487-99f2-d1ac201e42e0 · outbound

This paper cites Hardness of Nearest Neighbor under.

Learning Partition Trees for Nearest Neighbor Search Hardness of Nearest Neighbor under

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d3854150-9382-450d-8480-35990f0e7a5a · outbound

This paper cites Mirrokni , booktitle =.

Learning Partition Trees for Nearest Neighbor Search Mirrokni , booktitle =

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9cb554fc-bd8d-4f63-8a87-601218d2d29b · outbound

This paper cites Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions , volume =.

Learning Partition Trees for Nearest Neighbor Search Near-optimal hashing algorithms for approximate nearest neighbor in high dimensions , volume =

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6b367b6b-87b3-4d21-92e2-75388ad8d17e · outbound

This paper cites Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , year =.

Learning Partition Trees for Nearest Neighbor Search Near-Optimal Hashing Algorithms for Approximate Nearest Neighbor in High Dimensions , year =

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c17b607-7901-4dae-9b02-b49661189077 · outbound

This paper cites an unresolved cited work.

Learning Partition Trees for Nearest Neighbor Search Unresolved cited work

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5c471446-c1ee-4803-9a26-2ea51ae50308 · outbound

This paper cites Practical and Optimal.

Learning Partition Trees for Nearest Neighbor Search Practical and Optimal

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b1134327-064e-4be7-b0fa-3b874ddd02aa · outbound

This paper cites 2025 , booktitle =.

Learning Partition Trees for Nearest Neighbor Search 2025 , booktitle =

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation da257d07-9e37-48a5-bfef-10a5a2c0d963 · outbound

This paper cites SIAM Journal on Computing , volume =.

Learning Partition Trees for Nearest Neighbor Search SIAM Journal on Computing , volume =

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0c3640b8-4cd1-4f73-8b92-d2233bacd7e1 · outbound

This paper cites Nguyen and Ilya Razenshteyn , booktitle = SODA2014, pages =.

Learning Partition Trees for Nearest Neighbor Search Nguyen and Ilya Razenshteyn , booktitle = SODA2014, pages =

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19288f64-dff9-4a20-907d-a15e47b6801c · outbound

This paper cites On the Optimality of the Dimensionality Reduction Method , year =.

Learning Partition Trees for Nearest Neighbor Search On the Optimality of the Dimensionality Reduction Method , year =

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 15bfd4de-bcb0-462d-b8ea-d7005b5b2966 · outbound

This paper cites Sketching and Embedding are Equivalent for Norms , year =.

Learning Partition Trees for Nearest Neighbor Search Sketching and Embedding are Equivalent for Norms , year =

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2be63796-fd89-4ff3-822e-1a9adf0a34d5 · outbound

This paper cites 34th International Symposium on Computational Geometry (SoCG 2018) , year=.

Learning Partition Trees for Nearest Neighbor Search 34th International Symposium on Computational Geometry (SoCG 2018) , year=

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b027ee0a-f8be-4f42-b707-0d04f3c94efc · outbound

This paper cites Optimal Hashing-based Time--Space Trade-offs for Approximate Near Neighbors , year =.

Learning Partition Trees for Nearest Neighbor Search Optimal Hashing-based Time--Space Trade-offs for Approximate Near Neighbors , year =

Reference 26

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dfd74880-5fc8-4191-b767-1a2ab78d8db0 · outbound

This paper cites Lower Bounds on Time--Space Trade-Offs for Approximate Near Neighbors , year =.

Learning Partition Trees for Nearest Neighbor Search Lower Bounds on Time--Space Trade-Offs for Approximate Near Neighbors , year =

Reference 27

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3716100-e4e1-44a5-8096-d7f0cf16be31 · outbound

This paper cites Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing , year =.

Learning Partition Trees for Nearest Neighbor Search Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing , year =

Reference 28

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 17ca4d92-2579-4ff6-9e16-2ec6c8ac7ef8 · outbound

This paper cites Optimal Data-Dependent Hashing for Approximate Near Neighbors , year =.

Learning Partition Trees for Nearest Neighbor Search Optimal Data-Dependent Hashing for Approximate Near Neighbors , year =

Reference 29

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a63233bc-e007-44d6-bc7a-26e64e6db200 · outbound

This paper cites an unresolved cited work.

Learning Partition Trees for Nearest Neighbor Search Unresolved cited work

Reference 30

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bcba0887-c41f-4077-9b6e-abc4fea29b05 · outbound

This paper cites Woodruff , booktitle = SODA2016, note =.

Learning Partition Trees for Nearest Neighbor Search Woodruff , booktitle = SODA2016, note =

Reference 31

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ef9233a8-5ca0-4d8f-8efd-6f46635f868a · outbound

This paper cites Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model , volume =.

Learning Partition Trees for Nearest Neighbor Search Tighter Lower Bounds for Nearest Neighbor Search and Related Problems in the Cell Probe Model , volume =

Reference 32

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b9244d1-76bb-499b-9464-c347830e5310 · outbound

This paper cites Jayram and Ravi Kumar and D.

Learning Partition Trees for Nearest Neighbor Search Jayram and Ravi Kumar and D

Reference 33

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 234e16c7-a563-42d1-bd46-d37dd24380ac · outbound

This paper cites an unresolved cited work.

Learning Partition Trees for Nearest Neighbor Search Unresolved cited work

Reference 34

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3302710-bb9e-4584-a23f-4cc239a97637 · outbound

This paper cites New directions in nearest neighbor searching with applications to lattice sieving , year =.

Learning Partition Trees for Nearest Neighbor Search New directions in nearest neighbor searching with applications to lattice sieving , year =

Reference 35

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dba95eb4-1f62-492c-887f-485a98833508 · outbound

This paper cites A neural probabilistic language model , volume =.

Learning Partition Trees for Nearest Neighbor Search A neural probabilistic language model , volume =

Reference 36

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 317d248a-8313-4d5d-a257-0fd32f2626d7 · outbound

This paper cites Multidimensional binary search trees used for associative searching , volume =.

Learning Partition Trees for Nearest Neighbor Search Multidimensional binary search trees used for associative searching , volume =

Reference 37

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6814f314-642e-43be-918e-dd2d898841b3 · outbound

This paper cites Computational Geometry: Algorithms and Applications , year =.

Learning Partition Trees for Nearest Neighbor Search Computational Geometry: Algorithms and Applications , year =

Reference 38

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b83a59a-6835-4d22-a0bc-a310740726ce · outbound

This paper cites an unresolved cited work.

Learning Partition Trees for Nearest Neighbor Search Unresolved cited work

Reference 39

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1d019889-e4a0-4e87-9e12-8ee15575699d · outbound

This paper cites Cover trees for nearest neighbor , year =.

Learning Partition Trees for Nearest Neighbor Search Cover trees for nearest neighbor , year =

Reference 40

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce170075-05b2-4e3c-8df3-3513ca4c1bcb · outbound

This paper cites Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems , year =.

Learning Partition Trees for Nearest Neighbor Search Lower Bounds for High Dimensional Nearest Neighbor Search and Related Problems , year =

Reference 41

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fad47684-a3da-4ee2-bb3d-277d08f10b9d · outbound

This paper cites Broder , booktitle = SEQUENCES97, pages =.

Learning Partition Trees for Nearest Neighbor Search Broder , booktitle = SEQUENCES97, pages =

Reference 42

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f51eceaf-768b-4a14-9ff8-ca39e19ac312 · outbound

This paper cites Broder and Steven C.

Learning Partition Trees for Nearest Neighbor Search Broder and Steven C

Reference 43

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43967d1a-c84e-409d-b996-a54557889dd1 · outbound

This paper cites Provably Sensitive Indexing Strategies for Biosequence Similarity Search , volume =.

Learning Partition Trees for Nearest Neighbor Search Provably Sensitive Indexing Strategies for Biosequence Similarity Search , volume =

Reference 44

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3826bc3b-1145-4b70-a40d-0e7182a04265 · outbound

This paper cites Searching in metric spaces , volume =.

Learning Partition Trees for Nearest Neighbor Search Searching in metric spaces , volume =

Reference 45

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2deb77f0-6328-4e50-8486-f4cf1c418842 · outbound

This paper cites A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube , year =.

Learning Partition Trees for Nearest Neighbor Search A Lower Bound on the Complexity of Approximate Nearest-Neighbor Searching on the Hamming Cube , year =

Reference 46

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2ba0d816-b592-4df4-82bc-bb490a87a768 · outbound

This paper cites An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching , volume =.

Learning Partition Trees for Nearest Neighbor Search An Optimal Randomized Cell Probe Lower Bound for Approximate Nearest Neighbor Searching , volume =

Reference 47

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8ed3a08a-fc71-4519-82b6-473a8e1ccdc1 · outbound

This paper cites Similarity estimation techniques from rounding algorithms , year =.

Learning Partition Trees for Nearest Neighbor Search Similarity estimation techniques from rounding algorithms , year =

Reference 48

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e149f67a-3fc0-4c2e-8395-535945d6915f · outbound

This paper cites Finding Frequent Items in Data Streams , volume =.

Learning Partition Trees for Nearest Neighbor Search Finding Frequent Items in Data Streams , volume =

Reference 49

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8d463153-8640-442b-9565-bd9c8d21f3f4 · outbound

This paper cites an unresolved cited work.

Learning Partition Trees for Nearest Neighbor Search Unresolved cited work

Reference 50

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c57061d5-bf4b-43ef-99de-daa055624467 · outbound

This paper cites Clarkson , booktitle =.

Learning Partition Trees for Nearest Neighbor Search Clarkson , booktitle =

Reference 51

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 70417eb8-2b31-4d16-a46d-94fc2b499db0 · outbound

This paper cites Clarkson , journal = SICOMP, number =.

Learning Partition Trees for Nearest Neighbor Search Clarkson , journal = SICOMP, number =

Reference 52

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63818be2-90dd-4499-9f5a-31116446c6b7 · outbound

This paper cites Frontiers in Massive Data Analysis , year =.

Learning Partition Trees for Nearest Neighbor Search Frontiers in Massive Data Analysis , year =

Reference 53

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 12b9b2b8-5fa0-45c4-a5f8-ca766fb24c25 · outbound

This paper cites Random projection trees and low dimensional manifolds , year =.

Learning Partition Trees for Nearest Neighbor Search Random projection trees and low dimensional manifolds , year =

Reference 54

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02db5334-f438-4637-9e73-280c0be6b163 · outbound

This paper cites Randomized partition trees for exact nearest neighbor search , year =.

Learning Partition Trees for Nearest Neighbor Search Randomized partition trees for exact nearest neighbor search , year =

Reference 55

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation fd85ac8d-1694-45f9-b88e-bfc51d899f44 · outbound

This paper cites Mirrokni , booktitle = SOCG2004, pages =.

Learning Partition Trees for Nearest Neighbor Search Mirrokni , booktitle = SOCG2004, pages =

Reference 56

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a65fb33b-f081-4eef-b86b-aa2cc804b03c · outbound

This paper cites Dhillon and Pradeep Ravikumar and Ambuj Tewari , booktitle = NIPS2011, pages =.

Learning Partition Trees for Nearest Neighbor Search Dhillon and Pradeep Ravikumar and Ambuj Tewari , booktitle = NIPS2011, pages =

Reference 57

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3ae1c682-090c-40f4-935c-7b1fe7616afd · outbound

This paper cites an unresolved cited work.

Learning Partition Trees for Nearest Neighbor Search Unresolved cited work

Reference 58

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c79982c8-35f9-491d-aca3-3875a8e74f8f · outbound

This paper cites Fredman and J\'.

Learning Partition Trees for Nearest Neighbor Search Fredman and J\'

Reference 59

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c333c04d-4cb8-4da6-8856-e0ec1fc55ed8 · outbound

This paper cites Johnson , journal = IEEEP, number =.

Learning Partition Trees for Nearest Neighbor Search Johnson , journal = IEEEP, number =

Reference 60

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7a52a72a-42af-4878-ba6f-b79cbaff6bd2 · outbound

This paper cites Similarity Search in High Dimensions via Hashing , year =.

Learning Partition Trees for Nearest Neighbor Search Similarity Search in High Dimensions via Hashing , year =

Reference 61

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bbce4aa2-f4e1-4c8c-8bf7-b57aa20673ca · outbound

This paper cites Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , volume =.

Learning Partition Trees for Nearest Neighbor Search Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality , volume =

Reference 62

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1ae3b697-a65c-4164-bea1-2ae3f5d2dbda · outbound

This paper cites Variance Reduced Stochastic Gradient Descent with Neighbors , year =.

Learning Partition Trees for Nearest Neighbor Search Variance Reduced Stochastic Gradient Descent with Neighbors , year =

Reference 63

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce3a30df-94ec-4ea8-8df7-e527544c7663 · outbound

This paper cites Stable distributions, pseudorandom generators, embeddings, and data stream computation , volume =.

Learning Partition Trees for Nearest Neighbor Search Stable distributions, pseudorandom generators, embeddings, and data stream computation , volume =

Reference 64

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0164347d-1992-4e81-a256-74d268302ca2 · outbound

This paper cites On Approximate Nearest Neighbors under _.

Learning Partition Trees for Nearest Neighbor Search On Approximate Nearest Neighbors under _

Reference 65

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation de3452ed-4ad2-44e9-ae63-68ac18e03aee · outbound

This paper cites High-Dimensional Computational Geometry , year =.

Learning Partition Trees for Nearest Neighbor Search High-Dimensional Computational Geometry , year =

Reference 66

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 05cc866a-10f9-4786-b44c-578213c1c43d · outbound

This paper cites Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality , year =.

Learning Partition Trees for Nearest Neighbor Search Approximate Nearest Neighbors: Towards Removing the Curse of Dimensionality , year =

Reference 67

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e0c8f7e-88ac-4e63-97d6-4df7782b9539 · outbound

This paper cites Nearest-neighbor-preserving embeddings , volume =.

Learning Partition Trees for Nearest Neighbor Search Nearest-neighbor-preserving embeddings , volume =

Reference 68

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 69ff2a1e-b32c-47a3-a49a-551a9f684596 · outbound

This paper cites On Model-Based.

Learning Partition Trees for Nearest Neighbor Search On Model-Based

Reference 69

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b98ebd5a-af45-48b9-a029-408c7e73d2d1 · outbound

This paper cites an unresolved cited work.

Learning Partition Trees for Nearest Neighbor Search Unresolved cited work

Reference 70

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6efb0147-c0c0-402f-8aad-577a97386083 · outbound

This paper cites Extensions of.

Learning Partition Trees for Nearest Neighbor Search Extensions of

Reference 71

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f77bcef2-d9b1-4758-930b-c47a7c4b2593 · outbound

This paper cites Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search , year =.

Learning Partition Trees for Nearest Neighbor Search Smooth Tradeoffs between Insert and Query Complexity in Nearest Neighbor Search , year =

Reference 72

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5e50a8cb-eef6-4a87-a6c9-8bbb9037501f · outbound

This paper cites an unresolved cited work.

Learning Partition Trees for Nearest Neighbor Search Unresolved cited work

Reference 73

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 210788ee-8202-42b9-86de-dffd0f32a923 · outbound

This paper cites Karger and Matthias Ruhl , booktitle = STOC2002, pages =.

Learning Partition Trees for Nearest Neighbor Search Karger and Matthias Ruhl , booktitle = STOC2002, pages =

Reference 74

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 601aa5b2-5020-4bb6-9784-e055afb2a6e6 · outbound

This paper cites A Faster Subquadratic Algorithm for Finding Outlier Correlations , year =.

Learning Partition Trees for Nearest Neighbor Search A Faster Subquadratic Algorithm for Finding Outlier Correlations , year =

Reference 75

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c2d09cc1-e9d9-417f-ba84-8cfc9331d25e · outbound

This paper cites Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time , volume =.

Learning Partition Trees for Nearest Neighbor Search Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time , volume =

Reference 76

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4206ef28-f233-4519-8a4c-6b21397bac81 · outbound

This paper cites Fast Polynomial Factorization and Modular Composition , volume =.

Learning Partition Trees for Nearest Neighbor Search Fast Polynomial Factorization and Modular Composition , volume =

Reference 77

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1a31a05e-812c-4584-847e-6b4cc51c27d1 · outbound

This paper cites Fast Cross-Polytope Locality-Sensitive Hashing , year =.

Learning Partition Trees for Nearest Neighbor Search Fast Cross-Polytope Locality-Sensitive Hashing , year =

Reference 78

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c442de19-0dac-4b9b-8131-1ae994faca45 · outbound

This paper cites Lee , booktitle = SODA2004, pages =.

Learning Partition Trees for Nearest Neighbor Search Lee , booktitle = SODA2004, pages =

Reference 79

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7829296b-602b-4945-b193-0d9c9b75b4ab · outbound

This paper cites Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces , volume =.

Learning Partition Trees for Nearest Neighbor Search Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces , volume =

Reference 80

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d41e6485-478a-45b5-8484-aac0c7dc308a · outbound

This paper cites Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing , year =.

Learning Partition Trees for Nearest Neighbor Search Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing , year =

Reference 81

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9ca0fd6b-58b6-4a34-acc9-29303a483c88 · outbound

This paper cites Tradeoffs for nearest neighbors on the sphere , year =.

Learning Partition Trees for Nearest Neighbor Search Tradeoffs for nearest neighbors on the sphere , year =

Reference 82

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 59cb5776-3fd3-4cf3-9356-1747383a1f30 · outbound

This paper cites Search problems in cryptography: From fingerprinting to lattice sieving , year =.

Learning Partition Trees for Nearest Neighbor Search Search problems in cryptography: From fingerprinting to lattice sieving , year =

Reference 83

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f8c11150-881b-4d3f-bc92-e1c6ea64f8a0 · outbound

This paper cites Mining of Massive Datasets , year =.

Learning Partition Trees for Nearest Neighbor Search Mining of Massive Datasets , year =

Reference 84

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f772cfda-6ec4-49cc-bda9-a7f920c44f23 · outbound

This paper cites The geometry of graphs and some of its algorithmic applications , volume =.

Learning Partition Trees for Nearest Neighbor Search The geometry of graphs and some of its algorithmic applications , volume =

Reference 85

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 49bacb4a-35a6-4813-aef3-ca7797aeec9a · outbound

This paper cites A strong lower bound for approximate nearest neighbor searching , volume =.

Learning Partition Trees for Nearest Neighbor Search A strong lower bound for approximate nearest neighbor searching , volume =

Reference 86

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 10140f06-e8e2-425f-81c0-731b866405a0 · outbound

This paper cites Randomized Approximate Nearest Neighbor Search with Limited Adaptivity , year =.

Learning Partition Trees for Nearest Neighbor Search Randomized Approximate Nearest Neighbor Search with Limited Adaptivity , year =

Reference 87

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 039ef469-3116-43fa-92e7-aa669b73c5cc · outbound

This paper cites Multi-Probe.

Learning Partition Trees for Nearest Neighbor Search Multi-Probe

Reference 88

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 145cc890-6895-4667-b109-c9f8be36ce61 · outbound

This paper cites On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes , year =.

Learning Partition Trees for Nearest Neighbor Search On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes , year =

Reference 89

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 5f9868a8-f2d2-4251-b19a-63c8f8197c02 · outbound

This paper cites A fast nearest-neighbor algorithm based on a principal axis search tree , volume =.

Learning Partition Trees for Nearest Neighbor Search A fast nearest-neighbor algorithm based on a principal axis search tree , volume =

Reference 90

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9c4bb1f6-3a5f-4501-a744-c269976145cd · outbound

This paper cites Point Location in Arrangements of Hyperplanes , volume =.

Learning Partition Trees for Nearest Neighbor Search Point Location in Arrangements of Hyperplanes , volume =

Reference 91

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b2cafe56-c064-4966-81f9-322032fc920c · outbound

This paper cites Cell probe complexity -- a survey , year =.

Learning Partition Trees for Nearest Neighbor Search Cell probe complexity -- a survey , year =

Reference 92

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b0e2af80-d009-4452-81c1-e8d4b6f429ad · outbound

This paper cites On data structures and asymmetric communication complexity , year =.

Learning Partition Trees for Nearest Neighbor Search On data structures and asymmetric communication complexity , year =

Reference 93

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4846a686-5115-420f-8252-653a24bd8a5c · outbound

This paper cites Lower Bounds on Locality Sensitive Hashing , volume =.

Learning Partition Trees for Nearest Neighbor Search Lower Bounds on Locality Sensitive Hashing , volume =

Reference 94

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b114fac-60d6-4f35-9b97-e2b2a66c4f2a · outbound

This paper cites Lowe , booktitle = VISAPP2009, pages =.

Learning Partition Trees for Nearest Neighbor Search Lowe , booktitle = VISAPP2009, pages =

Reference 95

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e3c74c14-d791-4f86-b985-3272fe1628b4 · outbound

This paper cites Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) , volume =.

Learning Partition Trees for Nearest Neighbor Search Optimal Lower Bounds for Locality-Sensitive Hashing (Except When q is Tiny) , volume =

Reference 96

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3733ece3-508f-4f68-9b64-12b19c5c1498 · outbound

This paper cites Overmars and Jan van Leeuwen , journal = IPL, number =.

Learning Partition Trees for Nearest Neighbor Search Overmars and Jan van Leeuwen , journal = IPL, number =

Reference 97

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 19034b2d-6bb6-4b92-be1d-d84a6bf84acd · outbound

This paper cites Locality-sensitive Hashing without False Negatives , year =.

Learning Partition Trees for Nearest Neighbor Search Locality-sensitive Hashing without False Negatives , year =

Reference 98

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0ff825c0-5760-4635-861e-1fc4b9dae9ac · outbound

This paper cites Entropy based nearest neighbor search in high dimensions , year =.

Learning Partition Trees for Nearest Neighbor Search Entropy based nearest neighbor search in high dimensions , year =

Reference 99

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a60031d9-5e61-41c7-ae90-68402e6bb7c7 · outbound

This paper cites Lower Bounds on Near Neighbor Search via Metric Expansion , year =.

Learning Partition Trees for Nearest Neighbor Search Lower Bounds on Near Neighbor Search via Metric Expansion , year =

Reference 100

Resolution: unresolved; no resolver link, observed 2026-07-14T14:40:17.008733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Coverage vector

Reference resolution

Outbound references

Pith citing papers