1: Improved approximation guarantees for weighted matching in the semi-streaming model
2: A Randomized Sublinear Time Parallel GCD Algorithm for the EREW PRAM
3: Asymmetric Traveling Salesman Path and Directed Latency Problems
4: Tight Bounds for Online Stable Sorting
5: Deterministic Polynomial Time Algorithms for Matrix Completion Problems
6: A generalized inner and outer product of arbitrary multi-dimensional arrays using A Mathematics of Arrays (MoA)
7: Tensors and n-d Arrays:A Mathematics of Arrays (MoA), psi-Calculus and the Composition of Tensor and Array Operations
8: Self-Improving Algorithms
9: Learning Gaussian Mixtures with Arbitrary Separation
10: A Lower Bound for Succinct Rank Queries