{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:13:21Z","timestamp":1725664401277},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584308"},{"type":"electronic","value":"9783540487890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58430-7_22","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:02:50Z","timestamp":1330272170000},"page":"241-252","source":"Crossref","is-referenced-by-count":0,"title":["Systolic algorithms for long integer GCD computation"],"prefix":"10.1007","author":[{"given":"Tudor","family":"Jebelean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"R. P. Brent and H. T. Kung. A systolic algorithm for integer GCD computation. In K. Hwang, editor, Procs. of the 7th Symp. on Computer Arithmetic, pages 118\u2013125. IEEE Computer Society, June 1985.","DOI":"10.1109\/ARITH.1985.6158931"},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01840374","volume":"5","author":"B. Chor","year":"1990","unstructured":"B. Chor and O. Goldreich. An improved parallel algorithm for integer GCD. Algorithmica, 5:1\u201310, 1990.","journal-title":"Algorithmica"},{"key":"22_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/0203001","volume":"3","author":"G. E. Collins","year":"1974","unstructured":"G. E. Collins. The computing time of the Euclidean algorithm. SIAM Journal on Computing, 3:1\u201310, 1974.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR4","first-page":"111","volume-title":"A Generalization of the Binary GCD Algorithm","author":"T. Jebelean","year":"1993","unstructured":"T. Jebelean. A Generalization of the Binary GCD Algorithm. In M. Bronstein, editor, ISSAC'93: International Symposium on Symbolic and Algebraic Computation, pages 111\u2013116, Kiev, Ukraine, July 1993. ACM Press."},{"issue":"2","key":"22_CR5","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1006\/jsco.1993.1012","volume":"15","author":"T. Jebelean","year":"1993","unstructured":"T. Jebelean. An Algorithm for Exact Division. Journal of Symbolic Computation, 15(2):169\u2013180, February 1993.","journal-title":"Journal of Symbolic Computation"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"T. Jebelean. Comparing Several GCD Algorithms. In ARITH-11: IEEE Symposium on Computer Arithmetic, pages 180\u2013185, Windsor, Canada, June 1993.","DOI":"10.1109\/ARITH.1993.378094"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"T. Jebelean. Improving the multiprecision Euclidean algorithm. In DISCO'93: International Symposium on Design and Implementation of Symbolic Computation Systems, pages 45\u201358, Gmunden, Austria, September 1993. Springer Verlag LNCS 722.","DOI":"10.1007\/BFb0013167"},{"key":"22_CR8","unstructured":"Tudor Jebelean. Systolic Multiprecision Arithmetic. PhD thesis, RISC-Linz, April 1994."},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0216002","volume":"16","author":"R. Kannan","year":"1987","unstructured":"R. Kannan, G. Miller, and L. Rudolph. Sublinear parallel algorithm for computing the greatest common divisor of two integers. SIAM Journal on Computing, 16:7\u201316, 1987.","journal-title":"SIAM Journal on Computing"},{"key":"22_CR10","unstructured":"D. E. Knuth. The art of computer programming, volume 2. Addison-Wesley, 2 edition, 1981."},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1109\/MC.1982.1653825","volume":"15","author":"H. T. Kung","year":"1982","unstructured":"H. T. Kung. Why systolic architectures? Computer, 15:37\u201346, 1982.","journal-title":"Computer"},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1080\/00029890.1938.11990797","volume":"45","author":"D. H. Lehmer","year":"1938","unstructured":"D. H. Lehmer. Euclid's algorithm for large numbers. Am. Math. Mon., 45:227\u2013233, 1938.","journal-title":"Am. Math. Mon."},{"key":"22_CR13","unstructured":"C. E. Leiserson. Area-efficient VLSI computation. PhD thesis, Carnegie-Mellon University, 1982."},{"key":"22_CR14","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0898-1221(83)90133-5","volume":"9","author":"G. B. Purdy","year":"1983","unstructured":"G. B. Purdy. A carry-free algorithm for finding the greatest common divisor of two integers. Computers & Mathematics with Applications, 9:311\u2013316, 1983.","journal-title":"Computers & Mathematics with Applications"},{"key":"22_CR15","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00289520","volume":"1","author":"A. Sch\u00f6nhage","year":"1971","unstructured":"A. Sch\u00f6nhage. Schnelle Berechung von Kettenbruchentwicklugen. Acta Informatica, 1:139\u2013144, 1971.","journal-title":"Acta Informatica"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"J. Sorenson. Two fast GCD algorithms. Submitted to J. of Algorithms, 1993.","DOI":"10.1006\/jagm.1994.1006"},{"key":"22_CR17","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1016\/0021-9991(67)90047-2","volume":"1","author":"J. Stein","year":"1967","unstructured":"J. Stein. Computational problems associated with Racah algebra. J. Comp. Phys., 1:397\u2013405, 1967.","journal-title":"J. Comp. Phys."},{"key":"22_CR18","unstructured":"Ken Weber. The accelerated integer GCD algorithm. Technical report, Kent State University, 1993. To appear in ACM Trans. on Math. Software."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing: CONPAR 94 \u2014 VAPP VI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58430-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:20:43Z","timestamp":1605648043000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58430-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584308","9783540487890"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-58430-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}