See also my page on DBLP and the arXiv.

  1. On Counting Perfect Matchings in General Graphs
    Daniel Štefankovič, Eric Vigoda, and John Wilmes
  2. On the Complexity of Learning Neural Networks
    Le Song, Santosh Vempala, John Wilmes, and Bo Xie
    To appear in NIPS 2017. Spotlight presentation
  3. Asymptotic Delsarte cliques in distance-regular graphs
    László Babai and John Wilmes
    Journal of Algebraic Combinatorics 2016
  4. Faster canonical forms for primitive coherent configurations
    Xiaorui Sun and John Wilmes
    STOC 2015. Invited to the special issue
  5. Minimal free resolutions of the $G$-parking function ideal and the toppling ideal
    Madhusudan Manjunath, Frank-Olaf Schreyer, and John Wilmes
    Transactions of the American Mathematical Society 2015
  6. Faster canonical forms for strongly regular graphs
    László Babai, Xi Chen, Shang-Hua Teng, Xiaorui Sun, and John Wilmes
    FOCS 2013. Invited to the special issue.
  7. Quasipolynomial-time canonical form for Steiner designs
    László Babai and John Wilmes
    STOC 2013
  8. Primer for the algebraic geometry of sandpiles
    David Perkinson, Jacob Perlman, and John Wilmes
    Tropical and Non-Archimedean Geometry, Contemporary Mathematics 2013


Structure, Automorphisms, and Isomorphisms of Regular Combinatorial Objects.
Ph.D. Thesis, University of Chicago.

Algebraic invariants of sandpile graphs.
Bachelor's Thesis, Reed College.