{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:24:01Z","timestamp":1725798241631},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662441985"},{"type":"electronic","value":"9783662441992"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44199-2_15","type":"book-chapter","created":{"date-parts":[[2014,7,31]],"date-time":"2014-07-31T22:17:11Z","timestamp":1406845031000},"page":"87-91","source":"Crossref","is-referenced-by-count":0,"title":["Software for Groups: Theory and Practice"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Hulpke","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"15_CR1","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1142\/S0218196702001115","volume":"12","author":"H.U. Besche","year":"2002","unstructured":"Besche, H.U., Eick, B., O\u2019Brien, E.A.: A millennium project: constructing small groups. Internat. J. Algebra Comput.\u00a012(5), 623\u2013644 (2002)","journal-title":"Internat. J. Algebra Comput."},{"issue":"3\/4","key":"15_CR2","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.\u00a024(3\/4), 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bray, J.N., Holt, D.F., Roney-Dougal, C.M.: The maximal subgroups of the low-dimensional finite classical groups. London Mathematical Society Lecture Note Series, vol.\u00a0407. Cambridge University Press, Cambridge (2013); With a foreword by Martin Liebeck","DOI":"10.1017\/CBO9781139192576"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Breuer, T., Linton, S.: The GAP 4 type system \u2013 Organising algebraic algorithms. In: Gloor, O. (ed.) Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, pp. 38\u201345. ACM Press (1998)","DOI":"10.1145\/281508.281540"},{"key":"15_CR5","unstructured":"Cannon, J.J.: An introduction to the group theory language, Cayley. In: Atkinson, M.D. (ed.) Computational Group Theory, pp. 145\u2013183. Academic Press (1984)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Detinko, A., Flannery, D., Hulpke, A.: Algorithms for arithmetic groups with the congruence subgroup property (submitted, 2014)","DOI":"10.1016\/j.jalgebra.2014.08.027"},{"key":"15_CR7","unstructured":"The GAP: Group, GAP \u2013 Groups, Algorithms, and Programming, Version 4.6.3 (2013), http:\/\/www.gap-system.org"},{"key":"15_CR8","doi-asserted-by":"publisher","DOI":"10.1201\/9781420035216","volume-title":"Handbook of Computational Group Theory","author":"D.F. Holt","year":"2005","unstructured":"Holt, D.F., Eick, B., O\u2019Brien, E.A.: Handbook of Computational Group Theory. Chapman & Hall\/CRC, Boca Raton (2005)"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jsc.2004.08.002","volume":"39","author":"A. Hulpke","year":"2005","unstructured":"Hulpke, A.: Constructing transitive permutation groups. J. Symbolic Comput.\u00a039(1), 1\u201330 (2005)","journal-title":"J. Symbolic Comput."},{"key":"15_CR10","series-title":"London Mathematical Society Lecture Note Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511629235","volume-title":"The subgroup structure of the finite classical groups","author":"P. Kleidman","year":"1990","unstructured":"Kleidman, P., Liebeck, M.: The subgroup structure of the finite classical groups. London Mathematical Society Lecture Note Series, vol.\u00a0129. Cambridge University Press, Cambridge (1990)"},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1006\/jsco.1997.0167","volume":"25","author":"E.H. Lo","year":"1998","unstructured":"Lo, E.H.: A polycyclic quotient algorithm. J. Symbolic Comput.\u00a025(1), 61\u201397 (1998)","journal-title":"J. Symbolic Comput."},{"issue":"6","key":"15_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1006\/jsco.1994.1064","volume":"18","author":"A.C. Niemeyer","year":"1994","unstructured":"Niemeyer, A.C.: A finite soluble quotient algorithm. J. Symbolic Comput.\u00a018(6), 541\u2013561 (1994)","journal-title":"J. Symbolic Comput."},{"key":"#cr-split#-15_CR13.1","doi-asserted-by":"crossref","unstructured":"Plesken, W., Souvignier, B.: Analysing finitely presented groups by constructing representations. J. Symbolic Comput.\u00a024(3-4), 335-349 (1997)","DOI":"10.1006\/jsco.1996.0131"},{"key":"#cr-split#-15_CR13.2","unstructured":"Computational algebra and number theory, London (1993)"},{"key":"15_CR14","unstructured":"Turing, A.: Proposed electronic calculator, Paper e.882, National Physics Laboratory (1945), http:\/\/www.alanturing.net\/turing_archive\/archive\/p\/p01\/p01.php"}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44199-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T17:32:28Z","timestamp":1689442348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44199-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662441985","9783662441992"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44199-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}