1: Simpler Proofs by Symbolic Perturbation
2: Simple, efficient maxima-finding algorithms for multidimensional samples
3: On the Sample Complexity of Compressed Counting
4: Pathwidth, trees, and random embeddings
5: Convergence Time Evaluation of Algorithms in MANETs
6: Estimating Entropy of Data Streams Using Compressed Counting
7: Covering Points by Disjoint Boxes with Outliers
8: Faster algorithms for the square root and reciprocal of power series
9: A Generalized Recursive Algorithm for Binary Multiplication based on Vedic Mathematics
10: Engineering a Scalable High Quality Graph Partitioner
11: A $(\log n)^{\Omega(1)}$ integrality gap for the Sparsest Cut SDP
12: Compression bounds for Lipschitz maps from the Heisenberg group to $L_1$
13: Congestion Control in the Internet by Employing a Ratio dependent Plant Herbivore Carnivorous Model
14: An algorithm for computing cutpoints in finite metric spaces
15: On the hardness of the noncommutative determinant
16: Scalable Distributed-Memory External Sorting