{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:51:41Z","timestamp":1725663101514},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540167662"},{"type":"electronic","value":"9783540387466"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16766-8_6","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T18:54:37Z","timestamp":1330196077000},"page":"57-69","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Optimal tradeoffs for addition on systolic arrays"],"prefix":"10.1007","author":[{"given":"Alok","family":"Aggarwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Lawrence","family":"Carter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. Rao","family":"Kosaraju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"A. Aggarwal, J. L. Carter and S. R. Kosaraju, \"Optimal Tradeoffs for Addition on Systolic Arrays,\" Manuscript, 1986.","DOI":"10.1007\/3-540-16766-8_6"},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"M. J. Atallah and S. R. Kosaraju, \"Graph Problems on a Mesh Connected Processor Array,\" Proc. Fourteenth ACM Symposium on the Theory of Computing, pp. 345\u2013353, 1982.","DOI":"10.1145\/800070.802210"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1109\/PGEC.1965.264145","volume":"3","author":"A. Atrubin","year":"1965","unstructured":"A. Atrubin, \"A One-Dimensional Real Time Iterative Multiplier,\" IEEE Trans. on Computers, Vol. 3, pp. 394\u2013399, 1965.","journal-title":"IEEE Trans. on Computers"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"G. M. Baudet, \"On The Area required by VLSI Circuits,\" CMU Conf. on VLSI Systems and Computations, Computer Science Press, pp. 100\u2013107, 1981.","DOI":"10.1007\/978-3-642-68402-9_12"},{"key":"6_CR5","unstructured":"G. Bilardi and F. P. Preparata, \"Area-time Lower Bound Techniques with Applications to Sorting,\" Tech. Report, Univ. of Illinois, Urbana Champaign, 1985."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"B. M. Chazelle and L. Monier, \"A Model of Computation for VLSI with Related Complexity Results,\" Proc. Thirteenth ACM Symposium on the Theory of Computing, pp. 318\u2013325, 1981.","DOI":"10.1145\/800076.802485"},{"key":"6_CR7","unstructured":"B.M. Chazelle and L. Monier, \"Optimality in VLSI,\" Proc. First International Conference on VLSI, pp. 269\u2013278, 1981."},{"key":"6_CR8","unstructured":"L. Guibas, H. T. Kung, and C. D. Thompson, \"Direct VLSI Implementation of Combinatorial Algorithms,\" Proc. Caltech Conference on VLSI, pp. 309\u2013325, 1979."},{"issue":"2","key":"6_CR9","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/0020-0190(80)90010-1","volume":"11","author":"R. B. Johnson","year":"1980","unstructured":"R. B. Johnson, \"The Complexity of a VLSI Adder,\" Information Processing Letters, Vol. 11, No. 2, pp. 92\u201393, 1980.","journal-title":"Information Processing Letters"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/0204028","volume":"4","author":"S. R. Kosaraju","year":"1975","unstructured":"S. R. Kosaraju, \"Speed of Recognition of Context-Free Languages by Array Automata,\" SIAM J. of Computing, Vol. 4, pp. 331\u2013340, 1975.","journal-title":"SIAM J. of Computing"},{"key":"6_CR11","unstructured":"H. T. Kung and C. Leiserson, \"Algorithms for VLSI Processor Arrays,\" Symp. on Sparse Matrix Computations. Knoxville, Tennesse, 1981."},{"issue":"4","key":"6_CR12","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fischer, \"Parallel Prefix Computation,\" J. of ACM, Vol. 27, No. 4, pp. 831\u2013838, 1980.","journal-title":"J. of ACM"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"R. J. Lipton and R. Sedgewick, \"Lower Bounds for VLSI,\" Proc. Thirteenth ACM Symposium on the Theory of Computing, pp. 300\u2013307, 1981.","DOI":"10.1145\/800076.802482"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"C. D. Thompson, \"Area-Time Complexity for VLSI,\" Proc. Eleventh ACM Symposium on the Theory of Computing, pp. 81\u201388, 1980.","DOI":"10.1145\/800135.804401"},{"key":"6_CR15","unstructured":"J. D. Ullman, \"Computational Aspects of VLSI,\" Computer Science Press, 1984."}],"container-title":["Lecture Notes in Computer Science","VLSI Algorithms and Architectures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16766-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:50:49Z","timestamp":1578527449000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16766-8_6"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540167662","9783540387466"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-16766-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"1 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}