1: An Introduction to Matrix Concentration Inequalities
2: Sparse Solutions to Nonnegative Linear Systems and Applications
3: On the Complexity of Sorted Neighborhood
4: Frequent Directions : Simple and Deterministic Matrix Sketching
5: Online Algorithms Modeled After Mousehunt
6: A linear k-fold Cheeger inequality
7: Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations
8: Where Graph Topology Matters: The Robust Subgraph Problem
9: Bloofi: Multidimensional Bloom Filters
10: New Hashing Algorithm for Use in TCP Reassembly Module of IPS
11: Interval Selection in the Streaming Model
12: Range Queries on Uncertain Data
13: Computational Performance Evaluation of Two Integer Linear Programming Models for the Minimum Common String Partition Problem
14: A Unified Analysis Approach for LMS-based Variable Step-Size Algorithms
15: On the Complexity of Hub Labeling
16: Gracefully Degrading Consensus and $k$-Set Agreement in Directed Dynamic Networks
17: Sorting and Selection with Imprecise Comparisons
18: A Parallel Min-Cut Algorithm using Iteratively Reweighted Least Squares