1: Bridging Classical and Quantum: Group-Theoretic Approach to Quantum Circuit Simulation
2: Revisiting Agnostic PAC Learning
3: Subsequence Pattern Matching with Segment Number Constraint
4: The Bidirected Cut Relaxation for Steiner Tree has Integrality Gap Smaller than 2
5: Engineering an Efficient Approximate DNF-Counter
6: Planning For Edge Failure in Fixed-Charge Flow Networks
7: Fast computation of permanents over $\mathbb{F}_3$ via $\mathbb{F}_2$ arithmetic
8: Randomized Rounding Approaches to Online Allocation, Sequencing, and Matching
9: Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
10: Fast Static and Dynamic Approximation Algorithms for Geometric Optimization Problems: Piercing, Independent Set, Vertex Cover, and Matching
11: Random-Order Interval Selection
12: Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams
13: An Invertible State Space for Process Trees
14: Simpler Optimal Sorting from a Directed Acyclic Graph
15: Maintaining $k$-MinHash Signatures over Fully-Dynamic Data Streams with Recovery