| |
| 2003 | ||
|---|---|---|
| 6 | Alan Stacey: Branching Random Walks On Quasi-Transitive Graphs. Combinatorics, Probability & Computing 12(3): (2003) | |
| 1999 | ||
| 5 | Alan Stacey: Searches On A Binary Tree With Random Edge-Weights. Combinatorics, Probability & Computing 8(6): (1999) | |
| 4 | EE | Alan Stacey, Peter Weidl: The Existence of Exactlym-Coloured Complete Subgraphs. J. Comb. Theory, Ser. B 75(1): 1-18 (1999) |
| 3 | Paul Balister, Béla Bollobás, Alan Stacey: Counting Boundary Paths for Oriented Percolation Clusters. Random Struct. Algorithms 14(1): 1-28 (1999) | |
| 1995 | ||
| 2 | EE | Alan Stacey: Universal minimal total dominating functions of trees. Discrete Mathematics 140(1-3): 287-290 (1995) |
| 1994 | ||
| 1 | Paul Balister, Béla Bollobás, Alan Stacey: Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions. Random Struct. Algorithms 5(4): 573-590 (1994) | |
| 1 | Paul N. Balister (Paul Balister) | [1] [3] |
| 2 | Béla Bollobás | [1] [3] |
| 3 | Peter Weidl | [4] |