1: Fast computation of Bernoulli, Tangent and Secant numbers
2: Adaptive Drift Analysis
3: A Comprehensive Study of an Online Packet Scheduling Algorithm
4: Towards an Optimal Space-and-Query-Time Index for Top-k Document Retrieval
5: Distributed Agreement in Dynamic Peer-to-Peer Networks
6: Scheduling partially ordered jobs faster than 2^n
7: Towards Optimal Sorting of 16 Elements
8: Wireless Capacity With Arbitrary Gain Matrix
9: Conauto-2.0: Fast Isomorphism Testing and Automorphism Group Computation
10: 13/9-approximation for Graphic TSP
11: Combinatorial Algorithms for Capacitated Network Design
12: Compressed Matrix Multiplication
13: Fast k-means algorithm clustering
14: Weak Dominance Drawings and Linear Extension Diameter