The Self-Avoiding-Walk and Percolation Critical Points in High Dimensions. - Takashi Hara; Gordon Slade (Comb. Probab. Comput., 1995)

The lace expansion on a tree with application to networks of self-avoiding walks. - Remco van der Hofstad; Gordon Slade (Adv. Appl. Math., 2003)

Random subgraphs of finite graphs: I. The scaling window under the triangle condition. - Christian Borgs; Jennifer T. Chayes; Remco van der Hofstad; Gordon Slade; Joel H. Spencer (Random Struct. Algorithms, 2005)

Asymptotic expansions in n-1 for percolation critical values on the n-Cube and Zn. - Remco van der Hofstad; Gordon Slade (Random Struct. Algorithms, 2005)

Random Subgraphs Of Finite Graphs: III. The Phase Transition For The n-Cube. - Christian Borgs; Jennifer T. Chayes; Remco van der Hofstad; Gordon Slade; Joel Spencer (Comb., 2006)

Expansion in ${ boldsymbol{n^{-1}}}$ for Percolation Critical Values on the $n$-cube and ${ boldsymbol{{ mathbb Z}^n}}$: the First Three Terms. - Remco van der Hofstad; Gordon Slade (Comb. Probab. Comput., 2006)

Expansion in High Dimension for the Growth Constants of Lattice Trees and Lattice Animals. - Yuri Mejía Miranda; Gordon Slade (Comb. Probab. Comput., 2013)

Self-avoiding walk on the hypercube. - Gordon Slade (Random Struct. Algorithms, 2023)