{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T14:34:46Z","timestamp":1774967686798,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T00:00:00Z","timestamp":1442880000000},"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":["Algorithmica"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s00453-015-0067-x","type":"journal-article","created":{"date-parts":[[2015,9,22]],"date-time":"2015-09-22T09:39:40Z","timestamp":1442914780000},"page":"287-308","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Fast Prefix Adders for Non-uniform Input Arrival Times"],"prefix":"10.1007","volume":"77","author":[{"given":"Stephan","family":"Held","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2536-5618","authenticated-orcid":false,"given":"Sophie","family":"Spirkl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,22]]},"reference":[{"key":"67_CR1","unstructured":"Choi, Y.: Parallel Prefix Adder Design. Dissertation, University of Texas at Austin (2004)"},{"issue":"3","key":"67_CR2","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1016\/0890-5401(89)90036-9","volume":"81","author":"R Cole","year":"1989","unstructured":"Cole, R., Vishkin, U.: Faster optimal parallel prefix sums and list ranking. Inf. Comput. 81(3), 334\u2013352 (1989)","journal-title":"Inf. Comput."},{"key":"67_CR3","doi-asserted-by":"crossref","unstructured":"Keeter, M., Harris, D.M., Macrae, A., Glick, R., Ong, M., Schauer, J.: Implementation of 32-bit Ling and Jackson adders. In: Proceedings of the Forty Fifth Asilomar Conference on Signals, Systems and Computers, pp. 170\u2013175 (2011)","DOI":"10.1109\/ACSSC.2011.6189978"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Knowles, S.: A family of adders. In: Proceedings of the 15th IEEE Symposium on Computer Arithmetic (ARITH-15), pp. 277\u2013281 (2001)","DOI":"10.1109\/ARITH.2001.930129"},{"issue":"8","key":"67_CR5","doi-asserted-by":"crossref","first-page":"786","DOI":"10.1109\/TC.1973.5009159","volume":"100","author":"PM Kogge","year":"1973","unstructured":"Kogge, P.M., Stone, H.S.: A parallel algorithm for the efficient solution of a general class of recurrence equations. IEEE Trans. Comput. 100(8), 786\u2013793 (1973)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"67_CR6","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"RE Ladner","year":"1980","unstructured":"Ladner, R.E., Fischer, M.J.: Parallel prefix computation. J. ACM 27(4), 831\u2013838 (1980)","journal-title":"J. ACM"},{"key":"67_CR7","doi-asserted-by":"crossref","unstructured":"Oklobdzija, V.G.: Design and analysis of fast carry-propagate adder under non-equal input signal arrival profile. In: Proceedings of the Twenty-Eighth Asilomar Conference on Signals, Systems and Computers, vol. 2, pp. 1398\u20131401 (1994)","DOI":"10.1109\/ACSSC.1994.471687"},{"issue":"4","key":"67_CR8","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1016\/j.jda.2005.06.006","volume":"4","author":"D Rautenbach","year":"2006","unstructured":"Rautenbach, D., Szegedy, C., Werber, J.: Delay optimization of linear depth Boolean circuits with prescribed input arrival times. J. Discrete Algorithms 4(4), 526\u2013537 (2006)","journal-title":"J. Discrete Algorithms"},{"issue":"10","key":"67_CR9","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1016\/j.dam.2006.10.013","volume":"155","author":"D Rautenbach","year":"2007","unstructured":"Rautenbach, D., Szegedy, C., Werber, J.: The delay of circuits whose inputs have specified arrival times. Discrete Appl. Math. 155(10), 1233\u20131243 (2007)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"67_CR10","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1016\/j.ejc.2007.02.014","volume":"29","author":"D Rautenbach","year":"2008","unstructured":"Rautenbach, D., Szegedy, C., Werber, J.: On the cost of optimal alphabetic code trees with unequal letter costs. Eur. J. Comb. 29(2), 386\u2013394 (2008)","journal-title":"Eur. J. Comb."},{"issue":"10","key":"67_CR11","doi-asserted-by":"crossref","first-page":"1517","DOI":"10.1109\/TCAD.2014.2341926","volume":"33","author":"S Roy","year":"2014","unstructured":"Roy, S., Choudhury, M., Puri, R., Pan, D.Z.: Towards optimal performance-area trade-off in adders by synthesis of parallel prefix structures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 33(10), 1517\u20131530 (2014)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"67_CR12","doi-asserted-by":"crossref","unstructured":"Roy, S., Choudhury, M., Puri, R., Pan, D.Z.: Polynomial time algorithm for area and power efficient adder synthesis in high-performance designs. In: Proceedings of the 20th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 249\u2013254 (2015)","DOI":"10.1109\/ASPDAC.2015.7059013"},{"key":"67_CR13","first-page":"3","volume":"591","author":"A Weinberger","year":"1958","unstructured":"Weinberger, A., Smith, J.L.: A logic for high-speed addition. Natl. Bur. Stand. Circul. 591, 3\u201312 (1958)","journal-title":"Natl. Bur. Stand. Circul."},{"key":"67_CR14","doi-asserted-by":"crossref","unstructured":"Werber, J., Rautenbach, D., Szegedy, C.: Timing optimization by restructuring long combinatorial paths. In: Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 536\u2013543 (2007)","DOI":"10.1109\/ICCAD.2007.4397320"},{"key":"67_CR15","unstructured":"Zimmermann, R.: Binary Adder Architectures for Cell-Based VLSI and Their Synthesis. Dissertation, Swiss Federal Institute of Technology (ETH) in Zurich (1998)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0067-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-015-0067-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0067-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-015-0067-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T19:47:22Z","timestamp":1559072842000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-015-0067-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,22]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["67"],"URL":"https:\/\/doi.org\/10.1007\/s00453-015-0067-x","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,22]]}}}