{"id":"https://openalex.org/W7163877675","doi":"https://doi.org/10.4230/lipics.swat.2026.30","title":"Parallel Algorithms for Group Isomorphism via Code Equivalence","display_name":"Parallel Algorithms for Group Isomorphism via Code Equivalence","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7163877675","doi":"https://doi.org/10.4230/lipics.swat.2026.30"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26066","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.30/LIPIcs.SWAT.2026.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.30/LIPIcs.SWAT.2026.30.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5061484797","display_name":"Michael Levet","orcid":"https://orcid.org/0009-0009-1992-3175"},"institutions":[{"id":"https://openalex.org/I204593131","display_name":"College of Charleston","ror":"https://ror.org/00390t168","country_code":"US","type":"education","lineage":["https://openalex.org/I204593131"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Levet, Michael","raw_affiliation_strings":["Department of Computer Science, College of Charleston, SC, USA"],"raw_orcid":"https://orcid.org/0009-0009-1992-3175","affiliations":[{"raw_affiliation_string":"Department of Computer Science, College of Charleston, SC, USA","institution_ids":["https://openalex.org/I204593131"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5061484797"],"corresponding_institution_ids":["https://openalex.org/I204593131"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.9417329,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8551999926567078,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.8551999926567078,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.055399999022483826,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11693","display_name":"Cryptography and Residue Arithmetic","score":0.01940000057220459,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.7215999960899353},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.6450999975204468},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.6432999968528748},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.579800009727478},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.5673999786376953},{"id":"https://openalex.org/keywords/group-isomorphism","display_name":"Group isomorphism","score":0.5390999913215637},{"id":"https://openalex.org/keywords/coprime-integers","display_name":"Coprime integers","score":0.3758000135421753}],"concepts":[{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.7215999960899353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6481999754905701},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.6450999975204468},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.6432999968528748},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.579800009727478},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.5673999786376953},{"id":"https://openalex.org/C155190451","wikidata":"https://www.wikidata.org/wiki/Q742064","display_name":"Group isomorphism","level":5,"score":0.5390999913215637},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5234000086784363},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4869999885559082},{"id":"https://openalex.org/C23230895","wikidata":"https://www.wikidata.org/wiki/Q104752","display_name":"Coprime integers","level":2,"score":0.3758000135421753},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3634999990463257},{"id":"https://openalex.org/C134941585","wikidata":"https://www.wikidata.org/wiki/Q6912366","display_name":"Morita equivalence","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.3093000054359436},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.30070000886917114},{"id":"https://openalex.org/C131992880","wikidata":"https://www.wikidata.org/wiki/Q2528185","display_name":"Subgraph isomorphism problem","level":3,"score":0.288100004196167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C20725272","wikidata":"https://www.wikidata.org/wiki/Q245462","display_name":"Cyclic group","level":3,"score":0.2581999897956848}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:26066","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.30/LIPIcs.SWAT.2026.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},{"id":"doi:10.4230/lipics.swat.2026.30","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.swat.2026.30","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:26066","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2026.30","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol370-swat2026/LIPIcs.SWAT.2026.30/LIPIcs.SWAT.2026.30.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7163877675.pdf","grobid_xml":"https://content.openalex.org/works/W7163877675.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,91,134],"exhibit":[4],"AC\u00b3":[5],"isomorphism":[6,39,69,137],"tests":[7,70],"for":[8,41,71,96],"coprime":[9],"extensions":[10],"H":[11,15],"\u22c9":[12],"N":[13,20],"where":[14,25],"is":[16,21,29,44,111,143],"elementary":[17,30],"Abelian":[18,31],"and":[19,23,32,53,57,59,152,170],"Abelian;":[22],"groups":[24,142],"Rad(G)":[26],"=":[27,34],"Z(G)":[28],"G":[33,110],"Soc^{*}(G).":[35],"The":[36,67],"fact":[37,108],"that":[38,109,136],"testing":[40,138],"these":[42,74],"families":[43,75],"in":[45,126],"P":[46],"was":[47],"established":[48],"respectively":[49],"by":[50,113],"Qiao,":[51],"Sarma,":[52],"Tang":[54],"(STACS":[55],"2011),":[56],"Grochow":[58,169],"Qiao":[60,171],"(CCC":[61],"2014,":[62],"SIAM":[63],"J.":[64,101],"Comput.":[65,102],"2017).":[66],"polynomial-time":[68],"both":[72],"of":[73,83,122,131,139,148,163],"crucially":[76],"leveraged":[77],"small":[78],"(size":[79],"O(log":[80],"|G|))":[81],"instances":[82,121],"Linear":[84,123],"Code":[85,124],"Equivalence":[86,125],"(Babai,":[87],"SODA":[88],"2011).":[89],"Here,":[90],"combine":[92],"Luks'":[93],"group-theoretic":[94],"method":[95],"Graph":[97],"Isomorphism":[98],"(FOCS":[99],"1980,":[100],"Syst.":[103],"Sci.":[104],"1982)":[105],"with":[106],"the":[107,119,160],"given":[112],"its":[114],"multiplication":[115],"table,":[116],"to":[117,168],"implement":[118],"corresponding":[120],"AC\u00b3.":[127],"As":[128],"a":[129],"byproduct":[130],"our":[132],"work,":[133],"show":[135],"arbitrary":[140],"central-radical":[141],"decidable":[144],"using":[145],"AC":[146],"circuits":[147],"depth":[149],"O(log\u00b3":[150],"n)":[151],"size":[153],"n^{O(log":[154,164],"log":[155,165],"n)}.":[156],"This":[157],"improves":[158],"upon":[159],"previous":[161],"bound":[162],"n)}-time":[166],"due":[167],"(ibid.).":[172]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-09T00:00:00"}