Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs

Siddharth Gollapudi, Ravishankar Krishnaswamy, Kirankumar Shiragur, Harsh Wardhan
2/14/2026

No confident code implementation found for this paper.

Semantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Cite this paper

@article{gollapudi2026sort,
  title  = {Sort Before You Prune: Improved Worst-Case Guarantees of the DiskANN Family of Graphs},
  author = {Siddharth Gollapudi and Ravishankar Krishnaswamy and Kirankumar Shiragur and Harsh Wardhan},
  year   = {2026},
  url    = {https://api.semanticscholar.org/CorpusID:b3991ef2c0ccf4154d392aa9f34707920e1ace05},
  journal = {ICML 2025 2025}
}

Discussion