Dr McKay is internationally renowned for his research on the difficult problem of graph isomorphism He has developed an algorithm which makes efficient use of properties of the automorphism group of a graph. He is wellknown internationally for his research on various combinatorial algorithms and asymptotic enumeration problems, and is a master at the art of computer generation and enumeration of combinatorial objects. He is noted for his originality and technical virtuosity in applying probabilistic methods, asymptotic analysis, graph theory, enumerative methods, and linear algebra techniques. He is a leader in the application of combinatorial methods to computer science.