{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T13:24:00Z","timestamp":1726406640084},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515173"},{"type":"electronic","value":"9783540482079"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51517-8_134","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:04:38Z","timestamp":1330203878000},"page":"317-322","source":"Crossref","is-referenced-by-count":0,"title":["Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal form of polynomial matrices"],"prefix":"10.1007","author":[{"given":"Erich","family":"Kaltofen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. S.","family":"Krishnamoorthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B. David","family":"Saunders","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"55_CR1","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/0211057","volume":"11","author":"T. J. Chou","year":"1982","unstructured":"Chou, T. J. and Collins, G. E., \u201cAlgorithms for the solution of systems of diophantine linear equations,\u201d SIAM J. Comp., vol. 11, pp. 687\u2013708, 1982.","journal-title":"SIAM J. Comp."},{"key":"55_CR2","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/S0019-9958(85)80041-3","volume":"64","author":"S. A. Cook","year":"1985","unstructured":"Cook, S. A., \u201cA taxonomy of problems with fast parallel algorithms,\u201d Inf. Control, vol. 64, pp. 2\u201322, 1985.","journal-title":"Inf. Control"},{"key":"55_CR3","volume-title":"Worst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix","author":"C. S. Iliopoulos","year":"1986","unstructured":"Iliopoulos, C. S., \u201cWorst-case complexity bounds on algorithms for computing the canonical structure of finite Abelian groups and the Hermite and Smith normal forms of an integer matrix,\u201d Manuscript, Purdue Univ., 1986."},{"key":"55_CR4","doi-asserted-by":"crossref","unstructured":"Kaltofen, E., Krishnamoorthy, M. S., and Saunders, B. D., \u201cFast parallel algorithms for similarity of matrices,\u201d Proc. 1986 ACM Symp. Symbolic Algebraic Comp., pp. 65\u201370, 1986.","DOI":"10.1145\/32439.32452"},{"key":"55_CR5","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/0608057","volume":"8","author":"E. Kaltofen","year":"1987","unstructured":"Kaltofen, E., Krishnamoorthy, M. S., and Saunders, B. D., \u201cFast parallel computation of Hermite and Smith forms of polynomial matrices,\u201d SIAM J. Alg. Discrete Meth., vol. 8, pp. 683\u2013690, 1987.","journal-title":"SIAM J. Alg. Discrete Meth."},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0304-3975(85)90131-8","volume":"39","author":"R. Kannan","year":"1985","unstructured":"Kannan, R., \u201cPolynomial-time algorithms for solving systems of linear equations over polynomials,\u201d Theoretical Comp. Sci., vol. 39, pp. 69\u201388, 1985.","journal-title":"Theoretical Comp. Sci."},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1137\/0208040","volume":"8","author":"R. Kannan","year":"1981","unstructured":"Kannan, R. and Bachem, A., \u201cPolynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix,\u201d SIAM J. Comp., vol. 8, pp. 499\u2013507, 1981.","journal-title":"SIAM J. Comp."},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"MacDuffee, C. C., Vectors and Matrices, Math. Assoc. America, 1943.","DOI":"10.5948\/UPO9781614440079"},{"key":"55_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K., \u201cA fast parallel algorithm to compute the rank of a matrix over an arbitrary field,\u201d Combinatorica, vol. 7, pp. 101\u2013104, 1987.","journal-title":"Combinatorica"},{"key":"55_CR10","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"J. T. Schwartz","year":"1980","unstructured":"Schwartz, J. T., \u201cFast probabilistic algorithms for verification of polynomial identities,\u201d J. ACM, vol. 27, pp. 701\u2013717, 1980.","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Eurocal '87"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51517-8_134.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:03:59Z","timestamp":1619571839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51517-8_134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515173","9783540482079"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-51517-8_134","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}