| A provably secure true random number generator with built-in tolerance to active attacks B Sunar, WJ Martin, DR Stinson IEEE Transactions on computers 56 (1), 109-119, 2006 | 833 | 2006 |
| Association schemes for ordered orthogonal arrays and (T, M, S)-nets WJ Martin, DR Stinson Canadian Journal of Mathematics 51 (2), 326-346, 1999 | 119 | 1999 |
| Commutative association schemes WJ Martin, H Tanaka European Journal of Combinatorics 30 (6), 1497-1525, 2009 | 94 | 2009 |
| Width and dual width of subsets in polynomial association schemes AE Brouwer, CD Godsil, JH Koolen, WJ Martin Journal of Combinatorial Theory, Series A 102 (2), 255-271, 2003 | 55 | 2003 |
| Anticodes for the Grassman and bilinear forms graphs WJ Martin, XJ Zhu Designs, Codes and Cryptography 6 (1), 73-79, 1995 | 54 | 1995 |
| Imprimitive cometric association schemes: constructions and analysis WJ Martin, M Muzychuk, J Williford Journal of Algebraic Combinatorics 25, 399-415, 2007 | 52 | 2007 |
| Bounded, yet sufficient? How to determine whether limited side channel information enables key recovery X Ye, T Eisenbarth, W Martin Smart Card Research and Advanced Applications: 13th International Conference …, 2015 | 46 | 2015 |
| On the equivalence between real mutually unbiased bases and a certain class of association schemes N LeCompte, WJ Martin, W Owens European Journal of Combinatorics 31 (6), 1499-1512, 2010 | 46 | 2010 |
| Uniformity in association schemes and coherent configurations: cometric Q-antipodal schemes and linked systems ER Van Dam, WJ Martin, M Muzychuk Journal of Combinatorial Theory, Series A 120 (7), 1401-1439, 2013 | 45 | 2013 |
| Completely regular designs WJ Martin Journal of Combinatorial Designs 6 (4), 261-273, 1998 | 43 | 1998 |
| Completely regular designs of strength one WJ Martin Journal of Algebraic Combinatorics 3, 177-185, 1994 | 39 | 1994 |
| Completely regular subsets WJ Martin University of Waterloo, 1992 | 36 | 1992 |
| Designs in product association schemes WJ Martin Designs, Codes and Cryptography 16, 271-289, 1999 | 34 | 1999 |
| Representations of directed strongly regular graphs CD Godsil, SA Hobart, WJ Martin European Journal of Combinatorics 28 (7), 1980-1993, 2007 | 33 | 2007 |
| A Generalized Rao Bound for Ordered Orthogonal Arrays and (t, m, s)-Nets WJ Martin, DR Stinson Canadian Mathematical Bulletin 42 (3), 359-370, 1999 | 33 | 1999 |
| Enhanced flexibility for homomorphic encryption schemes via CRT Y Hu, WJ Martin, B Sunar International Conference on Applied Cryptography and Network Security, ACNS …, 2012 | 32 | 2012 |
| The stipulation polynomial of a uniquely list-colorable graph. JH Dinitz, WJ Martin Australas. J Comb. 11, 105-116, 1995 | 30 | 1995 |
| Quotients of association schemes CD Godsil, WJ Martin Journal of Combinatorial Theory, Series A 69 (2), 185-199, 1995 | 28 | 1995 |
| A new notion of transitivity for groups and sets of permutations WJ Martin, BE Sagan Journal of the London Mathematical Society 73 (1), 1-13, 2006 | 27 | 2006 |
| There are finitely many Q-polynomial association schemes with given first multiplicity at least three WJ Martin, JS Williford European Journal of Combinatorics 30 (3), 698-704, 2009 | 26 | 2009 |
Douglas StinsonProfessor Emeritus, David R. Cheriton School of Computer Science, University of WaterlooVerified email at uwaterloo.ca
