1: Approximating Matrix p-norms
2: Universally Optimal Privacy Mechanisms for Minimax Agents
3: Succinct Dictionary Matching With No Slowdown
4: On Touching Triangle Graphs
5: Detecting High Log-Densities – an O(n^1/4) Approximation for Densest k-Subgraph
6: Pi/2-Angle Yao Graphs are Spanners
7: Solution space heterogeneity of the random K-satisfiability problem: Theory and simulations
8: Dynamic sharing of a multiple access channel
9: Optimal Gossip-Based Aggregate Computation
10: Minimum Vertex Cover in Rectangle Graphs
11: Practical Parallel External Memory Algorithms via Simulation of Parallel Algorithms
12: On the inference of large phylogenies with long branches: How long is too long?
13: Posynomial Geometric Programming Problems with Multiple Parameters
14: On Fast Algorithm for Computing Even-Length DCT
15: Two-phase algorithms for the parametric shortest path problem