{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:27:27Z","timestamp":1743049647564,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030682101"},{"type":"electronic","value":"9783030682118"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-68211-8_8","type":"book-chapter","created":{"date-parts":[[2021,2,18]],"date-time":"2021-02-18T23:20:57Z","timestamp":1613690457000},"page":"90-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Compact Data Structures for Dedekind Groups and Finite Rings"],"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":[[2021,2,16]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-31856-9_1","volume-title":"STACS 2005","author":"M Agrawal","year":"2005","unstructured":"Agrawal, M., Saxena, N.: Automorphisms of finite rings and applications to complexity of problems. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 1\u201317. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31856-9_1"},{"key":"8_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/11940128_25","volume-title":"Algorithms and Computation","author":"V Arvind","year":"2006","unstructured":"Arvind, V., Tor\u00e1n, J.: The complexity of quasigroup isomorphism and the minimum generating set problem. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 233\u2013242. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11940128_25"},{"key":"8_CR3","unstructured":"Carmichael, R.D.: Introduction to the Theory of Groups of Finite Order. GINN and Company (1937)"},{"key":"8_CR4","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, 4110\u20134122 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"8_CR5","unstructured":"Conrad, K.: Generalized quaternions (2013). https:\/\/kconrad.math.uconn.edu\/blurbs\/grouptheory\/genquat.pdf"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-030-19955-5_8","volume-title":"Computer Science \u2013 Theory and Applications","author":"B Das","year":"2019","unstructured":"Das, B., Sharma, S.: Nearly linear time isomorphism algorithms for some nonabelian group classes. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 80\u201392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_8"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Das, B., Sharma, S., Vaidyanathan, P.: Space efficient representations of finite groups. In: Journal of Computer and System Sciences (Special Issue on Fundamentals of Computation Theory FCT 2019), pp. 137\u2013146 (2020)","DOI":"10.1016\/j.jcss.2020.06.007"},{"issue":"1","key":"8_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02806383","volume":"14","author":"P Erd\u00f6s","year":"1965","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: Probabilistic methods in group theory. J. d\u2019Analyse Math\u00e9matique 14(1), 127\u2013138 (1965). https:\/\/doi.org\/10.1007\/BF02806383","journal-title":"J. d\u2019Analyse Math\u00e9matique"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Farzan, A., Munro, J.I.: Succinct representation of finite abelian groups. In: Proceedings of the 2006 International Symposium on Symbolic and Algebraic Computation, pp. 87\u201392. ACM (2006)","DOI":"10.1145\/1145768.1145788"},{"key":"8_CR10","unstructured":"Hungerford, T.W.: Abstract Algebra: An Introduction. Cengage Learning (2012)"},{"issue":"4","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. Discret. Math. Algorithms Appl. 3(4), 537\u2013552 (2011)","journal-title":"Discret. Math. Algorithms Appl."},{"key":"8_CR12","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, 986\u2013996 (2007)","journal-title":"J. Comput. Syst. Sci."},{"key":"8_CR13","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"},{"issue":"4","key":"8_CR14","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/s00037-007-0219-8","volume":"15","author":"N Kayal","year":"2006","unstructured":"Kayal, N., Saxena, N.: Complexity of ring morphism problems. Comput. Complex. 15(4), 342\u2013390 (2006)","journal-title":"Comput. Complex."},{"issue":"1","key":"8_CR15","first-page":"227","volume":"55","author":"DJ Kleitman","year":"1976","unstructured":"Kleitman, D.J., Rothschild, B.R., Spencer, J.H.: The number of semigroups of order $$n$$. Proc. Am. Math. Soc. 55(1), 227\u2013232 (1976)","journal-title":"Proc. Am. Math. Soc."},{"key":"8_CR16","unstructured":"Kumar, S.R., Rubinfeld, R.: Property testing of abelian group operations (1998)"},{"key":"8_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jalgebra.2013.04.025","volume":"388","author":"S Li","year":"2013","unstructured":"Li, S., Liu, J.: On hall subnormally embedded and generalized nilpotent groups. J. Algebra 388, 1\u20139 (2013)","journal-title":"J. Algebra"},{"key":"8_CR18","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press (1992)"},{"issue":"3","key":"8_CR19","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1016\/j.exmath.2007.11.003","volume":"26","author":"I Marin","year":"2008","unstructured":"Marin, I.: Strongly indecomposable finite groups. Expositiones Mathematicae 26(3), 261\u2013267 (2008)","journal-title":"Expositiones Mathematicae"},{"key":"8_CR20","unstructured":"Saxena, N.: Morphisms of Rings and Applications to Complexity. Indian Institute of Technology Kanpur (2006)"},{"key":"8_CR21","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1515\/gcc-2012-0007","volume":"4","author":"JB Wilson","year":"2012","unstructured":"Wilson, J.B.: Existence, algorithms, and asymptotics of direct product decompositions, I. Groups Complex. Cryptol. 4, 33\u201372 (2012)","journal-title":"Groups Complex. Cryptol."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68211-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T15:31:42Z","timestamp":1619278302000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-68211-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030682101","9783030682118"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68211-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"16 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yangon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Myanmar","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 February 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 March 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uit.edu.mm\/walcom-2021\/","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":"60","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":"24","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":"40% - 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":"1,8","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)"}},{"value":"The conference was held online 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)"}}]}}