1: Sample-Optimal Density Estimation in Nearly-Linear Time
2: Characterisation of Strongly Stable Matchings
3: Sensor placement by maximal projection on minimum eigenspace for linear inverse problems
4: Parameterized mixed cluster editing via modular decomposition
5: Fast Generation of Best Interval Patterns for Nonmonotonic Constraints
6: An Improved Upper Bound on Maximal Clique Listing via Rectangular Fast Matrix Multiplication
7: A Nearly Optimal and Agnostic Algorithm for Properly Learning a Mixture of k Gaussians, for any Constant k
8: M-Flash: Fast Billion-scale Graph Computation Using a Bimodal Block Processing Model
9: Taylor Polynomial Estimator for Estimating Frequency Moments
10: A Certified Universal Gathering Algorithm for Oblivious Mobile Robots
11: Polynomial-time Algorithm for Isomorphism of Graphs with Clique-width at most Three
12: Weighted Sampling Without Replacement from Data Streams
13: Metric Dimension Parameterized by Max Leaf Number
14: Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter
15: Improved SVRG for Non-Strongly-Convex or Sum-of-Non-Convex Objectives
16: Learning from Rational Behavior: Predicting Solutions to Unknown Linear Programs
17: Primal Method for ERM with Flexible Mini-batching Schemes and Non-convex Losses
18: On approximating tree spanners that are breadth first search trees