1: Quantum thermodynamics and semi-definite optimization
2: Light Spanners with Small Hop-Diameter
3: Fast Pattern Matching with Epsilon Transitions
4: Optimal Deterministic Rendezvous in Labeled Lines
5: Feature Selection and Junta Testing are Statistically Equivalent
6: PSSketch: Finding Persistent and Sparse Flow with High Accuracy and Efficiency
7: With a Little Help From My Friends: Exploiting Probability Distribution Advice in Algorithm Design
8: Zip-Tries: Simple Dynamic Data Structures for Strings
9: Learning Partitions with Optimal Query and Round Complexities
10: Efficient Parallel Ising Samplers via Localization Schemes
11: Overlapping Biclustering
12: InfTDA: A Simple TopDown Mechanism for Hierarchical Differentially Private Counting Queries
13: CART-ELC: Oblique Decision Tree Induction via Exhaustive Search
14: All-to-All Communication with Mobile Edge Adversary: Almost Linearly More Faults, For Free
15: persiansort : an alternative to mergesort inspired by persian rug
16: Best of Both Worlds Guarantees for Equitable Allocations
17: New Statistical and Computational Results for Learning Junta Distributions
18: Smaller and More Flexible Cuckoo Filters
19: A Polynomial-Time Approximation Algorithm for Complete Interval Minors
20: Second Price Matching with Complete Allocation and Degree Constraints
21: Scheduled Jacobian Chaining
22: Experimental algorithms for the dualization problem
23: Learning-Augmented Algorithms for Boolean Satisfiability
24: The Power of Matching for Online Fractional Hedonic Games
25: Equalizing Closeness Centralities via Edge Additions
26: Hamiltonian Locality Testing via Trotterized Postselection
27: Regular mixed-radix DFT matrix factorization for in-place FFT accelerators
28: An Improved Algorithm for a Bipartite Traveling Tournament in Interleague Sports Scheduling
29: Exact Spin Elimination in Ising Hamiltonians and Energy-Based Machine Learning
30: Reconfiguring Multiple Connected Components with Size Multiset Constraints
31: Improved Mixing of Critical Hardcore Model
32: Verified Purely Functional Catenable Real-Time Deques
33: Reconfiguration of List Colourings
34: Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
35: Uniform Universal Sets, Splitters, and Bisectors
36: On Unbiased Low-Rank Approximation with Minimum Distortion
37: Even Faster Algorithm for the Chamfer Distance
38: Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time
39: Approximate Cartesian Tree Matching with One Difference
40: Structural Parameterization of Steiner Tree Packing
41: Online Bin Packing with Item Size Estimates
42: A Dynamic Working Set Method for Compressed Sensing