1: A note on the random greedy triangle-packing algorithm
2: Competitive Equilibria in Matching Markets with Budgets
3: Streaming Graph Computations with a Helpful Advisor
4: Clustering with diversity
5: Subset feedback vertex set is fixed parameter tractable
6: Prizing on Paths: A PTAS for the Highway Problem
7: Fast normal random number generators on vector processors
8: Uses of randomness in computation
9: A fast vectorised implementation of Wallace’s normal random number generator
10: Some long-period random number generators using shifts and xors
11: Factorizations of Cunningham numbers with bases 13 to 99
12: Differential Privacy and the Fat-Shattering Dimension of Linear Queries
13: Information Cost Tradeoffs for Augmented Index and Streaming Language Recognition
14: Approximation Algorithms for Dominating Set in Disk Graphs
15: Faster Algorithms for Semi-Matching Problems
16: Some integer factorization algorithms using elliptic curves
17: Faster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs
18: Multiple-precision zero-finding methods and the complexity of elementary function evaluation
19: Towards Providing Low-Risk and Economically Feasible Network Data Transfer Services
20: Empirical Comparison of Algorithms for Network Community Detection
21: Truthful Mechanisms with Implicit Payment Computation
22: Approximating the minimum directed tree cover
23: Some linear-time algorithms for systolic arrays