1: Inferring Networks of Diffusion and Influence
2: A Rigorous Extension of the Sch"onhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic
3: A Note on Element-wise Matrix Sparsification via a Matrix-valued Bernstein Inequality
4: The Quadratic Graver Cone, Quadratic Integer Minimization, and Extensions
5: Tight and simple Web graph compression
6: Reconstruction of Causal Networks by Set Covering
7: Fast simulation of large-scale growth models
8: Systolic Array Technique for Determining Common Approximate Substrings
9: On the hardness of distance oracle for sparse graph
10: On the Insertion Time of Cuckoo Hashing