• Abhiram Natarajan, Summer 2020 - Spring 2021, now EPSRC Fellow at Warwick
• Nathan Lindzey (co-supervised with Alexandra Kolla), Winter 2019 - Fall 2022, now postdoc at the Technion
• Eric Reckwerdt (co-supervised with Alexandra Kolla), Fall 2018 - Spring 2020, now Instructor in the CU Boulder CS Postbaccalaureate Program

• Gülce Kardeş (CS, co-advised with Rafael Frongillo)
• Elise Tate (CS)
• Robert Green (CS)
• Tzu-Chi Yen (CS, Ph.D. 2023, co-advised with Dan Larremore)
• Maya Ornstein (Math, Ph.D. 2023, co-advised with Keith A. Kearnes)
• Michael Levet (CS, Ph.D. 2023, now Assistant Professor at College of Charleston Department of Computer Science)
• Gabriel Andrade (CS, Ph.D. 2022, now Applied Scientist at Amazon, co-advised with Rafael Frongillo)
• Tyler Schrock (Math, Ph.D. 2019, now Software Engineer at Google, co-advised with Nathaniel Thiem)

Undergraduate Researcher at CU Boulder

• Nathaniel Collins (CU Boulder), Summer 2022 - Spring 2023 (joint with my Ph.D. student Michael Levet, now Ph.D. student at CSU Math)
• Ezzeddine El Sai (CU Boulder), Fall 2020 - present (now Ph.D. student at CU Math)
• Nicole Dong (CU Boulder), Fall 2020 - Summer 2021 (now Ph.D. student at UIUC CS)
• Samuel Serra (CU Boulder), Winter 2020 - Spring 2021
• Arthur Pellegrino (CU Boulder), Summer 2019
• Tarek Tohme (then at American University of Beirut, now Ph.D. student at École Normale Supérieure), Summer 2019 (resulting in the paper Speeding up network motif discovery by counting isomorphic subtrees), Summer 2020 & Fall 2020
• Luke Meszar, senior thesis (CU Boulder), 2018-2019
• Samuel Schlesinger (then at U. Mass., Amherst, now Research Engineer at Google), Summer 2018
• Jamie Tucker-Foltz (then at Amherst College, now Ph.D. student at Harvard University), Summer 2017, resulting in the paper Computational topology and the Unique Games Conjecture (arXiv)

Reed College Senior Thesis, external advisor, 2015-2016

• Sarah Brauner (internal advisor: Angélica Osorno), thesis: The Structure of Partial Orders in the Face of Lower Bounds.

Santa Fe Institute REU Program, 2015 and 2016

• Ian Klasky (then at Bowdoin, now CU Boulder), Algorithmic coarsening of computationally irreducible complex systems, Summer 2016
• Roujia Wen (Minerva), Applying novelty search to the SAT problem, Summer 2016
• Sarah Brauner (Reed), Sorting and the information-theoretic bound: a structural analysis, Summer 2015
  
• Maxinder Kanwal (UC Berkeley; co-mentored with Nihat Ay), Quantifying complexity: An exploration of what one measure of complexity reveals about functional networks, autoassociative memory, and cellular automata, Summer 2015 (resulting in the paper Comparing information-theoretic measures of complexity in Boltzmann machines)
  

University of Toronto CSC 494 Project Course, Spring 2014

• Paul Sacawa, Geometric complexity theory

The University of Chicago Mathematics Department REU Program, 2008 (co-mentored with Thomas Church)

• Elan Bechor, Statistical group theory
• Alexander Staples-Moore, Equitable partitions in graph theory
• Alex Rosenfeld, Understanding irreducible representations
• Isaac Ottoni Wilhelm, Packing triangles on a sphere
• Angelica Wong, Primes and quadratic reciprocity

The University of Chicago Mathematics Department Directed Reading Program (DRP), 2008

• Noah Schweber, Constructive logic and sheaves (Winter 2010)
• Wai Lee Chin Feman, Computability theory and Kolmogorov complexity (Spring 2008)
• William C. Abram, Algebraic graph theory (Winter 2008)

• Michael Klyachman, Summer 2020, now undergraduate at U. Chicago
• Yerim Song, Summer 2020, resulting in the paper An improved algorithm for coarse-graining cellular automata. Now undergraduate at Carnegie Mellon.