Alan Stacey

According to our database, Alan Stacey authored at least 6 papers between 1994 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2003

Branching Random Walks On Quasi-Transitive Graphs.

Alan Stacey

Comb. Probab. Comput., 2003

1999

Counting Boundary Paths for Oriented Percolation Clusters.

Paul Balister, Béla Bollobás, Alan Stacey

Random Struct. Algorithms, 1999

The Existence of Exactlym-Coloured Complete Subgraphs.

Alan Stacey, Peter Weidl

J. Comb. Theory B, 1999

Searches On A Binary Tree With Random Edge-Weights.

Alan Stacey

Comb. Probab. Comput., 1999

1995

Universal minimal total dominating functions of trees.

Alan Stacey

Discret. Math., 1995

1994

Improved Upper Bounds for the Critical Probability of Oriented Percolation in Two Dimensions.

Paul Balister, Béla Bollobás, Alan Stacey

Random Struct. Algorithms, 1994