Cameron N Musco

Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems

Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search

Nearly Optimal Approximation of Matrix Functions by the Lanczos Method

On the Role of Edge Dependency in Graph Generative Models

Gaussian Process Bandits for Top-k Recommendations

Partitioned-Learned Count-Min Sketch

Efficient and Private Marginal Reconstruction with Local Non-Negativity

Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits

Online Fractional Knapsack With Predictions