{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T00:36:15Z","timestamp":1648946175837},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,2,1]],"date-time":"1990-02-01T00:00:00Z","timestamp":633830400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1990,2]]},"DOI":"10.1016\/0020-0190(90)90228-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:20:15Z","timestamp":1027642815000},"page":"43-46","source":"Crossref","is-referenced-by-count":0,"title":["The area-time complexity of the greatest common divisor problem: a lower bound"],"prefix":"10.1016","volume":"34","author":[{"given":"Carla Neaderhouser","family":"Purdy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George B.","family":"Purdy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(90)90228-P_BIB1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/358808.358814","article-title":"Information transfer and area-time tradeoffs for VLSI multiplication","volume":"23","author":"Abelson","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(90)90228-P_BIB2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01840437","article-title":"Area-time lowerbound techniques with applications to sorting","volume":"1","author":"Bilardi","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(90)90228-P_BIB3","series-title":"New Directions and Recent Results in Algorithms and Complexity","article-title":"Analysis of the binary Euclidean algorithm","author":"Brent","year":"1976"},{"key":"10.1016\/0020-0190(90)90228-P_BIB4","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","article-title":"The area-time complexity of binary multiplication","volume":"28","author":"Brent","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(90)90228-P_BIB5","series-title":"Tech. Rept. TR-CS-82-11","article-title":"A systolic algorithm for integer GCD computation","author":"Brent","year":"1982"},{"key":"10.1016\/0020-0190(90)90228-P_BIB6","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01840352","article-title":"On problem transformability in VLSI","volume":"2","author":"Hornick","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/0020-0190(90)90228-P_BIB7","first-page":"7","article-title":"Sublinear parallel algorithm for computing the greatest common divisor of two integers","author":"Kannan","year":"1984","journal-title":"Proc. 25th Annual IEEE Symposium on Foundations of Computer Science"},{"key":"10.1016\/0020-0190(90)90228-P_BIB8","series-title":"The Art of Computer Programming Vol. 2: Semi-numerical Algorithms","author":"Knuth","year":"1981"},{"key":"10.1016\/0020-0190(90)90228-P_BIB9","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(83)80061-8","article-title":"AT2-optimal VLSI integer multiplier with minimum computation time","volume":"58","author":"Mehlhorn","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(90)90228-P_BIB10","series-title":"A First Course in Abstract Algebra","author":"Paley","year":"1966"},{"key":"10.1016\/0020-0190(90)90228-P_BIB11","series-title":"VLSI Systems and Computations","article-title":"A mesh-connected area-time optimal VLSI integer multiplier","author":"Preparata","year":"1981"},{"key":"10.1016\/0020-0190(90)90228-P_BIB12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0898-1221(83)90133-5","article-title":"A carry-free algorithm for finding the greatest common divisor of two integers","volume":"9","author":"Purdy","year":"1983","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0020-0190(90)90228-P_BIB13","series-title":"Ph.D. Thesis","article-title":"Algorithms suitable for VLSI implementation","author":"Purdy","year":"1987"},{"key":"10.1016\/0020-0190(90)90228-P_BIB14","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090228P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909090228P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T08:54:03Z","timestamp":1555059243000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909090228P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,2]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,2]]}},"alternative-id":["002001909090228P"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(90)90228-p","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1990,2]]}}}