1: Almost-Uniform Sampling of Points on High-Dimensional Algebraic Varieties
2: Nonclairvoyant Speed Scaling for Flow and Energy
3: An Approximation Algorithm for l\infty-Fitting Robinson Structures to Distances
4: Fountain Codes Based Distributed Storage Algorithms for Large-scale Wireless Sensor Networks
5: On the Additive Constant of the k-server Work Function Algorithm
6: A Comparison of Techniques for Sampling Web Pages
7: Lower Bounds for Multi-Pass Processing of Multiple Data Streams
8: Perfect Matchings in ~O(n^{1.5}) Time in Regular Bipartite Graphs
9: Even Faster Exact Bandwidth
10: Fast Evaluation of Interlace Polynomials on Graphs of Bounded Treewidth
11: Linear Time Split Decomposition Revisited
12: Cover Time and Broadcast Time
13: Optimal cache-aware suffix selection
14: Correlation Robust Stochastic Optimization
15: Optimal Probabilistic Ring Exploration by Asynchronous Oblivious Robots
16: Local Multicoloring Algorithms: Computing a Nearly-Optimal TDMA Schedule in Constant Time
17: Abstraction and Refinement in Static Model-Checking
18: A Generalization of Nemhauser and Trotter’s Local Optimization Theorem
19: Computing Graph Roots Without Short Cycles
20: Online Scheduling of Bounded Length Jobs to Maximize Throughput
21: A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences