1: A new near-linear time algorithm for k-nearest neighbor search using a compressed cover tree
2: Scaling Shared-Memory Data Structures as Distributed Global-View Data Structures in the Partitioned Global Address Space model
3: Connected Components for Infinite Graph Streams: Theory and Practice
4: Multistage Online Maxmin Allocation of Indivisible Entities
5: Approximating Length-Restricted Means under Dynamic Time Warping
6: Near-Optimal Distributed Degree+1 Coloring
7: Efficient and Local Parallel Random Walks
8: Clustering Mixtures with Almost Optimal Separation in Polynomial Time
9: Faster Maxflow via Improved Dynamic Spectral Vertex Sparsifiers
10: The Price of Differential Privacy under Continual Observation
11: Gomory-Hu Trees in Quadratic Time
12: Generalized Framework for Group Testing: Queries, Feedbacks and Adversaries
13: Online Search With Best-Price and Query-Based Predictions
14: Explicit Abelian Lifts and Quantum LDPC Codes
15: On Some Variants of Euclidean K-Supplier
16: On the Complexity of the K-way Vertex Cut Problem
17: Point Enclosure Problem for Homothetic Polygons
18: Efficient Universal Quantum Compilation: An Inverse-free Solovay-Kitaev Algorithm
19: Projective Clustering Product Quantization
20: Revisiting $k$-Nearest Neighbor Graph Construction on High-Dimensional Data : Experiments and Analyses
21: Algorithms for Maximum Internal Spanning Tree Problem for Some Graph Classes
22: Efficient Deterministic Quantitative Group Testing for Precise Information Retrieval
23: Influential Node Ranking in Complex Information Networks Using A Randomized Dynamics-Sensitive Approach
24: Fixed-Parameter Sensitivity Oracles
25: A Novel Prediction Setup for Online Speed-Scaling
26: Faster Cut Sparsification of Weighted Graphs
27: Modification-Fair Cluster Editing
28: Online Bin Packing with Known T
29: On Complexity of 1-Center in Various Metrics
30: SIMD-Optimized Search Over Sorted Data
31: Dense and well-connected subgraph detection in dual networks
32: Approximating Nash Equilibrium in Random Graphical Games
33: SpaceSaving$^\pm$: An Optimal Algorithm for Frequency Estimation and Frequent items in the Bounded Deletion Model
34: Private Robust Estimation by Stabilizing Convex Relaxations
35: Scaling Structured Inference with Randomization
36: The VLSAT-3 Benchmark Suite
37: Enhancing the SVD Compression
38: A more efficient algorithm to compute the Rand Index for change-point problems