{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,23]],"date-time":"2024-05-23T00:21:22Z","timestamp":1716423682254},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T00:00:00Z","timestamp":1710115200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T00:00:00Z","timestamp":1710115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00453-024-01212-9","type":"journal-article","created":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T13:03:02Z","timestamp":1710162182000},"page":"1979-2025","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear Space Data Structures for Finite Groups with Constant Query-Time"],"prefix":"10.1007","volume":"86","author":[{"given":"Bireswar","family":"Das","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anant","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivdutt","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dhara","family":"Thakkar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,11]]},"reference":[{"key":"1212_CR1","unstructured":"Kumar, S.R., Rubinfeld, R.: Property testing of Abelian group operations. Citeseer (1998)"},{"key":"1212_CR2","doi-asserted-by":"crossref","unstructured":"Arvind, V., Tor\u00e1n, J.: The complexity of quasigroup isomorphism and the minimum generating set problem. In: International Symposium on Algorithms and Computation, pp. 233\u2013242. Springer, Berlin (2006)","DOI":"10.1007\/11940128_25"},{"key":"1212_CR3","doi-asserted-by":"crossref","unstructured":"Kayal, N., Nezhmetdinov, T.: Factoring groups efficiently. In: International Colloquium on Automata, Languages, and Programming, pp. 585\u2013596. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-02927-1_49"},{"key":"1212_CR4","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 (1978)","DOI":"10.1145\/800133.804331"},{"key":"1212_CR5","doi-asserted-by":"crossref","unstructured":"Babai, L., Codenotti, P., Qiao, Y.: Polynomial-time isomorphism test for groups with no abelian normal subgroups. In: International Colloquium on Automata, Languages, and Programming, pp. 51\u201362. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-31594-7_5"},{"key":"1212_CR6","unstructured":"Gall, F.L.: Efficient isomorphism testing for a class of group extensions. arXiv preprint arXiv:0812.2298 (2008)"},{"issue":"2","key":"1212_CR7","doi-asserted-by":"publisher","first-page":"4","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\u20131422 (2011)","journal-title":"ACM Trans. Comput. Theory"},{"key":"1212_CR8","unstructured":"Babai, L., Qiao, Y.: Polynomial-time isomorphism test for groups with abelian sylow towers. In: STACS\u201912 (29th Symposium on Theoretical Aspects of Computer Science), vol. 14, pp. 453\u2013464. LIPIcs (2012)"},{"issue":"4","key":"1212_CR9","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/s11390-012-1255-7","volume":"27","author":"Y Qiao","year":"2012","unstructured":"Qiao, Y., Sarma, J., Tang, B.: On isomorphism testing of groups with normal hall subgroups. J. Comput. Sci. Technol. 27(4), 687\u2013701 (2012)","journal-title":"J. Comput. Sci. Technol."},{"issue":"6","key":"1212_CR10","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."},{"key":"1212_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511987045","volume-title":"A Course in Combinatorics","author":"JH Van Lint","year":"2001","unstructured":"Van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (2001)"},{"issue":"1","key":"1212_CR12","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":"1212_CR13","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2020.06.007","volume":"114","author":"B Das","year":"2020","unstructured":"Das, B., Sharma, S., Vaidyanathan, P.R.: Space efficient representations of finite groups. J. Comput. Syst. Sci. 114, 137\u2013146 (2020)","journal-title":"J. Comput. Syst. Sci."},{"key":"1212_CR14","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 (2006)","DOI":"10.1145\/1145768.1145788"},{"key":"1212_CR15","doi-asserted-by":"crossref","unstructured":"Das, B., Sharma, S.: Compact data structures for dedekind groups and finite rings. In: WALCOM, pp. 90\u2013102 (2021)","DOI":"10.1007\/978-3-030-68211-8_8"},{"key":"1212_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574702","volume-title":"Computation with Finitely Presented Groups","author":"CC Sims","year":"1994","unstructured":"Sims, C.C.: Computation with Finitely Presented Groups. Cambridge University Press, Cambridge (1994)"},{"key":"1212_CR17","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Computation with permutation groups. In: Proceedings of the Second ACM Symposium on Symbolic and Algebraic Manipulation, pp. 23\u201328 (1971)","DOI":"10.1145\/800204.806264"},{"key":"1212_CR18","doi-asserted-by":"crossref","unstructured":"Sims, C.C.: Computational methods in the study of permutation groups. In: Computational Problems in Abstract Algebra, pp. 169\u2013183. Elsevier, New York (1970)","DOI":"10.1016\/B978-0-08-012975-4.50020-5"},{"key":"1212_CR19","doi-asserted-by":"crossref","unstructured":"Furst, M., Hopcroft, J., Luks, E.: Polynomial-time algorithms for permutation groups. In: 21st Annual Symposium on Foundations of Computer Science (SFCS 1980), pp. 36\u201341. IEEE (1980)","DOI":"10.1109\/SFCS.1980.34"},{"key":"1212_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4176-8","volume-title":"An Introduction to the Theory of Groups","author":"JJ Rotman","year":"1995","unstructured":"Rotman, J.J.: An Introduction to the Theory of Groups. Springer, New York (1995)"},{"key":"1212_CR21","volume-title":"Abstract Algebra","author":"DS Dummit","year":"2004","unstructured":"Dummit, D.S., Foote, R.M.: Abstract Algebra. Wiley, Hoboken (2004)"},{"key":"1212_CR22","volume-title":"Finite Groups of Lie Type: Conjugacy Classes and Complex Characters","author":"RW Carter","year":"1993","unstructured":"Carter, R.W.: Finite Groups of Lie Type: Conjugacy Classes and Complex Characters. Wiley, Chichester (1993)"},{"key":"1212_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-988-2","volume-title":"The Finite Simple Groups","author":"RA Wilson","year":"2009","unstructured":"Wilson, R.A.: The Finite Simple Groups. Springer, New York (2009)"},{"key":"1212_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139175319","volume-title":"Finite Group Theory","author":"M Aschbacher","year":"2000","unstructured":"Aschbacher, M.: Finite Group Theory. Cambridge University Press, Cambridge (2000)"},{"key":"1212_CR25","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629235","volume-title":"The Subgroup Structure of the Finite Classical Groups","author":"PB Kleidman","year":"1990","unstructured":"Kleidman, P.B., Liebeck, M.W.: The Subgroup Structure of the Finite Classical Groups. Cambridge University Press, Cambridge (1990)"},{"key":"1212_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546549","volume-title":"Permutation Group Algorithms","author":"A Seress","year":"2003","unstructured":"Seress, A.: Permutation Group Algorithms. Cambridge University Press, Cambridge (2003)"},{"key":"1212_CR27","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.aim.2013.07.009","volume":"248","author":"TC Burness","year":"2013","unstructured":"Burness, T.C., Liebeck, M.W., Shalev, A.: Generation and random generation: from simple groups to maximal subgroups. Adv. Math. 248, 59\u201395 (2013)","journal-title":"Adv. Math."},{"key":"1212_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0731-3","volume-title":"Permutation Groups","author":"JD Dixon","year":"1996","unstructured":"Dixon, J.D., Mortimer, B.: Permutation Groups. Springer, Boston (1996)"},{"key":"1212_CR29","volume-title":"Maximal Subgroups of Sporadic Groups, Finite Simple Groups: Thirty Years of the Atlas and Beyond","author":"RA Wilson","year":"2017","unstructured":"Wilson, R.A.: Maximal Subgroups of Sporadic Groups, Finite Simple Groups: Thirty Years of the Atlas and Beyond. American Mathematical Society, Providence (2017)"},{"issue":"2","key":"1212_CR30","first-page":"459","volume":"35","author":"N Ahanjideh","year":"2012","unstructured":"Ahanjideh, N., Iranmanesh, A.: On the Sylow normalizers of some simple classical groups. Bull. Malays. Math. Sci. Soc. (2) 35(2), 459\u2013467 (2012)","journal-title":"Bull. Malays. Math. Sci. Soc. (2)"},{"key":"1212_CR31","volume-title":"ATLAS of Finite Groups","author":"JH Conway","year":"1985","unstructured":"Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A., Wilson, R.A.: ATLAS of Finite Groups. Oxford University Press, Eynsham (1985)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01212-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00453-024-01212-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-024-01212-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,22]],"date-time":"2024-05-22T07:04:13Z","timestamp":1716361453000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00453-024-01212-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,11]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["1212"],"URL":"https:\/\/doi.org\/10.1007\/s00453-024-01212-9","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,11]]},"assertion":[{"value":"18 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}