Contact Information
 Assistant Professor of Computer Science, College of Charleston
 Office: Harbor Walk East (HWEA) 312
 Email Me: lastnamefirstinitial (at) cofc (dot) edu
 Pronouns: He/Him/His
Current and Upcoming Courses:
 College of Charleston
 Fall 2024: CSCI 300 Seminar in Computing
 Fall 2024: CSCI 310 Advanced Algorithms (2 sections)
 Spring 2024: CSCI 410/CSIS 616 Automata Theory (1 section; Course Announcement)
 Spring 2024: CSCI 350 Digital Logic and Computer Organization (2 sections)
Research Interests
 Algebraic Combinatorics, Algorithms in Finite Groups, Computational Complexity, Descriptive Complexity, Isomorphism Testing, Phylogenetics, Relation Algebras
Publications:
 Pairwise Rearrangement in the Single CutandJoin Model is Fixed Parameter Tractable (Lora Bailey, Heather Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann), (arXiv, Conference Version), SWAT 2024.
 On the Constant Depth Circuit Complexity of Generating Quasigroups (Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß), Preprint, accepted at ISSAC 2024.
 Canonizing Graphs of Bounded RankWidth in Parallel via WeisfeilerLeman (Michael Levet, Puck Rombach, Nicholas Sieger), (arXiv, Conference Version), SWAT 2024.
 Moments of Colored Permutation Statistics on Conjugacy Classes (Jesse Campion Loth, Michael Levet, Kevin Liu, Sheila Sundaram, Mei Yin), Preprint; accepted at FPSAC 2024.
 Complexity and Enumeration in Models of Genome Rearrangement (Lora Bailey, Heather Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann), COCOON 2023 (arXiv, Conference Version).
 On the Combinatorial and Logical Complexities of Algebraic Structures (PhD Dissertation)
 Permutation Statistics in Conjugacy Classes of the Symmetric Group (Jesse Campion Loth, Michael Levet, Kevin Liu, Eric Nathan Stucky, Sheila Sundaram, Mei Yin), Preprint.
 CountFree WeisfeilerLeman and Group Isomorphism (Nathaniel A. Collins, Michael Levet), International Journal of Algebra and Computation (arXiv, Journal).
 On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Joshua A. Grochow, Michael Levet), Accepted for nonarchival presentation in Highlights of Logic, Games, and Automata 2023; GandALF 2023 (arXiv, Conference Version).
 Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture (Jeremy F. Alm, David Andrews, Michael Levet), RAMiCS 2023 (Preprint, Conference Version) .
 Directed Ramsey and AntiRamsey Schemes and the Flexible Atom Conjecture (Jeremy F. Alm, Michael Levet), International Journal of Algebra and Computation (2023), (arXiv, Journal).
 On the Complexity of Identifying Strongly Regular Graphs (Michael Levet), Australasian Journal of Combinatorics (2023), (arXiv, Journal)
 Experience Report: StandardsBased Grading at Scale in Algorithms (Lijun Chen, Joshua A. Grochow, Ryan Layer, Michael Levet), ITiCSE 2022. (Conference Version; Extended Preprint)
 On the Parallel Complexity of Group Isomorphism via WeisfeilerLeman (Joshua A. Grochow, Michael Levet), FCT 2023, where it received a Best Paper Award. (arXiv, Conference Version (Extended Abstract))
 Improved bounds on the size of the smallest representation of relation algebra 32_{65} (Jeremy F. Alm, Michael Levet, Saeed Moazami, Jorge MonteroVallejo, Linda Pham, Dave Sexton, Xiaonan Xu), Algebra Universalis (2022), (arXiv, Journal).
 Master's Thesis: “Graph Homomorphisms and Vector Colorings ”
 Activity in Boolean Networks  (Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Michael Levet, Henning S. Mortveit, Sichao Wu), Journal of Natural Computing (2017).
 A Mechanism Design Approach For Influence Maximization  (Michael Levet, Siddharth Krishnan), GameNets (2016).
 Network Structure and Activity in Boolean Networks  (Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Michael Levet, Henning S. Mortveit, Sichao Wu), Cellular Automata and Discrete Complex Systems (2015).
My Course Materials
I welcome comments, suggestions, and corrections. Please reach out to me via email with any feedback you may have regarding my notes.
 Theory of Computation (Draft) (Mathematical Preliminaries, Finite State Automata, Group Theory, Computability, Complexity)
 Computational Complexity Notes (Draft)

Algorithms Lecture Notes (Draft)
 Adopted as the official course text in CSCI 3104 Algorithms in Summer 2021 and Spring 2022
 Fundamentals of Computer Science Lecture Notes (Introduction to Java, Discrete Math, and Digital Logic)
 Introduction to Game Theory
 My guideddiscovery problem set introducing the Shannon Capacity of a Graph
 During the Spring 2020, Fall 2020, and Summer 2021 semesters, I have implemented active learning in my Algorithms recitations. Here are some of my active learning worksheets. These have since been adopted in CSCI 3104 Algorithms during the Fall 2021 and Spring 2022 semesters.
Book Recommendations
 A First Course in Proofs
 Favorite Combinatorics and Graph Theory Books
 Bijective Combinatorics  Nicholas Loehr
 Introduction to Graph Theory  Douglas West
 Algebraic Graph Theory  Chris Godsil and Gordon Royle
 An Introduction to the Theory of Graph Spectra Dragoš M. Cvetković, Peter Rowlinson, and Slobodon Simić
 Linear Algebra Methods in Combinatorics With Applications to Geometry and Computer Science Laszlo Babai and Peter Frankl
 Theory of Computation and Algorithms
 Introduction to Algorithms Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein
 Computational Complexity: A Modern Approach Sanjeev Arora and Boaz Barak
 Models of Computation John E. Savage
 Introduction to the Theory of Computation  Michael Sipser
 Introduction to Automata Theory, Languages and Computation (1st Edition)
John E. Hopcroft and Jeffrey D. Ullman.
 Introduction to Automata Theory, Languages and Computation (3rd Edition) John E. Hopcroft, Rajeev Motwani, and Jeffrey D. Ullman
 Remark: The 1st Edition of Hopcroft and Ullman's text is a beautifully written book full of a lot of important material. However, it is really geared at a mathematically mature audience. The 3rd edition is more watered down in terms of the material, but the authors emphasize proof strategy. The later edition is more appropriate for an audience with minimal proofsbased mathematics.
 Linear Algebra
 Linear Algebra Stephen H. Friedberg, Arnold J. Insel, and Lawrence E. Spence
 Advanced Linear Algebra Nicholas Loehr
 Abstract Algebra
 Abstract Algebra: Theory and Applications Thomas Judson
 A Book of Abstract Algebra Charles C. Pinter
 Abstract Algebra David Dummit and Richard Foote
 Microeconomics and Game Theory
 Game Theory, Alive Anna R. Karlin and Yuval Peres
 Mechanism Design and Approximation Jason D. Hartline
 Auction Theory Vijay Krishna
 Algorithmic Game Theory Noam Nisan, Tim Roughgarden, Eva Tardos, and Vijay V. Vazirani
 Frank Thorne's Lecture Notes on the Mathematics of Game Shows
Helpful Links