{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T02:29:56Z","timestamp":1775096996697,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":40,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,8]],"date-time":"2020-07-08T00:00:00Z","timestamp":1594166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100011199","name":"European Research Council","doi-asserted-by":"publisher","award":["820148"],"award-info":[{"award-number":["820148"]}],"id":[{"id":"10.13039\/100011199","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,8]]},"DOI":"10.1145\/3373718.3394786","type":"proceedings-article","created":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T00:23:18Z","timestamp":1590452598000},"page":"287-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Weisfeiler-Leman Dimension of Finite Groups"],"prefix":"10.1145","author":[{"given":"Jendrik","family":"Brachter","sequence":"first","affiliation":[{"name":"TU Kaiserslautern"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pascal","family":"Schweitzer","sequence":"additional","affiliation":[{"name":"TU Kaiserslautern"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.107"},{"key":"e_1_3_2_1_3_1","volume-title":"Automata, Languages, and Programming - 39th International Colloquium, ICALP","author":"Babai L\u00e1szl\u00f3","year":"2012"},{"key":"e_1_3_2_1_4_1","volume-title":"Polynomial-time Isomorphism Test for Groups with Abelian Sylow Towers. In 29th International Symposium on Theoretical Aspects of Computer Science, STACS 2012","author":"Babai L\u00e1szl\u00f3","year":"2012"},{"key":"e_1_3_2_1_5_1","unstructured":"Jendrik Brachter and Pascal Schweitzer. 2020. On the Weisfeiler-Leman Dimension of Finite Groups. CoRR abs\/2003.13745 (2020). arXiv:arXiv:2003.13745 arXiv. Jendrik Brachter and Pascal Schweitzer. 2020. On the Weisfeiler-Leman Dimension of Finite Groups. CoRR abs\/2003.13745 (2020). arXiv:arXiv:2003.13745 arXiv."},{"key":"e_1_3_2_1_6_1","unstructured":"Peter A. Brooksbank Joshua A. Grochow Yinan Li Youming Qiao and James B. Wilson. 2019. Incorporating Weisfeiler-Leman into algorithms for group isomorphism. CoRR abs\/1905.02518 (2019). arXiv:1905.02518 http:\/\/arxiv.org\/abs\/1905.02518 arXiv. Peter A. Brooksbank Joshua A. Grochow Yinan Li Youming Qiao and James B. Wilson. 2019. Incorporating Weisfeiler-Leman into algorithms for group isomorphism. CoRR abs\/1905.02518 (2019). arXiv:1905.02518 http:\/\/arxiv.org\/abs\/1905.02518 arXiv."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgebra.2016.12.007"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"e_1_3_2_1_9_1","volume-title":"QMW Maths Notes","volume":"13","author":"Cameron Peter J.","year":"1992"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(02)00133-5"},{"key":"e_1_3_2_1_11_1","volume-title":"CSR 2019, Novosibirsk, Russia, July 15, 2019, Proceedings (Lecture Notes in Computer Science), Ren\u00e9 van Bevern and Gregory Kucherov (Eds.)","volume":"11532","author":"Das Bireswar","year":"2019"},{"key":"e_1_3_2_1_12_1","unstructured":"Heiko Dietrich and James B. Wilson. 2018. Polynomial-time isomorphism testing of groups of most finite orders. CoRR abs\/1806.08872 (2018). arXiv:arXiv:1806.08872 arXiv. Heiko Dietrich and James B. Wilson. 2018. Polynomial-time isomorphism testing of groups of most finite orders. CoRR abs\/1806.08872 (2018). arXiv:arXiv:1806.08872 arXiv."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1081\/AGB-120003468"},{"key":"e_1_3_2_1_14_1","volume-title":"26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings (LIPIcs), Susanne Albers and Jean-Yves Marion (Eds.)","volume":"3","author":"Gall Fran\u00e7ois Le","year":"2009"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2015.v011a015"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218196710006047"},{"key":"e_1_3_2_1_17_1","volume-title":"Comment","author":"Gowers Timothy","year":"2011"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1009767"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335313"},{"key":"e_1_3_2_1_20_1","volume-title":"Lecture Notes in Logic","volume":"47","author":"Grohe Martin","year":"2017"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1996.0070"},{"key":"e_1_3_2_1_22_1","volume-title":"Complexity theory retrospective","author":"Immerman Neil"},{"key":"e_1_3_2_1_23_1","unstructured":"Neil Immerman and Rik Sengupta. 2019. The k-Dimensional Weisfeiler-Leman Algorithm. CoRR abs\/1907.09582 (2019). arXiv:arXiv:1907.09582 arXiv. Neil Immerman and Rik Sengupta. 2019. The k-Dimensional Weisfeiler-Leman Algorithm. CoRR abs\/1907.09582 (2019). arXiv:arXiv:1907.09582 arXiv."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1165682"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3333003"},{"key":"e_1_3_2_1_26_1","volume-title":"Linear Algebraic Analogues of the Graph Isomorphism Problem and the Erd\u0151s-R\u00e9nyi Model. In 58th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2017","author":"Li Yinan","year":"2017"},{"key":"e_1_3_2_1_27_1","unstructured":"Eugene M. Luks. 2015. Group Isomorphism with Fixed Subnormal Chains. CoRR abs\/1511.00151 (2015). arXiv:arXiv:1511.00151 http:\/\/arxiv.org\/abs\/1511.00151 arXiv. Eugene M. Luks. 2015. Group Isomorphism with Fixed Subnormal Chains. CoRR abs\/1511.00151 (2015). arXiv:arXiv:1511.00151 http:\/\/arxiv.org\/abs\/1511.00151 arXiv."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.2307\/2273227"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/800133.804331"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-017-1563-2"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1007"},{"key":"e_1_3_2_1_32_1","volume-title":"Lecture Notes in Logic","volume":"9","author":"Otto Martin","year":"2017"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-012-1255-7"},{"key":"e_1_3_2_1_34_1","unstructured":"David J. Rosenbaum. 2013. Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing. CoRR abs\/1304.3935 (2013). arXiv:arXiv:1304.3935 http:\/\/arxiv.org\/abs\/1304.3935 arXiv. David J. Rosenbaum. 2013. Bidirectional Collision Detection and Faster Deterministic Isomorphism Testing. CoRR abs\/1304.3935 (2013). arXiv:arXiv:1304.3935 http:\/\/arxiv.org\/abs\/1304.3935 arXiv."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.036"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Michael J. Smith. 1996. Computing automorphisms of finite soluble groups. B. Aust. Math. Soc. 53 1 (1996) 169\u00e2\u0102\u015e171. https:\/\/doi.org\/10.1017\/S0004972700016841 Michael J. Smith. 1996. Computing automorphisms of finite soluble groups. B. Aust. Math. Soc. 53 1 (1996) 169\u00e2\u0102\u015e171. https:\/\/doi.org\/10.1017\/S0004972700016841","DOI":"10.1017\/S0004972700016841"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Boris Weisfeiler. 1976. On construction and identification of graphs. Springer-Verlag Berlin-New York. xiv+237 pages. Boris Weisfeiler. 1976. On construction and identification of graphs. Springer-Verlag Berlin-New York. xiv+237 pages.","DOI":"10.1007\/BFb0089374"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.14"},{"key":"e_1_3_2_1_39_1","unstructured":"James B. Wilson. 2008. Group Decompositions Jordan Algebras and Algorithms for p-groups. Ph.D. Dissertation. University of Oregon. James B. Wilson. 2008. Group Decompositions Jordan Algebras and Algorithms for p-groups. Ph.D. Dissertation. University of Oregon."},{"key":"e_1_3_2_1_40_1","unstructured":"James B. Wilson. 2016. The threshold for subgroup profiles to agree is \u03a9(log n). CoRR abs\/1612.01444 (2016). arXiv:1612.01444 https:\/\/arxiv.org\/abs\/1612.01444 arXiv. James B. Wilson. 2016. The threshold for subgroup profiles to agree is \u03a9(log n). CoRR abs\/1612.01444 (2016). arXiv:1612.01444 https:\/\/arxiv.org\/abs\/1612.01444 arXiv."}],"event":{"name":"LICS '20: 35th Annual ACM\/IEEE Symposium on Logic in Computer Science","location":"Saarbr\u00fccken Germany","acronym":"LICS '20","sponsor":["SIGLOG ACM Special Interest Group on Logic and Computation","EACSL European Association for Computer Science Logic","IEEE-CS\\DATC IEEE Computer Society"]},"container-title":["Proceedings of the 35th Annual ACM\/IEEE Symposium on Logic in Computer Science"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394786","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3373718.3394786","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:35Z","timestamp":1750197755000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3373718.3394786"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,8]]},"references-count":40,"alternative-id":["10.1145\/3373718.3394786","10.1145\/3373718"],"URL":"https:\/\/doi.org\/10.1145\/3373718.3394786","relation":{},"subject":[],"published":{"date-parts":[[2020,7,8]]},"assertion":[{"value":"2020-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}