1: Forwarding Without Repeating: Efficient Rumor Spreading in Bounded-Degree Graphs
2: Local reconstructors and tolerant testers for connectivity and diameter
3: LP Rounding for k-Centers with Non-uniform Hard Capacities
4: Fast Distributed PageRank Computation
5: A Note on Efficient Computation of All Abelian Periods in a String
6: On Range Searching with Semialgebraic Sets II
7: Sublinear-Time Algorithms for Monomer-Dimer Systems on Bounded Degree Graphs
8: Space-Time Trade-offs for Stack-Based Algorithms
9: On Money as a Means of Coordination between Network Packets
10: On-line Indexing for General Alphabets via Predecessor Queries on Subsets of an Ordered List
11: Constrained Fault-Tolerant Resource Allocation
12: Upper bounds for the formula size of the majority function
13: Reducing a Target Interval to a Few Exact Queries
14: Fast and sensitive read mapping with approximate seeds and multiple backtracking