1: Fast Multivariate Multipoint Evaluation Over All Finite Fields
2: The Johnson-Lindenstrauss Lemma for Clustering and Subspace Approximation: From Coresets to Dimension Reduction
3: Dynamic data structures for parameterized string problems
4: On Binary Networked Public Goods Game with Altruism
5: Voting in Two-Crossing Elections
6: Scheduling for Multi-Phase Parallelizable Jobs
7: Enumeration Classes Defined by Circuits
8: Improved Reconstruction for Fourier-Sparse Signals
9: Smaller Progress Measures and Separating Automata for Parity Games
10: Vehicle Routing with Time-Dependent Travel Times: Theory, Practice, and Benchmarks
11: Token sliding on graphs of girth five
12: A Unified Approach to Discrepancy Minimization
13: Leximax Approximations and Representative Cohort Selection
14: Taming graphs with no large creatures and skinny ladders
15: Scheduling with Speed Predictions
16: The Price of Hierarchical Clustering
17: Approximate Selection with Unreliable Comparisons in Optimal Expected Time
18: Understanding the Moments of Tabulation Hashing via Chaoses
19: Hardness Results for Weaver’s Discrepancy Problem
20: Nested Dissection Meets IPMs: Planar Min-Cost Flow in Nearly-Linear Time
21: Computing Maximal Unique Matches with the r-index
22: Optimal Time-Backlog Tradeoffs for the Variable-Processor Cup Game
23: The theoretical analysis of sequencing bioinformatics algorithms and beyond
24: The College Application Problem
25: Swendsen-Wang dynamics for the ferromagnetic Ising model with external fields
26: A Perfect Sampler for Hypergraph Independent Sets
27: Estimation of Standard Auction Models
28: Constrained Backward Time Travel Planning is in P
29: Is the Algorithmic Kadison-Singer Problem Hard?
30: Maximum-utility popular matchings with bounded instability
31: On Preemptive Scheduling of Unrelated Machines Using Linear Programming
32: Scheduling Coflows with Precedence Constraints for Minimizing the Total Weighted Completion Time in Identical Parallel Networks
33: Computing treedepth in polynomial space and linear fpt time
34: Streaming and Sketching Complexity of CSPs: A survey
35: Automating Reasoning with Standpoint Logic via Nested Sequents
36: Finding Bipartite Components in Hypergraphs
37: Cut-Down de Bruijn Sequences
38: What Makes A Good Fisherman? Linear Regression under Self-Selection Bias
39: Minimizing Age of Information under Arbitrary Arrival Model with Arbitrary Packet Size
40: Near-optimal Algorithms for Stochastic Online Bin Packing