1: A Refreshment Stirred, Not Shaken (II): Invariant-Preserving Deployments of Differential Privacy for the US Decennial Census
2: Efficient Shape Reconfiguration by Hybrid Programmable Matter
3: Adaptive Approximation Schemes for Matching Queues
4: Beating Competitive Ratio 4 for Graphic Matroid Secretary
5: A simpler QPTAS for scheduling jobs with precedence constraints
6: Testing Noise Assumptions of Learning Algorithms
7: Scheduling Coflows for Minimizing the Maximum Completion Time in Heterogeneous Parallel Networks
8: A Near-optimal Algorithm for Learning Margin Halfspaces with Massart Noise
9: Learning Noisy Halfspaces with a Margin: Massart is No Harder than Random
10: Efficient Sampling of Temporal Networks with Preserved Causality Structure
11: An Efficient Algorithm for Permutation Iteration Using a Singly Linked List
12: Cutwidth and Crossings
13: Streaming Graph Algorithms in the Massively Parallel Computation Model
14: Local Sherman’s Algorithm for Multi-commodity Flow
15: Answering Related Questions
16: Convergence and Running Time of Time-dependent Ant Colony Algorithms
17: Fixed Point Computation: Beating Brute Force with Smoothed Analysis
18: Packing Dijoins in Weighted Chordal Digraphs
19: Optimal Binary Variable-Length Codes with a Bounded Number of 1’s per Codeword: Design, Analysis, and Applications
20: On the thinness of trees
21: Local Limits of Small World Networks
22: On the Complexity of Computing a Fastest Temporal Path in Interval Temporal Graphs
23: An algorithmic Vizing’s theorem: toward efficient edge-coloring sampling with an optimal number of colors
24: Tight Analyses of Ordered and Unordered Linear Probing
25: Randomized Kaczmarz Methods with Beyond-Krylov Convergence
26: $O(1)$-Round MPC Algorithms for Multi-dimensional Grid Graph Connectivity, EMST and DBSCAN