{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T21:42:10Z","timestamp":1768686130268,"version":"3.49.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030199548","type":"print"},{"value":"9783030199555","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_8","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"80-92","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes"],"prefix":"10.1007","author":[{"given":"Bireswar","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivdutt","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"crossref","first-page":"4:1","DOI":"10.1145\/1944857.1944859","volume":"2","author":"V Arvind","year":"2011","unstructured":"Arvind, V., Tor\u00e1n, J.: Solvable group isomorphism is (almost) in NP $$\\cap $$ coNP. ACM Trans. Comput. Theory 2(2), 4:1\u20134:22 (2011)","journal-title":"ACM Trans. Comput. Theory"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-31594-7_5","volume-title":"Automata, Languages, and Programming","author":"L Babai","year":"2012","unstructured":"Babai, L., Codenotti, P., Qiao, Y.: Polynomial-time isomorphism test for groups with no abelian normal subgroups. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 51\u201362. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31594-7_5"},{"key":"8_CR3","unstructured":"Babai, L., Qiao, Y.: Polynomial-time isomorphism test for groups with abelian sylow towers. In: STACS 2012 (29th Symposium on Theoretical Aspects of Computer Science), vol. 14, pp. 453\u2013464. LIPIcs (2012)"},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/0020-0190(87)90232-8","volume":"25","author":"RB Boppana","year":"1987","unstructured":"Boppana, R.B., Hastad, J., Zachos, S.: Does co-NP have short interactive proofs? Inf. Process. Lett. 25(2), 127\u2013132 (1987)","journal-title":"Inf. Process. Lett."},{"key":"8_CR5","volume-title":"Introduction to the Theory of Groups of Finite Order","author":"RD Carmichael","year":"1937","unstructured":"Carmichael, R.D.: Introduction to the Theory of Groups of Finite Order. GINN and Company, Boston (1937)"},{"issue":"32","key":"8_CR6","doi-asserted-by":"publisher","first-page":"4110","DOI":"10.1016\/j.tcs.2010.06.011","volume":"412","author":"L Chen","year":"2011","unstructured":"Chen, L., Fu, B.: Linear and sublinear time algorithms for the basis of abelian groups. Theor. Comput. Sci. 412(32), 4110\u20134122 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR7","unstructured":"Gall, F.L.: Efficient isomorphism testing for a class of group extensions. In: 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26\u201328, 2009, Freiburg, Germany, Proceedings, pp. 625\u2013636 (2009)"},{"issue":"2","key":"8_CR8","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0022-0000(91)90012-T","volume":"42","author":"M Garzon","year":"1991","unstructured":"Garzon, M., Zalcstein, Y.: On isomorphism testing of a class of $$2$$-nilpotent groups. J. Comput. Syst. Sci. 42(2), 237\u2013248 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1137\/15M1009767","volume":"46","author":"JA Grochow","year":"2017","unstructured":"Grochow, J.A., Qiao, Y.: Algorithms for group isomorphism via group extensions and cohomology. SIAM J. Comput. 46(4), 1153\u20131216 (2017)","journal-title":"SIAM J. Comput."},{"key":"8_CR10","series-title":"Graduate Texts in Mathematics","volume-title":"Algebra","author":"TW Hungerford","year":"1974","unstructured":"Hungerford, T.W.: Algebra. Graduate Texts in Mathematics, vol. 73. Springer, New York (1974)"},{"issue":"04","key":"8_CR11","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1142\/S1793830911001401","volume":"3","author":"G Karagiorgos","year":"2011","unstructured":"Karagiorgos, G., Poulakis, D.: Efficient algorithms for the basis of finite abelian groups. Discrete Math. Algorithms Appl. 3(04), 537\u2013552 (2011)","journal-title":"Discrete Math. Algorithms Appl."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-02927-1_49","volume-title":"Automata, Languages and Programming","author":"N Kayal","year":"2009","unstructured":"Kayal, N., Nezhmetdinov, T.: Factoring groups efficiently. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 585\u2013596. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_49"},{"key":"8_CR13","unstructured":"Luks, E.M.: Lectures on polynomial-time computation in groups. University of Oregon, Department of Computer and Information Science (1990)"},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"Miller, G.L.: On the $$n^{\\log n}$$ isomorphism technique (a preliminary report). In: Proceedings of the Tenth Annual ACM symposium on Theory of computing, pp. 51\u201358. ACM (1978)","DOI":"10.1145\/800133.804331"},{"issue":"4","key":"8_CR15","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s11390-012-1255-7","volume":"27","author":"YM Qiao","year":"2012","unstructured":"Qiao, Y.M., Sarma, J., Tang, B.S.: On isomorphism testing of groups with normal hall subgroups. J. Comput. Sci. Technol. 27(4), 687\u2013701 (2012)","journal-title":"J. Comput. Sci. Technol."},{"key":"8_CR16","unstructured":"Rosenbaum, D.J.: Breaking the $$\\cal{O}(n \\log n)$$ barrier for solvable-group isomorphism. In: Proceedings of The Twenty-fourth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1054\u20131073. Society for Industrial and Applied Mathematics (2013)"},{"key":"8_CR17","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.tcs.2015.05.036","volume":"593","author":"DJ Rosenbaum","year":"2015","unstructured":"Rosenbaum, D.J., Wagner, F.: Beating the generator-enumeration bound for $$p$$-group isomorphism. Theor. Comput. Sci. 593, 16\u201325 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR18","unstructured":"Savage, C.D.: An $$\\cal{O}(n^2)$$ algorithm for abelian group isomorphism. Computer Studies [Program], North Carolina State University (1980)"},{"issue":"6","key":"8_CR19","doi-asserted-by":"publisher","first-page":"986","DOI":"10.1016\/j.jcss.2007.03.013","volume":"73","author":"T Kavitha","year":"2007","unstructured":"Kavitha, T.: Linear time algorithms for abelian group isomorphism and related problems. J. Comput. Syst. Sci. 73(6), 986\u2013996 (2007)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"8_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jcss.1996.0045","volume":"53","author":"N Vikas","year":"1996","unstructured":"Vikas, N.: An $$\\cal{O}(n)$$ algorithm for abelian $$p$$-group isomorphism and an $$\\cal{O}(n \\log n)$$ algorithm for abelian group isomorphism. J. Comput. Syst. Sci. 53(1), 1\u20139 (1996)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19955-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:33:10Z","timestamp":1710361990000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Novosibirsk","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","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":"71","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":"31","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":"44% - 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":"3","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":"2.27","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}