1: Upfront Commitment in Online Resource Allocation with Patient Customers
2: SpEuler: Semantics-preserving Euler Diagrams
3: Circuit imbalance measures and linear programming
4: Fairest Neighbors: Tradeoffs Between Metric Queries
5: Nonexistence of a Universal Algorithm for Traveling Salesman Problems in Constructive Mathematics
6: Scalable adaptive PDE solvers in arbitrary domains
7: Online Minimax Multiobjective Optimization: Multicalibeating and Other Applications
8: A Polynomial-Time Deterministic Algorithm for An NP-Complete Problem
9: EPTAS for load balancing problem on parallel machines with a non-renewable resource
10: Deterministic Massively Parallel Connectivity
11: Johnson-Lindenstrauss Lemma, Linear and Nonlinear Random Projections, Random Fourier Features, and Random Kitchen Sinks: Tutorial and Survey
12: Small Parsimony for Natural Genomes in the DCJ-Indel Model
13: Improved Parallel Algorithm for Minimum Cost Submodular Cover Problem
14: A $D$-competitive algorithm for the Multilevel Aggregation Problem with Deadlines
15: A Tight Analysis of Slim Heaps and Smooth Heaps
16: Fast and Fair Randomized Wait-Free Locks
17: Random Rank-Based, Hierarchical or Trivial: Which Dynamic Graph Algorithm Performs Best in Practice?
18: Algorithm Engineering for Cut Problems
19: On Learning and Testing Decision Tree
20: Parallel Computation of Combinatorial Symmetries
21: Spectral Robustness for Correlation Clustering Reconstruction in Semi-Adversarial Models
22: Tutorial on the Robust Interior Point Method
23: FedPAGE: A Fast Local Stochastic Gradient Method for Communication-Efficient Federated Learning
24: Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
25: Contrained Generalization For Data Anonymization - A Systematic Search Based Approach
26: Practical evaluation of Lyndon factors via alphabet reordering
27: Statistical Inference in the Differential Privacy Model
28: One-Sided Box Filter for Edge Preserving Image Smoothing
29: Correlation Clustering with Asymmetric Classification Errors
30: Local Correlation Clustering with Asymmetric Classification Errors
31: Learning to Hash Robustly, Guaranteed
32: Space-Efficient Huffman Codes Revisited
33: On the Fine-Grained Complexity of the Unbounded SubsetSum and the Frobenius Problem
34: A coefficient related to splay-to-root traversal, correct to thousands of decimal places
35: CNF Satisfiability in a Subspace and Related Problems
36: Derandomization of Cell Sampling
37: A Faster Algorithm for Quickest Transshipments via an Extended Discrete Newton Method