1: When to Give Up on a Parallel Implementation
2: Improving Lagarias-Odlyzko Algorithm For Average-Case Subset Sum: Modular Arithmetic Approach
3: Online Probabilistic Metric Embedding: A General Framework for Bypassing Inherent Bounds
4: Approximation Algorithms for Correlated Knapsack Orienteering
5: Optimal Trace Distance and Fidelity Estimations for Pure Quantum States
6: Fast and Simple $(1+\epsilon)\Delta$-Edge-Coloring of Dense Graphs
7: A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs
8: E-Graphs as Circuits, and Optimal Extraction via Treewidth
9: Unfairly Splitting Separable Necklaces
10: The Many Faces of Optimal Weak-to-Strong Learning
11: Efficient Testable Learning of General Halfspaces with Adversarial Label Noise
12: Upward Pointset Embeddings of Planar st-Graphs
13: Detecting cluster patterns in tensor data
14: Preprocessing to Reduce the Search Space for Odd Cycle Transversal
15: Gradient-Free Method for Heavily Constrained Nonconvex Optimization