Brendan D. McKay
Algorithms & Complexity · 1981–2016
A researcher in the Science corpus: 9 papers; trusts 8 researchers and is trusted by 27 researchers here, as inferred from the citation graph.
Subfields
- Algorithms & Complexity — 7 citations into it; #463 of 516 by trust here, #507 by citations
Whom Brendan D. McKay trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Á. Seress
- N. Wormald
- Eugene M. Luks
- Matthias Beck
- Ian M. Wanless
- Alison M. Meynert
- Charles J. Colbourn
- Alan M. Frieze
- Wendy J. Myrvold
- Sinai Robins
Who trusts Brendan D. McKay overall
- Charles Bordenave
- Nicholas A. Cook
- Ioana Dumitriu
- Konstantin E. Tikhomirov
- Muhan Zhang
- Giovanni Neglia
- Alexander E. Litvak
- Pierre Youssef
- Mathias Niepert
- Benjamin Bloem-Reddy
Papers from Brendan D. McKay's perspective
Ordered by how strongly the researchers Brendan D. McKay trusts endorse each paper. Same corpus, a different order for every researcher.
- Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
- Mutually orthogonal latin squares: a brief survey of constructions
- On the Number of Latin Squares
- The On-Line Encyclopedia of Integer Sequences (Electronic Journal of Combinatorics)
- Small latin squares, quasigroups, and loops
- Permutation Group Algorithms
- The Design and Analysis of Computer Algorithms
- Uniform Generation of Random Regular Graphs of Moderate Degree
- Coordinating Pebble Motion on Graphs, the Diameter of Permutation Groups, and Applications (IEEE Annual Symposium on Foundations of Computer Science)
- Expansion in perfect groups
Their papers
- Practical graph isomorphism, II (2013) — 1,785 citations
- Subgraphs of random graphs with specified degrees (2011) — 103 citations
- On the Number of Latin Squares (2005) — 191 citations
- Acyclic Digraphs and Eigenvalues of O,1 Matrices (2003) — 53 citations
- Small latin squares, quasigroups, and loops (2007) — 173 citations
- Graph Isomorphism (2016) — 45 citations
- The asymptotic volume of the Birkhoff polytope (2007) — 53 citations
- Uniform Generation of Random Regular Graphs of Moderate Degree (1990)
- The expected eigenvalue distribution of a large regular graph (1981)