{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T02:51:40Z","timestamp":1743130300508,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030521998"},{"type":"electronic","value":"9783030522001"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52200-1_10","type":"book-chapter","created":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T18:04:48Z","timestamp":1594145088000},"page":"105-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Towards Efficient Normalizers of Primitive Groups"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2839-5265","authenticated-orcid":false,"given":"Sergio","family":"Siccha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time. arXiv e-prints \narXiv:1512.03547\n\n, December 2015","key":"10_CR1","DOI":"10.1145\/2897518.2897542"},{"doi-asserted-by":"publisher","unstructured":"Babai, L.: Graph isomorphism in quasipolynomial time [extended abstract]. In: Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing, STOC 2016, pp. 684\u2013697. ACM (2016). \nhttps:\/\/doi.org\/10.1145\/2897518.2897542","key":"10_CR2","DOI":"10.1145\/2897518.2897542"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: a fresh approach to numerical computing. SIAM Rev. 59(1), 65\u201398 (2017). \nhttps:\/\/doi.org\/10.1137\/141000671","journal-title":"SIAM Rev."},{"issue":"3\u20134","key":"10_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The magma algebra system. I. The user language. J. Symbolic. Comput. 24(3\u20134), 235\u2013265 (1997). \nhttps:\/\/doi.org\/10.1006\/jsco.1996.0125\n\n. Computational algebra and number theory (London, 1993)","journal-title":"J. Symbolic. Comput."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1090\/S0025-5718-1982-0669659-5","volume":"39","author":"G Butler","year":"1982","unstructured":"Butler, G.: Computing in permutation and matrix groups. ii. Backtrack algorithm. Math. Comput. 39, 671\u2013680 (1982). \nhttps:\/\/doi.org\/10.1090\/S0025-5718-1982-0669659-5","journal-title":"Math. Comput."},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0196-6774(83)90043-3","volume":"4","author":"G Butler","year":"1983","unstructured":"Butler, G.: Computing normalizers in permutation groups. J. Algorithms 4(2), 163\u2013175 (1983). \nhttps:\/\/doi.org\/10.1016\/0196-6774(83)90043-3","journal-title":"J. Algorithms"},{"issue":"3","key":"10_CR7","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1006\/jsco.1997.0127","volume":"24","author":"J Cannon","year":"1997","unstructured":"Cannon, J., Holt, D.: Computing chief series, composition series and socles in large permutation groups. J. Symbolic Comput. 24(3), 285\u2013301 (1997). \nhttps:\/\/doi.org\/10.1006\/jsco.1997.0127","journal-title":"J. Symbolic Comput."},{"doi-asserted-by":"publisher","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups, vol. 163. Springer, New York (1996). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-0731-3","key":"10_CR8","DOI":"10.1007\/978-1-4612-0731-3"},{"unstructured":"The GAP-Group: GAP - Groups, Algorithms, and Programming, Version 4.11.0 (2020). \nhttps:\/\/www.gap-system.org","key":"10_CR9"},{"issue":"5","key":"10_CR10","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1016\/S0747-7171(08)80079-X","volume":"9","author":"SP Glasby","year":"1990","unstructured":"Glasby, S.P., Slattery, M.C.: Computing intersections and normalizersin soluble groups. J. Symbolic Comput. 9(5), 637\u2013651 (1990). \nhttps:\/\/doi.org\/10.1016\/S0747-7171(08)80079-X","journal-title":"J. Symbolic Comput."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1016\/j.aim.2017.02.012","volume":"310","author":"RM Guralnick","year":"2017","unstructured":"Guralnick, R.M., Mar\u00f3ti, A., Pyber, L.: Normalizers of primitive permutation groups. Adv. Math. 310, 1017\u20131063 (2017). \nhttps:\/\/doi.org\/10.1016\/j.aim.2017.02.012","journal-title":"Adv. Math."},{"issue":"4","key":"10_CR12","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0747-7171(08)80100-9","volume":"12","author":"D Holt","year":"1991","unstructured":"Holt, D.: The computation of normalizers in permutation groups. J. Symbolic Comput. 12(4), 499\u2013516 (1991). \nhttps:\/\/doi.org\/10.1016\/S0747-7171(08)80100-9","journal-title":"J. Symbolic Comput."},{"doi-asserted-by":"publisher","unstructured":"Hulpke, A.: Normalizer calculation using automorphisms. In: Computational Group Theory and the Theory of Groups. AMS special session On Computational Group Theory, Davidson, USA, pp. 105\u2013114 (2007). \nhttps:\/\/doi.org\/10.1090\/conm\/470","key":"10_CR13","DOI":"10.1090\/conm\/470"},{"unstructured":"Jefferson, C., Pfeiffer, M., Waldecker, R., Wilson, W.A.: Permutation group algorithms based on directed graphs. arXiv preprint \narXiv:1911.04783\n\n (2019)","key":"10_CR14"},{"key":"10_CR15","volume-title":"The C Programming Language","author":"BW Kernighan","year":"1988","unstructured":"Kernighan, B.W., Ritchie, D.M.: The C Programming Language, 2nd edn. Prentice Hall, Englewood Cliffs (1988)","edition":"2"},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0747-7171(08)80103-4","volume":"12","author":"JS Leon","year":"1991","unstructured":"Leon, J.S.: Permutation group algorithms based on partitions i theory and algorithms. J. Symbolic Comput. 12, 533\u2013583 (1991)","journal-title":"J. Symbolic Comput."},{"doi-asserted-by":"publisher","unstructured":"Liebeck, M.W., Praeger, C.E., Saxl, J.: On the o\u2019nan-scott theorem for finite primitive permutation groups. J. Aust. Math. Soc. Ser. A. Pure Math. Stat. 44(3), 389\u2013396 (1988). \nhttps:\/\/doi.org\/10.1017\/S144678870003216X","key":"10_CR17","DOI":"10.1017\/S144678870003216X"},{"issue":"4","key":"10_CR18","first-page":"61","volume":"13","author":"E Luks","year":"2011","unstructured":"Luks, E., Miyazaki, T.: Polynomial-time normalizers. Discrete Math. Theor. Comput. Sci. 13(4), 61\u201396 (2011)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.jsc.2013.09.003","volume":"60","author":"BD McKay","year":"2014","unstructured":"McKay, B.D., Piperno, A.: Practical graph isomorphism, ii. J. Symbolic Comput. 60, 94\u2013112 (2014). \nhttps:\/\/doi.org\/10.1016\/j.jsc.2013.09.003","journal-title":"J. Symbolic Comput."},{"unstructured":"Neunh\u00f6ffer, M., et al.: Recog, a collection of group recognition methods, Version 1.3.2, April 2018. \nhttps:\/\/gap-packages.github.io\/recog\n\n. GAP package","key":"10_CR20"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1112\/plms\/s3-60.1.68","volume":"3","author":"CE Praeger","year":"1990","unstructured":"Praeger, C.E.: The inclusion problem for finite primitive permutation groups. Proc. Lond. Math. Soc. 3(1), 68\u201388 (1990). \nhttps:\/\/doi.org\/10.1112\/plms\/s3-60.1.68","journal-title":"Proc. Lond. Math. Soc."},{"doi-asserted-by":"crossref","unstructured":"Schweitzer, P., Wiebking, D.: A unifying method for the design of algorithms canonizing combinatorial objects. arXiv e-prints \narXiv:1806.07466\n\n, June 2018","key":"10_CR22","DOI":"10.1145\/3313276.3316338"},{"unstructured":"Siccha, S.: Normalizers of primitive groups with non-regular socle in polynomial time. Ph.D. thesis, RWTH Aachen University. to appear","key":"10_CR23"},{"key":"10_CR24","first-page":"191","volume":"4","author":"CC Sims","year":"1971","unstructured":"Sims, C.C.: Determining the conjugacy classes of permutation groups. Comput. Algebra Number Theo. 4, 191\u2013195 (1971)","journal-title":"Comput. Algebra Number Theo."},{"unstructured":"Thei\u00dfen, H.: Eine methode zur normalisatorberechnung in permutationsgruppen mit anwendungen in der konstruktion primitiver gruppen. Ph.D. thesis, RWTH Aachen University (1997)","key":"10_CR25"},{"doi-asserted-by":"crossref","unstructured":"Wiebking, D.: Normalizers and permutational isomorphisms in simply-exponential time. arXiv e-prints \narXiv:1904.10454\n\n, April 2019","key":"10_CR26","DOI":"10.1137\/1.9781611975994.14"},{"doi-asserted-by":"crossref","unstructured":"Wiebking, D.: Normalizers and permutational isomorphisms in simply-exponential time. In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020, 5\u20138 January 2020, Salt Lake City, Utah, USA (2020)","key":"10_CR27","DOI":"10.1137\/1.9781611975994.14"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52200-1_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,7]],"date-time":"2020-07-07T19:05:25Z","timestamp":1594148725000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52200-1_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030521998","9783030522001"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52200-1_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"8 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICMS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Congress on Mathematical Software","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Braunschweig","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icms2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iaa.tu-bs.de\/AppliedAlgebra\/ICMS2020\/ICMS2020.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"58","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"83% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.22","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}