{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T19:36:41Z","timestamp":1725737801154},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389856"},{"type":"electronic","value":"9783642389863"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38986-3_7","type":"book-chapter","created":{"date-parts":[[2013,6,28]],"date-time":"2013-06-28T20:54:03Z","timestamp":1372452843000},"page":"70-83","source":"Crossref","is-referenced-by-count":5,"title":["Garbage-Free Reversible Constant Multipliers for Arbitrary Integers"],"prefix":"10.1007","author":[{"given":"Torben \u00c6gidius","family":"Mogensen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Axelsen, H.B., Thomsen, M.K.: Garbage-free integer multiplication by constants. In: Gl\u00fcck, R., Yokoyama, T. (eds.) Reversible Computation. LNCS, vol.\u00a07581, pp. 171\u2013182 (2012)","DOI":"10.1007\/978-3-642-36315-3_14"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-36315-3_13","volume-title":"Reversible Computation 2012","author":"S. Burignat","year":"2013","unstructured":"Burignat, S., Vermeirsch, K., De Vos, A., Thomsen, M.K.: Garbageless reversible implementation of integer linear transformations. In: Gl\u00fcck, R., Yokoyama, T. (eds.) RC 2012. LNCS, vol.\u00a07581, pp. 160\u2013170. Springer, Heidelberg (2013)"},{"key":"7_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/9783527633999","volume-title":"Reversible Computing","author":"A. Vos De","year":"2010","unstructured":"De Vos, A.: Reversible Computing. Wiley, Chichester (2010)"},{"issue":"5","key":"7_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1109\/TIT.1959.1057537","volume":"5","author":"D.A. Huffman","year":"1959","unstructured":"Huffman, D.A.: Canonical forms for information-lossless finite-state logical machines. IRE Transactions on Information Theory\u00a05(5), 41\u201359 (1959)","journal-title":"IRE Transactions on Information Theory"},{"issue":"5","key":"7_CR5","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"G.H. Mealy","year":"1955","unstructured":"Mealy, G.H.: A method for synthesizing sequential circuits. Bell System Technical Journal\u00a034(5), 1045\u20131079 (1955)","journal-title":"Bell System Technical Journal"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Rotenberg, E., Cranch, J., Thomsen, M.K., Axelsen, H.B.: Strength of the reversible, garbage-free 2\n                    k\n                   \u00b11 multiplier. In: Reversible Computation 2013 (2013)","DOI":"10.1007\/978-3-642-38986-3_5"},{"key":"7_CR7","unstructured":"Wikipedia. Mealy machine (2012), \n                    \n                      http:\/\/en.wikipedia.org\/wiki\/Mealy_machine"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38986-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T01:27:44Z","timestamp":1557883664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38986-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389856","9783642389863"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38986-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}