1: Optimal Learning of Joint Alignments with a Faulty Oracle
2: Online Knapsack Problems with a Resource Buffer
3: Sliding window property testing for regular languages
4: Improved Bounds for Perfect Sampling of $k$-Colorings in Graphs
5: LP-based algorithms for multistage minimization problems
6: RECIPE : Converting Concurrent DRAM Indexes to Persistent-Memory Indexes
7: A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs)
8: The Query Complexity of Mastermind with $\ell_p$ Distances
9: Optimally Resilient Codes for List-Decoding from Insertions and Deletions
10: Analysis of a Model for Generating Weakly Scale-free Networks
11: The space complexity of inner product filters
12: Dynamic Approximate Shortest Paths and Beyond: Subquadratic and Worst-Case Update Time
13: A common approximation framework for the early work, the late work, and resource leveling problems with unit time jobs
14: Private Aggregation from Fewer Anonymous Messages
15: (Nearly) Sample-Optimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless
16: Random $k$-out subgraph leaves only $O(n/k)$ inter-component edges
17: Experimental Evaluation of Algorithms for Computing Quasiperiods
18: Online Non-Monotone DR-submodular Maximization
19: Weighted Shortest Common Supersequence Problem Revisited
20: Data-Driven 3D Placement of UAV Base Stations for Arbitrarily Distributed Crowds
21: Analytical confidence intervals for the number of different objects in data streams
22: Internal Dictionary Matching
23: A New Deterministic Algorithm for Dynamic Set Cover
24: Streaming PTAS for Binary $\ell_0$-Low Rank Approximation
25: Linear and Range Counting under Metric-based Local Differential Privacy
26: String Indexing with Compressed Patterns
27: Approximation Algorithms for Scheduling with Class Constraints
28: The Approximation Ratio of the 2-Opt Heuristic for the Metric Traveling Salesman Problem
29: How does object fatness impact the complexity of packing in d dimensions?
30: Heuristics for Symmetric Rectilinear Matrix Partitioning
31: Approximation Algorithms for Process Systems Engineering
32: Interactive Particle Systems on Hypergraphs, Drift Analysis and the WalkSAT algorithm
33: Optimal Packet-oblivious Stable Routing in Multi-hop Wireless Networks
34: Faster width-dependent algorithm for mixed packing and covering LPs
35: Total Least Squares Regression in Input Sparsity Time
36: Margin-Based Generalization Lower Bounds for Boosted Classifiers
37: Quantum Algorithm for Finding the Optimal Variable Ordering for Binary Decision Diagrams
38: On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
39: Beating Greedy for Stochastic Bipartite Matching
40: Computing the Inversion-Indel Distance
41: Characterization and Linear-time Recognition of Paired Threshold Graphs