1: Hyperparameter Tuning with Renyi Differential Privacy
2: On the Complexity of Triangle Counting using Emptiness Queries
3: On Solving the Minimum Common String Partition Problem by Decision Diagrams
4: On Explicit Constructions of Extremely Depth Robust Graphs
5: A Faster Algorithm for Max Cut in Dense Graphs
6: Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs
7: Does Preprocessing Help Training Over-parameterized Neural Networks?
8: Depth Optimized Ansatz Circuit in QAOA for Max-Cut
9: Competitive Perimeter Defense of Conical Environments
10: Parallel Minimum Spanning Forest Computation using Sparse Matrix Kernels
11: A Faster Algorithm for Maximum Independent Set on Interval Filament Graphs
12: The Skellam Mechanism for Differentially Private Federated Learning
13: Exact Matching of Random Graphs with Constant Correlation
14: Long-term balanced allocation via thinning
15: Black Box Absolute Reconstruction for Sums of Powers of Linear Forms
16: Differentially Private Approximate Quantiles
17: Zero-CPU Collection with Direct Telemetry Access
18: Parallel Batched Interpolation Search Tree
19: Improved Analysis of EDCS via Gallai-Edmonds Decomposition
20: Popular matchings with weighted voters
21: A SAT Approach to Twin-Width
22: Finding Relevant Points for Nearest-Neighbor Classification
23: Complexity of optimizing over the integers
24: As Easy as ABC: Adaptive Binning Coincidence Test for Uniformity Testing
25: Infinitely Divisible Noise in the Low Privacy Regime
26: Parameterized Complexity of Minimum Membership Dominating Set
27: The core of housing markets from an agent’s perspective: Is it worth sprucing up your home?
28: Provably accurate simulation of gauge theories and bosonic systems
29: Online Bipartite Matching with Reusable Resources