1: An Algorithm for Multi-Attribute Diverse Matching
2: Distribution-Free Testing of Linear Functions on R^n
3: Target Set Selection for Conservative Populations
4: Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time
5: Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time
6: Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility
7: Information Gathering in Ad-Hoc Radio Networks
8: Multi-Objective Mixed Integer Programming: An Objective Space Algorithm
9: A Complete Transient Analysis for the Incremental LMS Algorithm
10: Differentially Private Algorithms for Learning Mixtures of Separated Gaussians
11: Hypergraph Partitioning With Embeddings
12: Contraction: a Unified Perspective of Correlation Decay and Zero-Freeness of 2-Spin Systems
13: The Outer Limits of Contention Resolution on Matroids and Connections to the Secretary Problem
14: Constant factor approximation of MAX CLIQUE
15: Algorithmic expedients for the S-labeling problem
16: Well-behaved Online Load Balancing Against Strategic Jobs
17: Optimality of the Subgradient Algorithm in the Stochastic Setting
18: A Quantum Search Decoder for Natural Language Processing
19: Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
20: Approximating Vertex Cover using Structural Rounding
21: Faster quantum and classical SDP approximations for quadratic binary optimization
22: Electrical Flows over Spanning Trees
23: SwarmMesh: A Distributed Data Structure for Cooperative Multi-Robot Applications
24: An exact solution framework for the multiple gradual cover location problem
25: Exact and practical pattern matching for quantum circuit optimization
26: Online Linear Programming: Dual Convergence, New Algorithms, and Regret Bounds
27: The Randomized Midpoint Method for Log-Concave Sampling
28: Optimal Routing Schedules for Robots Operating in Aisle-Structures
29: Branch-and-cut and iterated local search for the weighted $k$-traveling repairman problem: an application to the maintenance of speed cameras
30: Sample Complexity of Probabilistic Roadmaps via $\epsilon$-nets
31: Learning Multi-Stage Sparsification for Maximum Clique Enumeration
32: Enumerating Isolated Cliques in Temporal Networks
33: Dynamic Graph Algorithms and Graph Sparsification: New Techniques and Connections
34: A Random Network Model for the Analysis of Blockchain Designs with Communication Delay
35: Local Decode and Update for Big Data Compression
36: Multi-Perspective, Simultaneous Embedding
37: A Generalized Randomized Rank-Revealing Factorization
38: Private and Atomic Exchange of Assets over Zero Knowledge Based Payment Ledger