A note on the asymptotic and computational complexity of graph distinguishability. Russell, Alexander; Sundaram, Ravi — 1998 The Electronic Journal of Combinatorics [electronic only]
Random Cayley graphs are expanders: a simple proof of the Alon-Roichman theorem. Landau, Zeph; Russell, Alexander — 2004 The Electronic Journal of Combinatorics [electronic only]