1: Expected number of uniformly distributed balls in a most loaded bin using placement with simple linear functions
2: Set-merging for the Matching Algorithm of Micali and Vazirani
3: Fast Generation of Random Spanning Trees and the Effective Resistance Metric
4: LP approximations to mixed-integer polynomial optimization problems
5: Spotting Trees with Few Leaves
6: A Review on the Tree Edit Distance Problem and Related Path-Decomposition Algorithms
7: Maximal Noise in Interactive Communication over Erasure Channels and Channels with Feedback
8: Huge Unimodular N-Fold Programs
9: Clustering Boolean Tensors
10: A new algorithm for multiplying two Dirac numbers
11: Optimal Data-Dependent Hashing for Approximate Near Neighbors
12: Online Computation of Abelian Runs