1: Online Knapsack Problems with Estimates
2: Near-Optimal Distributed Ruling Sets for Trees and High-Girth Graphs
3: Message Optimality and Message-Time Trade-offs for APSP and Beyond
4: On the Space Complexity of Online Convolution
5: The Planted Orthogonal Vectors Problem
6: The Complexity of Minimum-Envy House Allocation Over Graphs
7: New Distributed Interactive Proofs for Planarity: A Matter of Left and Right
8: Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
9: Success probability in Shor’s Algorithm
10: On estimating the quantum $\ell_{\alpha}$ distance
11: Lower Bounds for Non-adaptive Local Computation Algorithms
12: Cluster deletion and clique partitioning in graphs with bounded clique number
13: LZD-style Compression Scheme with Truncation and Repetitions
14: The tape reconfiguration problem and its consequences for dominating set reconfiguration
15: ConflictSync: Bandwidth Efficient Synchronization of Divergent State
16: Shuffling Cards When You Are of Very Little Brain: Low Memory Generation of Permutations
17: Negative Stepsizes Make Gradient-Descent-Ascent Converge
18: On Solving Simple Curved Nonograms
19: Quantum Speedup for Hypergraph Sparsification
20: A Matrix Product State Representation of Boolean Functions
21: Faster logconcave sampling from a cold start in high dimension
22: Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
23: On optimal distinguishers for Planted Clique
24: Efficient Classical Algorithms for Simulating Gaussian Boson Sampling on Graphs
25: Unifying Laplace Mechanism with Instance Optimality in Differential Privacy
26: Single-Sample and Robust Online Resource Allocation
27: Parallel GPU-Accelerated Randomized Construction of Approximate Cholesky Preconditioners
28: Multiplication of polynomials over the binary field
29: Lower Bounds for Greedy Teaching Set Constructions
30: Stochastic scheduling with Bernoulli-type jobs through policy stratification
31: Planar Disjoint Shortest Paths is Fixed-Parameter Tractable
32: GPU Implementation of the Wavelet Tree
33: A practical algorithm for 2-admissibility
34: Troika algorithm: approximate optimization for accurate clique partitioning and clustering of weighted networks
35: Differentially Private Densest-$k$-Subgraph
36: Location-Restricted Stable Matching
37: Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
38: Bicluster Editing with Overlaps: A Vertex Splitting Approach
39: The Kinetic Hourglass Data Structure for Computing the Bottleneck Distance of Dynamic Data
40: Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs