Home › Entities › academia › ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms

Research article (Proceedings of the 29th ACM SIGPLAN Annual Symposium on Principles and Practice of Parallel Programming, 2024) · cited 27× · AI/ML
academia openalex:W4391971774
Press Enter · cited answer in seconds

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms

Summary

ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms is a scholarly article[1].

Key Facts

  • ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms's instance of is recorded as scholarly article[2].

Related Entities

Guy Blelloch Laxman Dhulipala

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [2] ↑ . wikidata.org.

Class ancestry

  1. [1] ↑ . Wikidata. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms. Retrieved May 24, 2026, from https://4ort.xyz/entity/parlayann-scalable-and-deterministic-parallel-graph-based-approximate-nearest-neighbor-search-algorithms
MLA “ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/parlayann-scalable-and-deterministic-parallel-graph-based-approximate-nearest-neighbor-search-algorithms.
BibTeX @misc{4ortxyz_parlayann-scalable-and-deterministic-parallel-graph-based-approximate-nearest-neighbor-search-algorithms_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms}}, year = {2026}, url = {https://4ort.xyz/entity/parlayann-scalable-and-deterministic-parallel-graph-based-approximate-nearest-neighbor-search-algorithms}, note = {Accessed: 2026-05-24}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms — https://4ort.xyz/entity/parlayann-scalable-and-deterministic-parallel-graph-based-approximate-nearest-neighbor-search-algorithms (retrieved 2026-05-24)

Canonical URL: https://4ort.xyz/entity/parlayann-scalable-and-deterministic-parallel-graph-based-approximate-nearest-neighbor-search-algorithms · Last refreshed: