1: Fast Distributed Algorithms for Connectivity and MST in Large Graphs
2: Stochastic Service Placement
3: Approximating LZ77 in Small Space
4: The Quicksort algorithm and related topics
5: Modified Dijkstra Algorithm with Invention Hierarchies Applied to a Conic Graph
6: New Algorithms for Computing a Single Component of the Discrete Fourier Transform
7: Two Compact Incremental Prime Sieves
8: Algorithms for Replica Placement in High-Availability Storage
9: Asymptotic Delsarte cliques in distance-regular graphs
10: Simpler, Linear-Time Transitive Orientation via Lexicographic Breadth-First Search
11: Improved Connectivity Condition for Byzantine Fault Tolerance
12: Polynomial-time approximability of the k-Sink Location problem
13: Quantum Algorithm for Monotonicity Testing on the Hypercube
14: On the Approximability of Independent Set Problem on Power Law Graphs
15: Dealing With 4-Variables by Resolution: An Improved MaxSAT Algorithm
16: Self-Adjusting Binary Search Trees: What Makes Them Tick?
17: Computing Heat Kernel Pagerank and a Local Clustering Algorithm
18: Solving Local Linear Systems with Boundary Conditions Using Heat Kernel Pagerank
19: Iterative Merging Algorithm for Cooperative Data Exchange
20: Sampling colorings almost uniformly in sparse random graphs
21: A Polynomial Time Algorithm For Solving Clique Problems
22: Faster 64-bit universal hashing using carry-less multiplications
23: The Discrete Cosine Transform over Prime Finite Fields
24: Satisfiability of Ordering CSPs Above Average
25: Constructing and Employing Tree Alignment Graphs for Phylogenetic Synthesis
26: Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems
27: Hyper Temporal Networks
28: Minimum Equivalent Precedence Relation Systems
29: Algorithms and complexity for Turaev-Viro invariants
30: Join Processing for Graph Patterns: An Old Dog with New Tricks
31: Some Comments on the Stochastic Eulerian Tour Problem