1: Non-Convex Matrix Completion Against a Semi-Random Adversary
2: Polynomial-Time Algorithms for Submodular Laplacian Systems
3: A Fixed-Parameter Algorithm for the Max-Cut Problem on Embedded 1-Planar Graphs
4: Frequent Item-set Mining without Ubiquitous Items
5: Notes on computational-to-statistical gaps: predictions using statistical physics
6: Stochastic Gradient Hamiltonian Monte Carlo with Variance Reduction for Bayesian Inference
7: Prefix-Free Parsing for Building Big BWTs
8: On the Diameter of Tree Associahedra
9: Finding Stable Matchings that are Robust to Errors in the Input
10: Engineering a Simplified 0-Bit Consistent Weighted Sampling
11: Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model
12: The Popular Roommates problem