:: Library Catalog

Saved in:

Bibliographic Details
Main Author:	McCauley, Samuel
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	https://arxiv.org/abs/2407.02468
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Space-Efficient Text Indexing with Mismatches using Function Inversion
by: Bibbens, Jackson, et al.
Published: (2026)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
by: Andoni, Alexandr, et al.
Published: (2026)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
by: Li, Binhong, et al.
Published: (2025)

Incremental Approximate Single-Source Shortest Paths with Predictions
by: McCauley, Samuel, et al.
Published: (2025)

Root-to-Leaf Scheduling in Write-Optimized Trees
by: Chung, Christopher, et al.
Published: (2024)

Incremental Topological Ordering and Cycle Detection with Predictions
by: McCauley, Samuel, et al.
Published: (2024)

SPIDER: Improved Succinct Rank and Select Performance
by: Laws, Matthew D., et al.
Published: (2024)

UNIFY: Unified Index for Range Filtered Approximate Nearest Neighbors Search
by: Liang, Anqi, et al.
Published: (2024)

Approximate Nearest Neighbor Search with Window Filters
by: Engels, Joshua, et al.
Published: (2024)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
by: Dehghankar, Mohsen, et al.
Published: (2025)

BBC: Improving Large-k Approximate Nearest Neighbor Search with a Bucket-based Result Collector
by: Yin, Ziqi, et al.
Published: (2026)

Sparse Neighborhood Graph-Based Approximate Nearest Neighbor Search Revisited: Theoretical Analysis and Optimization
by: Ma, Xinran, et al.
Published: (2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
by: Khanna, Sanjeev, et al.
Published: (2025)

Quantum Sketches, Hashing, and Approximate Nearest Neighbors
by: Hashemian, Sajjad
Published: (2026)

Practical and Asymptotically Optimal Quantization of High-Dimensional Vectors in Euclidean Space for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)

On Efficient Approximate Aggregate Nearest Neighbor Queries over Learned Representations
by: Wang, Carrie, et al.
Published: (2025)

PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search
by: Yu, Shangdi, et al.
Published: (2023)

Stable Matching with Predictions: Robustness and Efficiency under Pruned Preferences
by: McCauley, Samuel, et al.
Published: (2026)

Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors
by: Iff, Patrick, et al.
Published: (2025)

Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation
by: Danait, Ved, et al.
Published: (2025)

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
by: Zhang, Tian, et al.
Published: (2026)

Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search
by: Gottesbüren, Lars, et al.
Published: (2024)

SVD Provably Denoises Nearest Neighbor Data
by: Kannan, Ravindran, et al.
Published: (2026)

GPU-Native Approximate Nearest Neighbor Search with IVF-RaBitQ: Fast Index Build and Search
by: Shi, Jifan, et al.
Published: (2026)

Efficient Sketching and Nearest Neighbor Search Algorithms for Sparse Vector Sets
by: Bruch, Sebastian, et al.
Published: (2025)

Efficient Data Shapley for Weighted Nearest Neighbor Algorithms
by: Wang, Jiachen T., et al.
Published: (2024)

CleANN: Efficient Full Dynamism in Graph-based Approximate Nearest Neighbor Search
by: Zhang, Ziyu, et al.
Published: (2025)

Discovering Data Structures: Nearest Neighbor Search and Beyond
by: Salemohamed, Omar, et al.
Published: (2024)

Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)

Fast Nearest Neighbor Search for $\ell_p$ Metrics
by: Krauthgamer, Robert, et al.
Published: (2026)

Efficient Banzhaf-Based Data Valuation for $k$-Nearest Neighbors Classification
by: Zhang, Guangyi, et al.
Published: (2026)

RaBitQ: Quantizing High-Dimensional Vectors with a Theoretical Error Bound for Approximate Nearest Neighbor Search
by: Gao, Jianyang, et al.
Published: (2024)

Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search
by: Lu, Kejing, et al.
Published: (2024)

Incremental Strongly Connected Components with Predictions
by: Deng, Ronald, et al.
Published: (2026)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
by: Chatziafratis, Vaggos, et al.
Published: (2023)

iRangeGraph: Improvising Range-dedicated Graphs for Range-filtering Nearest Neighbor Search
by: Xu, Yuexuan, et al.
Published: (2024)

Incremental Planar Nearest Neighbor Queries with Optimal Query Time
by: Iacono, John, et al.
Published: (2025)

Sublinear Data Structures for Nearest Neighbor in Ultra High Dimensions
by: Herold, Martin G., et al.
Published: (2025)

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits
by: Diwan, Haya, et al.
Published: (2024)

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search
by: Al-Jazzazi, Yousef, et al.
Published: (2025)