{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:13:38Z","timestamp":1725516818222},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540697329"},{"type":"electronic","value":"9783540697336"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69733-6_9","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"82-91","source":"Crossref","is-referenced-by-count":0,"title":["A Sublinear Time Randomized Algorithm for Coset Enumeration in the Black Box Model"],"prefix":"10.1007","author":[{"given":"Bin","family":"Fu","sequence":"first","affiliation":[]},{"given":"Zhixiang","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L.: Local Expansion of Vertex-Transitive Graphs and Random Generation in Finite Groups. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pp. 164\u2013174 (1991)","DOI":"10.1145\/103418.103440"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"449","DOI":"10.2307\/2005648","volume":"27","author":"J.J. Cannon","year":"1973","unstructured":"Cannon, J.J., Dimino, L.A., Havas, G., Watson, J.M.: Implementation and Analysis of the Todd-Coxeter Algorithm. Math. Comput.\u00a027, 449\u2013463 (1973)","journal-title":"Math. Comput."},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"4931","DOI":"10.1080\/00927879508825509","volume":"23","author":"F. Celler","year":"1995","unstructured":"Celler, F., Leedham-Green, C.R., Murray, S.H., Niemeyer, A.C., O\u2019Brien, E.A.: Generating Random Elements of a Finite Group. Comm. Algebra\u00a023, 4931\u20134948 (1995)","journal-title":"Comm. Algebra"},{"key":"9_CR5","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. 2nd edn. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"9_CR6","unstructured":"Havas, G., Lian, J.X.: New Implementations of Coset Enumeration. Technical Report, Department of Computer Science, University of Queensland (1991)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1017\/S0305004100036872","volume":"59","author":"J. Leech","year":"1963","unstructured":"Leech, J.: Coset Enumeration on Digital Computers. Proc. Cambridge Philos. Soc.\u00a059, 257\u2013267 (1963)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"9_CR8","first-page":"1","volume":"71","author":"J. Neubuser","year":"1982","unstructured":"Neubuser, J.: An Elementary Introduction to Coset-Table Methods in Computational Group Theory. London Math. Soc. Lecture Note Ser.\u00a071, 1\u201345 (1982)","journal-title":"London Math. Soc. Lecture Note Ser."},{"key":"9_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511574702","volume-title":"Computation with Finitely Presented Groups","author":"C. Sims","year":"1994","unstructured":"Sims, C.: Computation with Finitely Presented Groups. Cambridge University Press, Cambridge (1994)"},{"key":"9_CR10","volume-title":"Cryptography and Network Security","author":"W. Stallings","year":"2005","unstructured":"Stallings, W.: Cryptography and Network Security. Prentice Hall, Englewood Cliffs (2005)"},{"key":"9_CR11","first-page":"584","volume":"5","author":"J.A. Todd","year":"1936","unstructured":"Todd, J.A., Coxeter, H.S.M.: A Practical Method for Enumerating Cosets of a Finite Abstract Group. Proc. Edinburg Math. Ann.\u00a05, 584\u2013594 (1936)","journal-title":"Proc. Edinburg Math. Ann."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69733-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:45:00Z","timestamp":1620002700000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69733-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540697329","9783540697336"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69733-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}