1: TwinArray Sort: An Ultrarapid Conditional Non-Comparison Based Sorting Algorithm
2: The Secretary Problem with Predicted Additive Gap
3: Closed Repeats
4: A Note on Approximation of Spanning Tree Congestion
5: FPT Approximations for Fair $k$-Min-Sum-Radii
6: $k$-local Graphs
7: Circuit and Graver Walks and Linear and Integer Programming
8: Representation of Classical Data on Quantum Computers
9: Better Boosting of Communication Oracles, or Not
10: Approximating Klee’s Measure Problem and a Lower Bound for Union Volume Estimation
11: The Telephone $k$-Multicast Problem
12: Low depth amplitude estimation without really trying
13: Efficient PAC Learning of Halfspaces with Constant Malicious Noise Rate
14: Theoretical Lower Bounds for the Oven Scheduling Problem
15: Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
16: Positional Attention: Out-of-Distribution Generalization and Expressivity for Neural Algorithmic Reasoning
17: Characterizing and Testing Principal Minor Equivalence of Matrices
18: On the Resilience of Fast Failover Routing Against Dynamic Link Failures
19: GORAM: Graph-oriented ORAM for Efficient Ego-centric Queries on Federated Graphs
20: Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
21: Can You Link Up With Treewidth?
22: When is local search both effective and efficient?
23: Computing largest minimum color-spanning intervals of imprecise points
24: Small Space Encoding and Recognition of $k$-Palindromic Prefixes
25: Asymptotic Inapproximability of Reconfiguration Problems: Maxmin $k$-Cut and Maxmin E$k$-SAT
26: Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs
27: Pseudo-Deterministic Construction of Irreducible Polynomials over Finite Fields
28: A branch-&-price approach to the unrooted maximum agreement forest problem
29: Enabling Asymptotic Truth Learning in a Social Network
30: Quantum Approximate Optimization Algorithms for Maxmimum Cut on Low-Girth Graphs
31: The $Z$-Curve as an $n$-Dimensional Hypersphere: Properties and Analysis
32: Gibbs state preparation for commuting Hamiltonian: Mapping to classical Gibbs sampling
33: Quantum property testing in sparse directed graphs