default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Levet
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Nathaniel A. Collins
, Michael Levet:
Count-free Weisfeiler-Leman and group isomorphism. Int. J. Algebra Comput. 34(3): 283-330 (2024)- [j4]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and enumeration in models of genome rearrangement. Theor. Comput. Sci. 1022: 114880 (2024) - [c10]Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß:
Constant Depth Circuit Complexity for Generating Quasigroups. ISSAC 2024: 198-207 - [c9]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann:
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model. SWAT 2024: 3:1-3:16 - [c8]Michael Levet, Puck Rombach, Nicholas Sieger:
Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler-Leman. SWAT 2024: 32:1-32:18 - [i9]Nathaniel A. Collins, Joshua A. Grochow, Michael Levet, Armin Weiß:
On the Constant-Depth Circuit Complexity of Generating Quasigroups. CoRR abs/2402.00133 (2024) - [i8]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Inne Singgih, Grace Stadnyk, Alexander Wiedemann:
Pairwise Rearrangement is Fixed-Parameter Tractable in the Single Cut-and-Join Model. CoRR abs/2402.01942 (2024) - 2023
- [j3]Michael Levet:
On the complexity of identifying strongly regular graphs. Australas. J Comb. 87: 41-67 (2023) - [j2]Jeremy F. Alm, Michael Levet:
Directed Ramsey and anti-Ramsey schemes and the Flexible Atom Conjecture. Int. J. Algebra Comput. 33(8): 1571-1598 (2023) - [c7]Jeremy F. Alm, David Andrews, Michael Levet:
Comer Schemes, Relation Algebras, and the Flexible Atom Conjecture. RAMiCS 2023: 17-33 - [c6]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and Enumeration in Models of Genome Rearrangement. COCOON (1) 2023: 3-14 - [c5]Joshua A. Grochow, Michael Levet:
On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman. FCT 2023: 234-247 - [c4]Joshua A. Grochow, Michael Levet:
On the Descriptive Complexity of Groups without Abelian Normal Subgroups (Extended Abstract). GandALF 2023: 185-202 - [i7]Lora Bailey, Heather C. Smith Blake, Garner Cochran, Nathan Fox, Michael Levet, Reem Mahmoud, Elizabeth Bailey Matson, Inne Singgih, Grace Stadnyk, Xinyi Wang, Alexander Wiedemann:
Complexity and Enumeration in Models of Genome Rearrangement. CoRR abs/2305.01851 (2023) - [i6]Michael Levet, Nicholas Sieger:
Logarithmic Weisfeiler-Leman Identifies All Graphs of Bounded Rank Width. CoRR abs/2306.17777 (2023) - 2022
- [c3]Lijun Chen, Joshua A. Grochow, Ryan Layer, Michael Levet:
Experience Report: Standards-Based Grading at Scale in Algorithms. ITiCSE (1) 2022: 221-227 - [i5]Lijun Chen, Joshua A. Grochow, Ryan Layer, Michael Levet:
Experience Report: Standards-Based Grading at Scale in Algorithms. CoRR abs/2204.12046 (2022) - [i4]Michael Levet:
On the Complexity of Identifying Strongly Regular Graphs. CoRR abs/2207.05930 (2022) - [i3]Joshua A. Grochow, Michael Levet:
On the Descriptive Complexity of Groups without Abelian Normal Subgroups. CoRR abs/2209.13725 (2022) - [i2]Nathaniel A. Collins, Michael Levet:
Count-Free Weisfeiler-Leman and Group Isomorphism. CoRR abs/2212.11247 (2022) - 2021
- [i1]Joshua A. Grochow, Michael Levet:
Weisfeiler-Leman for Group Isomorphism: Action Compatibility. CoRR abs/2112.11487 (2021)
2010 – 2019
- 2017
- [j1]Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Michael Levet, Henning S. Mortveit, Sichao Wu:
Activity in Boolean networks. Nat. Comput. 16(3): 427-439 (2017) - 2016
- [c2]Michael Levet, Siddharth Krishnan:
A Mechanism Design Approach for Influence Maximization. GAMENETS 2016: 55-62 - 2015
- [c1]Abhijin Adiga, Hilton Galyean, Chris J. Kuhlman, Michael Levet, Henning S. Mortveit, Sichao Wu:
Network Structure and Activity in Boolean Networks. Automata 2015: 210-223
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
