{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:08:06Z","timestamp":1725566886056},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540328803"},{"type":"electronic","value":"9783540328810"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11685654_14","type":"book-chapter","created":{"date-parts":[[2006,3,10]],"date-time":"2006-03-10T13:49:06Z","timestamp":1141998546000},"page":"313-347","source":"Crossref","is-referenced-by-count":2,"title":["On Teaching Fast Adder Designs: Revisiting Ladner & Fischer"],"prefix":"10.1007","author":[{"given":"Guy","family":"Even","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TC.1982.1675982","volume":"-31","author":"R.P. Brent","year":"1982","unstructured":"Brent, R.P., Kung, H.T.: Regular Layout for Parallel Adders. IEEE Trans. Comp.\u00a0C-31(3), 260\u2013264 (1982), Available online at http:\/\/web.comlab.ox.ac.uk\/oucl\/work\/richard.brent\/pd\/rpb060.pdf","journal-title":"IEEE Trans. Comp. C"},{"key":"14_CR2","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. The MIT Press, Cambridge (1990)"},{"key":"14_CR3","volume-title":"Digital Arithmetic","author":"M.D. Ercegovac","year":"2004","unstructured":"Ercegovac, M.D., Lang, T.: Digital Arithmetic. Morgan Kaufmann, San Francisco (2004)"},{"key":"14_CR4","volume-title":"Graph Algorithms","author":"S. Even","year":"1979","unstructured":"Even, S.: Graph Algorithms. Computer Science Press, Rockville (1979)"},{"unstructured":"Even, G.: Lecture Notes in Computer Structure. manuscript (2004)","key":"14_CR5"},{"key":"14_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-1-4613-9323-8_14","volume-title":"Sequences II, Methods in Communication, Security and Computer Sciences","author":"S. Even","year":"1993","unstructured":"Even, S., Litman, A.: A systematic design and explanation of the Atrubin multiplier. In: Capocelli, R., et al. (eds.) Sequences II, Methods in Communication, Security and Computer Sciences, pp. 189\u2013202. Springer, Heidelberg (1993)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01187090","volume":"27","author":"S. Even","year":"1994","unstructured":"Even, S., Litman, A.: On the capabilities of systolic systems. Mathematical Systems Theory\u00a027, 3\u201328 (1994)","journal-title":"Mathematical Systems Theory"},{"key":"14_CR8","volume-title":"Introduction to automata theory, languages, and computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to automata theory, languages, and computation. Addison Wesley, Reading (1979)"},{"doi-asserted-by":"crossref","unstructured":"Knowles, S.: A Family of Adders. In: Proceedings of the 14th IEEE Symposium on Computer Arithmetic, pp. 30\u201334 (1999) (Note that the figures in the published proceedings are wrong)","key":"14_CR9","DOI":"10.1109\/ARITH.1999.762825"},{"key":"14_CR10","volume-title":"Computer Arithmetic Algorithms","author":"I. Koren","year":"1993","unstructured":"Koren, I.: Computer Arithmetic Algorithms. Prentice-Hall, Englewood Cliffs (1993)"},{"unstructured":"Kornerup, P.: Chapter 2 on Radix Integer Addition. manuscript (1997)","key":"14_CR11"},{"key":"14_CR12","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. Ladner","year":"1980","unstructured":"Ladner, R., Fischer, M.: Parallel prefix computation. J. Assoc. Comput. Mach.\u00a027, 831\u2013838 (1980)","journal-title":"J. Assoc. Comput. Mach."},{"key":"14_CR13","volume-title":"Introduction to parallel algorithms and architectures: array, trees, hypercubes","author":"F. Thomson Leighton","year":"1991","unstructured":"Thomson Leighton, F.: Introduction to parallel algorithms and architectures: array, trees, hypercubes. Morgan Kaufmann, San Francisco (1991)"},{"key":"14_CR14","first-page":"41","volume":"1","author":"C.E. Leiserson","year":"1983","unstructured":"Leiserson, C.E., Saxe, J.B.: Optimizing synchronous systems. Journal of VLSI and Computer Systems\u00a01, 41\u201367 (1983) (Also appeared in Twenty- Second Annual Symposium on Foundations of Computer Science, pp. 23-36, 1981)","journal-title":"Journal of VLSI and Computer Systems"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01759032","volume":"6","author":"C.E. Leiserson","year":"1991","unstructured":"Leiserson, C.E., Saxe, J.B.: Retiming synchronous circuitry. Algorithmica\u00a06(1), 5\u201335 (1991)","journal-title":"Algorithmica"},{"key":"14_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04267-0","volume-title":"Computer Architecture: complexity and correctness","author":"S.M. M\u00fcller","year":"2000","unstructured":"M\u00fcller, S.M., Paul, W.J.: Computer Architecture: complexity and correctness. Springer, Heidelberg (2000)"},{"key":"14_CR17","first-page":"589","volume":"7","author":"Y. Ofman","year":"1963","unstructured":"Ofman, Y.: On the algorithmic complexity of discrete functions. Sov. Phys. Dokl.\u00a07, 589\u2013591 (1963)","journal-title":"Sov. Phys. Dokl."},{"unstructured":"Shiloach, Y.: Linear and planar arrangements of graphs, Ph.D. thesis, Dept. of Applied Mathematics, Weizmann Institute (1976)","key":"14_CR18"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1109\/TEC.1960.5219821","volume":"EC-9","author":"J. Sklansky","year":"1960","unstructured":"Sklansky, J.: An evaluation of several two-summand binary adders. IRE Trans. on Electronic Computers\u00a0EC-9, 213\u2013226 (1960)","journal-title":"IRE Trans. on Electronic Computers"},{"unstructured":"Thompson, C.D.: A Complexity Theory For VLSI, PhD Thesis, Carnegie Mellon University (1980)","key":"14_CR20"},{"key":"14_CR21","first-page":"3","volume":"591","author":"A. Weinberger","year":"1958","unstructured":"Weinberger, A., Smith, J.L.: A logic for high-speed addition. Nat. Bur. Stand. Circ.\u00a0591, 3\u201312 (1958)","journal-title":"Nat. Bur. Stand. Circ."},{"unstructured":"Zimmermann, R.: Binary Adder Architectures for Cell-Based VLSI and their Synthesis, PhD thesis, Swiss Federal Institute of Technology (ETH) Zurich, Hartung-Gorre Verlag (1998), Available online at http:\/\/www.iis.ee.ethz.ch\/~zimmi\/","key":"14_CR22"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11685654_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:29Z","timestamp":1605643529000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11685654_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540328803","9783540328810"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11685654_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}