1: DDPM Score Matching and Distribution Learning
2: Infinitely Divisible Noise for Differential Privacy: Nearly Optimal Error in the High $\varepsilon$ Regime
3: Binary Tree Block Encoding of Classical Matrix
4: Radial Isotropic Position via an Implicit Newton’s Method
5: Linear-space LCS enumeration with quadratic-time delay for two strings
6: Kronecker scaling of tensors with applications to arithmetic circuits and algorithms
7: A Method for Generating Connected Erdos-Renyi Random Graphs
8: Indexing Strings with Utilities
9: Uncovering Fairness through Data Complexity as an Early Indicator
10: Old and New Results on Alphabetic Codes
11: Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth
12: Collaborative Prediction: Tractable Information Aggregation via Agreement
13: Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
14: Flexible Graph Similarity Computation With A Proactive Optimization Strategy
15: Single-Source Shortest Path Problem in Weighted Disk Graphs
16: Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
17: Matching and Edge Cover in Temporal Graphs
18: Grouping Strategies on Two-Phase Methods for Bi-objective Combinatorial Optimization
19: Mixed-Precision in High-Order Methods: the Impact of Floating-Point Precision on the ADER-DG Algorithm
20: Coreset Strikes Back: Improved Parameterized Approximation Schemes for (Constrained) k-Median/Means
21: Perfect Sampling in Turnstile Streams Beyond Small Moments
22: Fast algorithms for complex-valued discrete Fourier transform with separate real and imaginary inputs/outputs
23: Incremental Planar Nearest Neighbor Queries with Optimal Query Time
24: Multiplicative assignment with upgrades
25: Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
26: A Systematic Approach to Hyperbolic Quantum Error Correction Codes
27: Directed Temporal Tree Realization for Periodic Public Transport: Easy and Hard Cases
28: Deterministic factorization of constant-depth algebraic circuits in subexponential time
29: String Problems in the Congested Clique Model
30: Range Counting Oracles for Geometric Problems
31: Faster shortest-path algorithms using the acyclic-connected tree
32: Deriving the Gradients of Some Popular Optimal Transport Algorithms
33: Relative-error testing of conjunctions and decision lists
34: High dimensional online calibration in polynomial time
35: Testing Juntas and Junta Subclasses with Relative Error
36: Adaptive Robustness of Hypergrid Johnson-Lindenstrauss
37: Towards Optimal Differentially Private Regret Bounds in Linear MDPs
38: Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
39: Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees
40: Bipartite Matching is in Catalytic Logspace
41: Fairness and Efficiency in Two-Sided Matching Markets