1: Lower Bounds on Performance of Metric Tree Indexing Schemes for Exact Similarity Search in High Dimensions
2: Optimal Tracking of Distributed Heavy Hitters and Quantiles
3: Stackelberg Network Pricing is Hard to Approximate
4: k-means requires exponentially many iterations even in the plane
5: Delaunay Triangulations in Linear Time? (Part I)
6: Approximation Algorithms for Bregman Co-clustering and Tensor Clustering
7: Preference Games and Personalized Equilibria, with Applications to Fractional BGP
8: Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
9: Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
10: Improved Approximation for the Number of Hamiltonian Cycles in Dense Digraphs
11: Emerge-Sort: Converging to Ordered Sequences by Simple Local Operators
12: Oscillations with TCP-like Flow Control in Networks of Queues