Michael Levet
Scholar

Michael Levet

Google Scholar ID: XDjOcyoAAAAJ
College of Charleston, Department of Computer Science
CombinatoricsGroup TheoryIsomorphism TestingComputational Complexity
Homepage↗Google Scholar↗
Citations & Impact
All-time
Citations
88
 
H-index
5
 
i10-index
2
 
Publications
20
 
Co-authors
0
 
Contact
No contact links provided.
Publications
8 items
On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
2025
Cited
0
On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
2025
Cited
0
Complexity of Minimal Faithful Permutation Degree for Fitting-free Groups
2025
Cited
0
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model
Scandinavian Workshop on Algorithm Theory · 2024
Cited
0
On the Constant-Depth Circuit Complexity of Generating Quasigroups
arXiv.org · 2024
Cited
5
On the Descriptive Complexity of Groups without Abelian Normal Subgroups
International Symposium on Games, Automata, Logics and Formal Verification · 2022
Cited
6
On the Descriptive Complexity of Groups without Abelian Normal Subgroups
International Symposium on Games, Automata, Logics and Formal Verification · 2022
Cited
5
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
International Symposium on Fundamentals of Computation Theory · 2021
Cited
7
Resume (English only)
Academic Achievements
  • Publications:
  • - On the Parallel Complexity of Identifying Groups and Quasigroups via Decompositions
  • - On the Complexity of Identifying Groups without Abelian Normal Subgroups: Parallel, First Order, and GI-Hardness
  • - Complexity of Minimal Faithful Permutation Degree for Fitting-free Groups
  • - Pairwise Rearrangement in the Single Cut-and-Join Model is Fixed Parameter Tractable
  • - On the Constant Depth Circuit Complexity of Generating Quasigroups
  • - Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
  • - Moments of Colored Permutation Statistics on Conjugacy Classes
  • - Complexity and Enumeration in Models of Genome Rearrangement
  • - Permutation Statistics in Conjugacy Classes of the Symmetric Group
  • - Count-Free Weisfeiler--Leman and Group Isomorphism
  • - On the Descriptive Complexity of Groups without Abelian Normal Subgroups
  • - Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture
  • - Directed Ramsey and Anti-Ramsey Schemes and the Flexible Atom Conjecture
Research Experience
  • Teaching Experience at College of Charleston:
  • - Spring 2026: CSCI 350- Digital Logic and Computer Organization (2 sections)
  • - Spring 2026: CSCI 410/CSIS 616- Automata Theory (1 section)
  • - Fall 2025: CSCI 230- Data Structures and Algorithms (1 section)
  • - Fall 2025: CSCI 310- Advanced Algorithms (2 sections)
Education
  • PhD Dissertation: On the Combinatorial and Logical Complexities of Algebraic Structures
Background
  • Assistant Professor of Computer Science, College of Charleston; Research interests include Algebraic Combinatorics, Algorithms in Finite Groups, Computational Complexity, Descriptive Complexity, Isomorphism Testing, Phylogenetics, and Relation Algebras.
Miscellany
  • Contact Information: Office: Harbor Walk East (HWEA) 312; Email: lastnamefirstinitial (at) cofc (dot) edu; Pronouns: He/Him/His
Co-authors
0 total
Co-authors: 0 (list not available)