1: Algorithmic Aspects of Energy-Delay Tradeoff in Multihop Cooperative Wireless Networks
2: An extension of the Moser-Tardos algorithmic local lemma
3: Dual-Tree Fast Gauss Transforms
4: A Tight Lower Bound on Distributed Random Walk Computation
5: Algorithms for Internal Validation Clustering Measures in the Post Genomic Era
6: Analysis of multi-stage open shop processing systems
7: An Approximation Algorithm for Computing Shortest Paths in Weighted 3-d Domains
8: One Packet Suffices - Highly Efficient Packetized Network Coding With Finite Memory
9: On Sorting by Bounded Block Interchanges
10: Efficient Error-Correcting Geocoding
11: Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
12: Generic Programming of Reusable, High Performance Container Types using Automatic Type Hierarchy Inference and Bidirectional Antichain Typing
13: A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids
14: Even Better Framework for min-wise Based Algorithms
15: Optimality of Network Coding in Packet Networks
16: Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
17: A Constant Factor Approximation Algorithm for Unsplittable Flow on Paths
18: Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits
19: Derandomizing HSSW Algorithm for 3-SAT
20: Efficient Algorithms for Dualizing Large-Scale Hypergraphs
21: Diffusive behavior of a greedy traveling salesman
22: Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection
23: Approximating the Online Set Multicover Problems Via Randomized Winnowing
24: Antilope - A Lagrangian Relaxation Approach to the de novo Peptide Sequencing Problem
25: An FPTAS for the Lead-Based Multiple Video Transmission LMVT Problem
26: Sparse neural networks with large learning diversity