| A construction for strength-3 covering arrays from linear feedback shift register sequences S Raaphorst, L Moura, B Stevens Designs, codes and cryptography 73, 949-968, 2014 | 27 | 2014 |
| Variable strength covering arrays S Raaphorst, L Moura, B Stevens Journal of Combinatorial Designs 26 (9), 417-438, 2018 | 25 | 2018 |
| Variable strength covering arrays S Raaphorst University of Ottawa (Canada), 2013 | 18 | 2013 |
| Reed-muller codes S Raaphorst Carleton University, May 9, 2003 | 17 | 2003 |
| Upper bounds on the sizes of variable strength covering arrays using the Lovász local lemma L Moura, S Raaphorst, B Stevens Theoretical Computer Science 800, 146-154, 2019 | 9 | 2019 |
| The lovász local lemma and variable strength covering arrays L Moura, S Raaphorst, B Stevens Electronic Notes in Discrete Mathematics 65, 43-49, 2018 | 6 | 2018 |
| Branch-and-cut for symmetrical ILPs and combinatorial designs S Raaphorst Université d'Ottawa/University of Ottawa, 2004 | 3 | 2004 |
| Distributed isomorph-free exhaustive generation of anti-Pasch partial triple systems L Moura, S Raaphorst JOURNAL OF COMBINATORIAL MATHEMATICS AND COMBINATORIAL COMPUTING 56, 101, 2006 | 1 | 2006 |
| CookBook: A Usability Study S Raaphorst | 1 | 2003 |
| Parallel Algebraic Algorithms S Raaphorst | | 2004 |
| Using Isomorphism Pruning to Solve Symmetric ILPs S Raaphorst | | 2003 |
| A Usability Inspection of Several Graphical User Interface Toolkits S Raaphorst | | 2003 |
Lucia MouraProfessor of Computer Science, University of OttawaVerified email at uottawa.ca
