{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:57Z","timestamp":1740099117928,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319964171"},{"type":"electronic","value":"9783319964188"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-96418-8_8","type":"book-chapter","created":{"date-parts":[[2018,7,13]],"date-time":"2018-07-13T06:57:13Z","timestamp":1531465033000},"page":"62-70","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["How Fast Can We Compute Orbits of Groups?"],"prefix":"10.1007","author":[{"given":"Anton","family":"Betten","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,14]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-319-96418-8_9","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"A Al-Azemi","year":"2018","unstructured":"Al-Azemi, A., Betten, A., Chowdhury, S.R.: A rainbow clique search algorithm for BLT-sets. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 71\u201379. Springer, Cham (2018)"},{"key":"8_CR2","unstructured":"Bamberg, J., Betten, A., Cara, Ph., De Beule, J., Lavrauw, M., Neunh\u00f6ffer, M.: Finite Incidence Geometry. FinInG - a GAP package, version 1.4 (2017)"},{"issue":"3\/4","key":"8_CR3","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1145\/2576802.2576832","volume":"47","author":"A Betten","year":"2014","unstructured":"Betten, A.: Classifying discrete objects with orbiter. ACM Commun. Comput. Algebra 47(3\/4), 183\u2013186 (2014). https:\/\/doi.org\/10.1145\/2576802.2576832","journal-title":"ACM Commun. Comput. Algebra"},{"key":"8_CR4","unstructured":"Betten, A.: Orbiter - a program to classify discrete objects (2016\u20132018). https:\/\/github.com\/abetten\/orbiter"},{"key":"8_CR5","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-31703-1","volume-title":"Error-Correcting Linear Codes, Classification by Isometry and Applications","author":"A Betten","year":"2006","unstructured":"Betten, A., Braun, M., Fripertinger, H., Kerber, A., Kohnert, A., Wassermann, A.: Error-Correcting Linear Codes, Classification by Isometry and Applications. Algorithms and Computation in Mathematics, vol. 18. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-31703-1"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Betten, A.: Rainbow cliques and the classification of small BLT-sets. In: Kauers, M. (ed.) ISSAC 2013, 26\u201329 June 2013, Boston, Massachusetts, pp. 53\u201360 (2013)","DOI":"10.1145\/2465506.2465508"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s40879-017-0182-0","volume":"4","author":"A Betten","year":"2018","unstructured":"Betten, A., Hirschfeld, J.W.P., Karaoglu, F.: Classification of cubic surfaces with twenty-seven lines over the finite field of order thirteen. Eur. J. Math. 4(1), 37\u201350 (2018)","journal-title":"Eur. J. Math."},{"key":"8_CR8","unstructured":"Betten, A., Karaoglu, F.: Cubic surfaces over small finite fields. Submitted to Designs, Codes and Cryptography"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-319-96418-8_7","volume-title":"Mathematical Software \u2013 ICMS 2018","author":"A Betten","year":"2018","unstructured":"Betten, A.: Classifying cubic surfaces over finite fields using orbiter. In: Davenport, J.H., Kauers, M., Labahn, G., Urban, J. (eds.) ICMS 2018. LNCS, vol. 10931, pp. 55\u201361. Springer, Cham (2018)"},{"key":"8_CR10","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, 235\u2013265 (1997)","journal-title":"J. Symbolic Comput."},{"key":"8_CR11","first-page":"58","volume":"74","author":"M Braun","year":"2005","unstructured":"Braun, M.: Some new designs over finite fields. Bayreuth. Math. Schr. 74, 58\u201368 (2005)","journal-title":"Bayreuth. Math. Schr."},{"key":"8_CR12","unstructured":"The GAP Group, GAP - Groups, Algorithms, and Programming, Version 4.8.10 (2018). https:\/\/www.gap-system.org"},{"key":"8_CR13","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-28991-7","volume-title":"Classification Algorithms for Codes and Designs","author":"P Kaski","year":"2006","unstructured":"Kaski, P., \u00d6sterg\u00e5rd, P.: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol. 15. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/3-540-28991-7"},{"key":"8_CR14","unstructured":"Koch, M.: Neue Strategien zur L\u00f6sung von Isomorphieproblemen. (German) [New strategies for the solution of isomorphism problems] Ph.D. thesis. University of Bayreuth (2015)"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Leon, J.S.: Partitions, refinements, and permutation group computation. In: Groups and Computation, II (New Brunswick, NJ, 1995), vol. 28. DIMACS Series Discrete Mathematics Theoretical Computer Science, pp. 123\u2013158. American Mathematical Society, Providence (1997)","DOI":"10.1090\/dimacs\/028\/10"},{"issue":"2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1006\/jagm.1997.0898","volume":"26","author":"BD McKay","year":"1998","unstructured":"McKay, B.D.: Isomorph-free exhaustive generation. J. Algorithms 26(2), 306\u2013324 (1998)","journal-title":"J. Algorithms"},{"key":"8_CR17","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). https:\/\/doi.org\/10.1016\/j.jsc.2013.09.003","journal-title":"J. Symbolic Comput."},{"key":"8_CR18","first-page":"109","volume":"31","author":"B Schmalz","year":"1990","unstructured":"Schmalz, B.: Verwendung von Untergruppenleitern zur Bestimmung von Doppelnebenklassen. (German) [Use of subgroup ladders for the determination of double cosets]. Bayreuth. Math. Schr. 31, 109\u2013143 (1990)","journal-title":"Bayreuth. Math. Schr."}],"container-title":["Lecture Notes in Computer Science","Mathematical Software \u2013 ICMS 2018"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96418-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,20]],"date-time":"2019-10-20T15:35:28Z","timestamp":1571585728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96418-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319964171","9783319964188"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96418-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}