1: Testing Conditional Independence of Discrete Distributions
2: Outlier-robust moment-estimation via sum-of-squares
3: On the Hardness of Deriving the Arithmetic Mean Component Competitive Ratio
4: An Elementary Analysis of the Probability That a Binomial Random Variable Exceeds Its Expectation
5: Adaptive Group Testing Algorithms to Estimate the Number of Defectives
6: ALLSAT compressed with wildcards: An invitation for C-programmers
7: Coarse Grained Parallel Selection
8: Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack
9: Distributed Algorithms Made Secure: A Graph Theoretic Approach
10: Particle Computation: Complexity, Algorithms, and Logic
11: The Case for Learned Index Structures
12: Sub-clustering in decomposable graphs and size-varying junction trees
13: Clustering Stable Instances of Euclidean k-means
14: Collecting Telemetry Data Privately
15: Optimal Quasi-Gray Codes: The Alphabet Matters
16: Approximating the Spectrum of a Graph
17: Optimal Fast Johnson-Lindenstrauss Embeddings for Large Data Sets
18: Pay for a Sliding Bloom Filter and Get Counting, Distinct Elements, and Entropy for Free
19: Arithmetic Progression Hypergraphs: Examining the Second Moment Method
20: Deterministic Heavy Hitters with Sublinear Query Time
21: Oblivious Routing via Random Walks
22: Exact Algorithms With Worst-case Guarantee For Scheduling: From Theory to Practice
23: Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting
24: Which groups are amenable to proving exponent two for matrix multiplication?
25: A note on searching sorted unbalanced three-dimensional arrays
26: On Colouring $(2P_2,H)$-Free and $(P_5,H)$-Free Graphs
27: The Approximate Duality Gap Technique: A Unified Theory of First-Order Methods