乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:25:24Z","timestamp":1729671924071,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,7,9]]},"DOI":"10.1145\/1145768.1145817","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"298-305","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups"],"prefix":"10.1145","author":[{"given":"Eric","family":"Robinson","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA"}]},{"given":"Gene","family":"Cooperman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}]}],"member":"320","published-online":{"date-parts":[[2006,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1995.1024"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/120694.120724"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794229417"},{"volume-title":"Groups and Computation III, Ohio State Univ. Math. Res. Inst. Publ.","year":"2000","author":"Babai L.","key":"e_1_3_2_1_4_1","unstructured":"L. Babai and A. Shalev . Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups . In Groups and Computation III, Ohio State Univ. Math. Res. Inst. Publ. , Berlin, 2000 . (Ohio, 1999), de Gruyter . L. Babai and A. Shalev. Recognizing simplicity of black-box groups and the frequency of p-singular elements in affine groups. In Groups and Computation III, Ohio State Univ. Math. Res. Inst. Publ., Berlin, 2000. (Ohio, 1999), de Gruyter."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1996.0125"},{"key":"e_1_3_2_1_6_1","first-page":"167","volume-title":"SYMSAC '76, Proc. ACM Sympos. symbolic and algebraic computation","author":"Butler G.","year":"1976","unstructured":"G. Butler . The Schreier algorithm for matrix groups . In SYMSAC '76, Proc. ACM Sympos. symbolic and algebraic computation , pages 167 -- 170 , New York , 1976 . (New York, 1976), Association for Computing Machinery. G. Butler. The Schreier algorithm for matrix groups. In SYMSAC '76, Proc. ACM Sympos. symbolic and algebraic computation, pages 167--170, New York, 1976. (New York, 1976), Association for Computing Machinery."},{"key":"e_1_3_2_1_7_1","first-page":"663","article-title":"Computing in permutation and matrix groups I: Normal closure, commutator subgroups, series","volume":"39","author":"Butler G.","year":"1982","unstructured":"G. Butler and J. J. Cannon . Computing in permutation and matrix groups I: Normal closure, commutator subgroups, series . Math. Comp. , 39 : 663 -- 670 , 1982 . G. Butler and J. J. Cannon. Computing in permutation and matrix groups I: Normal closure, commutator subgroups, series. Math. Comp., 39:663--670, 1982.","journal-title":"Math. Comp."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1080\/00927879508825509"},{"volume-title":"International Conference. LNCS, Springer-Verlag","year":"1990","key":"e_1_3_2_1_9_1","unstructured":"Cooperman, Finkelstein, and Sarawagi. Applications of cayley graphs. In AAECC: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes , International Conference. LNCS, Springer-Verlag , 1990 . Cooperman, Finkelstein, and Sarawagi. Applications of cayley graphs. In AAECC: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, International Conference. LNCS, Springer-Verlag, 1990."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/525592.823067"},{"key":"e_1_3_2_1_11_1","first-page":"107","volume-title":"Centrum Wissenschaft Institut Quarterly (CWI)","author":"Cooperman G.","year":"1992","unstructured":"G. Cooperman and L. Finkelstein . Randomized algorithms for permutation groups . Centrum Wissenschaft Institut Quarterly (CWI) , pages 107 -- 125 , June 1992 . G. Cooperman and L. Finkelstein. Randomized algorithms for permutation groups. Centrum Wissenschaft Institut Quarterly (CWI), pages 107--125, June 1992."},{"key":"e_1_3_2_1_12_1","series-title":"Amer","first-page":"53","volume-title":"Groups and Computation","author":"Cooperman G.","year":"1991","unstructured":"G. Cooperman and L. Finkelstein . Combinatorial tools for computational group theory . In Groups and Computation , volume 11 of Amer . Math. Soc. DIMACS Series, pages 53 -- 86 . (DIMACS , 1991 ), 1993. G. Cooperman and L. Finkelstein. Combinatorial tools for computational group theory. In Groups and Computation, volume 11 of Amer. Math. Soc. DIMACS Series, pages 53--86. (DIMACS, 1991), 1993."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1994.1032"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/96877.96918"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1997.0146"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/190347.190384"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3540761691_3"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.1997.10504617"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8716-8_8"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/860854.860877"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/236869.236927"},{"volume-title":"Version 4.3","year":"2002","author":"The GAP Group. GAP - Groups","key":"e_1_3_2_1_22_1","unstructured":"The GAP Group. GAP - Groups , Algorithms, and Programming , Version 4.3 , 2002 . http:\/\/www.gap-system.org. The GAP Group. GAP - Groups, Algorithms, and Programming, Version 4.3, 2002. http:\/\/www.gap-system.org."},{"key":"e_1_3_2_1_23_1","first-page":"30","article-title":"A new existence proof for Ly, the sporadic simple group of R","author":"Gollan H.","year":"1995","unstructured":"H. Gollan . A new existence proof for Ly, the sporadic simple group of R . Lyons. Preprint 30 , 1995 . H. Gollan. A new existence proof for Ly, the sporadic simple group of R. Lyons. Preprint 30, 1995.","journal-title":"Lyons. Preprint"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.2000.1010"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8716-8_13"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-8716-8_14"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1515\/9783110872743.193","volume-title":"Groups and Computation III","author":"Havas G.","year":"2001","unstructured":"G. Havas , L. Soicher , and R. Wilson . A presentation for the Thompson sporadic simple group . In Groups and Computation III , pages 193 -- 200 , New York, 2001 . (Ohio, 1999), de Gruyter . G. Havas, L. Soicher, and R. Wilson. A presentation for the Thompson sporadic simple group. In Groups and Computation III, pages 193--200, New York, 2001. (Ohio, 1999), de Gruyter."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1112\/S0024610702003976"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90052-2"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1515\/9783110872743.229","volume-title":"Groups and Computation III","author":"Leedham-Green C.","year":"2001","unstructured":"C. Leedham-Green . The computational matrix group project . In Groups and Computation III , pages 229 -- 248 , New York, 2001 . (Ohio, 1999), de Gruyter . C. Leedham-Green. The computational matrix group project. In Groups and Computation III, pages 229--248, New York, 2001. (Ohio, 1999), de Gruyter."},{"key":"e_1_3_2_1_31_1","first-page":"474","volume-title":"Computer Algebra Handbook","author":"Leedham-Green C.","year":"2003","unstructured":"C. Leedham-Green , E. O'Brien , and C. Praeger . Recognising matrix groups. In J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors , Computer Algebra Handbook , pages 474 -- 475 , 2003 . C. Leedham-Green, E. O'Brien, and C. Praeger. Recognising matrix groups. In J. Grabmeier, E. Kaltofen, and V. Weispfenning, editors, Computer Algebra Handbook, pages 474--475, 2003."},{"key":"e_1_3_2_1_32_1","first-page":"307","article-title":"Computer construction of the Monster","volume":"1","author":"Linton S. A.","year":"1998","unstructured":"S. A. Linton , R. A. Parker , P. G. Walsh , and R. A. Wilson . Computer construction of the Monster . J. Group Theory , 1 : 307 -- 337 , 1998 . S. A. Linton, R. A. Parker, P. G. Walsh, and R. A. Wilson. Computer construction of the Monster. J. Group Theory, 1:307--337, 1998.","journal-title":"J. Group Theory"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1080\/10586458.2001.10504443"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579204"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1006\/jsco.1995.1033"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/800204.806264"},{"key":"e_1_3_2_1_37_1","first-page":"339","volume-title":"Finite simple groups II","author":"Sims C. C.","year":"1978","unstructured":"C. C. Sims . How to construct a baby monster . In M. Collins, editor, Finite simple groups II , pages 339 -- 345 . (Durham 1978 ), Academic Press , 1980. C. C. Sims. How to construct a baby monster. In M. Collins, editor, Finite simple groups II, pages 339--345. (Durham 1978), Academic Press, 1980."},{"first-page":"430","volume-title":"High Performance Computing in Science and Engineering '98","author":"Weller M.","key":"e_1_3_2_1_38_1","unstructured":"M. Weller . Construction of large permutation representations for matrix groups. In W. J. E. Krause, editor , High Performance Computing in Science and Engineering '98 , pages 430 --. Springer, 1999. M. Weller. Construction of large permutation representations for matrix groups. In W. J. E. Krause, editor, High Performance Computing in Science and Engineering '98, pages 430--. Springer, 1999."},{"key":"e_1_3_2_1_39_1","first-page":"463","article-title":"Construction of large permutation representations for matrix groups ii. Applicable Algebra in Engineering","volume":"11","author":"Weller M.","year":"2001","unstructured":"M. Weller . Construction of large permutation representations for matrix groups ii. Applicable Algebra in Engineering , Communication and Computing , 11 : 463 -- 488 , 2001 . M. Weller. Construction of large permutation representations for matrix groups ii. Applicable Algebra in Engineering, Communication and Computing, 11:463--488, 2001.","journal-title":"Communication and Computing"},{"volume-title":"Computer aided existence proof of Thompson's sporadic simple group. manuscript","year":"2003","author":"Weller M.","key":"e_1_3_2_1_40_1","unstructured":"M. Weller . Computer aided existence proof of Thompson's sporadic simple group. manuscript , 2003 . M. Weller. Computer aided existence proof of Thompson's sporadic simple group. manuscript, 2003."},{"key":"e_1_3_2_1_41_1","unstructured":"R. Wilson. Atlas of finite group representations. http:\/\/www.mat.bham.ac.uk\/atlas. R. Wilson. Atlas of finite group representations. http:\/\/www.mat.bham.ac.uk\/atlas."}],"event":{"name":"ISSAC06: International Symposium on Symbolic and Algebraic Computation","sponsor":["ACM Association for Computing Machinery","SIGSAM ACM Special Interest Group on Symbolic and Algebraic Manipulation"],"location":"Genoa Italy","acronym":"ISSAC06"},"container-title":["Proceedings of the 2006 international symposium on Symbolic and algebraic computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1145768.1145817","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T05:57:50Z","timestamp":1683525470000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1145768.1145817"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,7,9]]},"references-count":41,"alternative-id":["10.1145\/1145768.1145817","10.1145\/1145768"],"URL":"https:\/\/doi.org\/10.1145\/1145768.1145817","relation":{},"subject":[],"published":{"date-parts":[[2006,7,9]]},"assertion":[{"value":"2006-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}