1: Quantum Approximate Counting, Simplified
2: High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm
3: Eliminating Left Recursion without the Epsilon
4: The Single-Face Ideal Orientation Problem in Planar Graphs
5: Solving Discounted Stochastic Two-Player Games with Near-Optimal Time and Sample Complexity
6: FunSeqSet: Towards a Purely Functional Data Structure for the Linearisation Case of Dynamic Trees Problem
7: Compacted binary trees admit a stretched exponential
8: The Grover search as a naturally occurring phenomenon
9: Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem
10: Nearly Tight Bounds for Robust Proper Learning of Halfspaces with a Margin
11: On the Power of Multiple Anonymous Messages
12: Want to Gather? No Need to Chatter!
13: Minimum Label s-t Cut has Large Integrality Gaps
14: Improving Utility and Security of the Shuffler-based Differential Privacy
15: On a weighted linear matroid intersection algorithm by deg-det computation
16: Approximation Algorithms for Partially Colorable Graphs
17: Property testing of the Boolean and binary rank
18: Equivalences between triangle and range query problems
19: A Simple Algorithm for Minimum Cuts in Near-Linear Time
20: Near-optimal Approximate Discrete and Continuous Submodular Function Minimization
21: Efficient Computation of Optimal Temporal Walks under Waiting-Time Constraints