Seuraa
Michael Levet
Michael Levet
College of Charleston, Department of Computer Science
Vahvistettu sähköpostiosoite verkkotunnuksessa cofc.edu - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Experience report: Standards-based grading at scale in algorithms
L Chen, JA Grochow, R Layer, M Levet
Proceedings of the 27th ACM Conference on on Innovation and Technology in …, 2022
142022
On the Parallel Complexity of Group Isomorphism via Weisfeiler--Leman
JA Grochow, M Levet
https://arxiv.org/abs/2112.11487, 2022
72022
Improved bounds on the size of the smallest representation of relation algebra 32 65
JF Alm, M Levet, S Moazami, J Montero-Vallejo, L Pham, D Sexton, X Xu
Algebra universalis 83 (3), 1-18, 2022
62022
Network structure and activity in Boolean networks
A Adiga, H Galyean, CJ Kuhlman, M Levet, HS Mortveit, S Wu
Cellular Automata and Discrete Complex Systems: 21st IFIP WG 1.5 …, 2015
62015
Count-free Weisfeiler–Leman and group isomorphism
NA Collins, M Levet
International Journal of Algebra and Computation 34 (03), 283-330, 2024
52024
Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture
JF Alm, M Levet
International Journal of Algebra and Computation 33 (08), 1571-1598, 2023
52023
Activity in Boolean networks
A Adiga, H Galyean, CJ Kuhlman, M Levet, HS Mortveit, S Wu
Natural Computing 16, 427-439, 2017
42017
Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture
JF Alm, D Andrews, M Levet
International Conference on Relational and Algebraic Methods in Computer …, 2023
32023
Permutation Statistics in Conjugacy Classes of the Symmetric Group
JC Loth, M Levet, K Liu, S Sundaram, ENN Stucky, M Yin
2023 Joint Mathematics Meetings (JMM 2023), 2023
3*2023
On the Descriptive Complexity of Groups without Abelian Normal Subgroups
JA Grochow, M Levet
arXiv preprint arXiv:2209.13725, 2022
32022
Complexity and enumeration in models of genome rearrangement
L Bailey, HS Blake, G Cochran, N Fox, M Levet, R Mahmoud, EB Matson, ...
Theoretical Computer Science 1022, 114880, 2024
22024
On the Constant-Depth Circuit Complexity of Generating Quasigroups
NA Collins, JA Grochow, M Levet, A Weiß
arXiv preprint arXiv:2402.00133, 2024
22024
Moments of Colored Permutation Statistics on Conjugacy Classes
JC Loth, M Levet, K Liu, S Sundaram, M Yin
arXiv preprint arXiv:2305.11800, 2023
22023
On the Complexity of Identifying Strongly Regular Graphs
M Levet
arXiv preprint arXiv:2207.05930, 2022
22022
Colored Permutation Statistics by Conjugacy Class
JC Loth, M Levet, K Liu, S Sundaram, M Yin
arXiv preprint arXiv:2305.11800, 2023
12023
On the Combinatorial and Logical Complexities of Algebraic Structures
M Levet
University of Colorado at Boulder, 2023
12023
CSCI 3104 Algorithms-Lecture Notes
M Levet
12021
Directed Ramsey and Anti-Ramsey Schemes and the Flexible Atom Conjecture
JF Alm, M Levet
arXiv preprint arXiv:1901.06781, 2019
12019
Complexity of Minimal Faithful Permutation Degree for Fitting-free Groups
M Levet, P Srivastava, D Thakkar
arXiv preprint arXiv:2501.16039, 2025
2025
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model
L Bailey, HS Blake, G Cochran, N Fox, M Levet, R Mahmoud, I Singgih, ...
arXiv preprint arXiv:2402.01942, 2024
2024
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20