1: FastSIR Algorithm: A Fast Algorithm for simulation of epidemic spread in large networks by using SIR compartment model
2: Network Coded Gossip with Correlated Data
3: Network Backbone Discovery Using Edge Clustering
4: Discovery through Gossip
5: Truthful Mechanisms for Competing Submodular Processes
6: The number of Euler tours of a random directed graph
7: Towards Linear Time Overlapping Community Detection in Social Networks
8: Self-healing systems and virtual structures
9: The number of bit comparisons used by Quicksort: an average-case analysis
10: Distributional convergence for the number of symbol comparisons used by QuickSelect
11: Distributional convergence for the number of symbol comparisons used by QuickSort
12: A linear-time algorithm for finding a complete graph minor in a dense graph
13: Multi-Scale Matrix Sampling and Sublinear-Time PageRank Computation
14: On the Hardness of Welfare Maximization in Combinatorial Auctions with Submodular Valuations
15: On Approximating String Selection Problems with Outliers
16: Geometric Pricing: How Low Dimensionality Helps in Approximability
17: The Diffusion of Networking Technologies