1: Chess is hard even for a single player
2: GraphZeppelin: Storage-Friendly Sketching for Connected Components on Dynamic Graph Streams
3: Efficient Algorithm for Deterministic Search of Hot Elements
4: A quantum-inspired tensor network method for constrained combinatorial optimization problems
5: Efficient Convex Optimization Requires Superlinear Memory
6: Order-Invariant Cardinality Estimators Are Differentially Private
7: Heterogeneous Differential Privacy via Graphs
8: Phase transition in count approximation by Count-Min sketch with conservative updates
9: Firefighter Problem with Minimum Budget: Hardness and Approximation Algorithm for Unit Disk Graphs
10: Graph Neural Networks are Dynamic Programmers
11: Low Treewidth Embeddings of Planar and Minor-Free Metrics
12: Algorithms and Barriers in the Symmetric Binary Perceptron Model
13: On $d$-stable locally checkable problems parameterized by mim-width
14: Restless Temporal Path Parameterized Above Lower Bounds
15: Optimally Tracking Labels on an Evolving Tree
16: Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds
17: Snapshot Visualization of Complex Graphs with Force-Directed Algorithms
18: Suffix tree-based linear algorithms for multiple prefixes, single suffix counting and listing problems
19: Subquadratic Dynamic Path Reporting in Directed Graphs Against an Adaptive Adversary
20: Quantum simulation of real-space dynamics