乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:28:00Z","timestamp":1742912880313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319599359"},{"type":"electronic","value":"9783319599366"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-59936-6_7","type":"book-chapter","created":{"date-parts":[[2017,5,24]],"date-time":"2017-05-24T15:12:32Z","timestamp":1495638752000},"page":"90-101","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["REVS: A Tool for Space-Optimized Reversible Circuit Synthesis"],"prefix":"10.1007","author":[{"given":"Alex","family":"Parent","sequence":"first","affiliation":[]},{"given":"Martin","family":"Roetteler","sequence":"additional","affiliation":[]},{"given":"Krysta M.","family":"Svore","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,25]]},"reference":[{"key":"7_CR1","unstructured":"Revlib - an online resource for reversible functions and circuits. http:\/\/www.revlib.org\/"},{"key":"7_CR2","volume-title":"Compilers: Principles, Techniques, and Tools","author":"AV Aho","year":"2007","unstructured":"Aho, A.V., Lam, M.S., Sethi, R., Ullman, J.D.: Compilers: Principles, Techniques, and Tools. Addison Wesley, London (2007)"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1147\/rd.176.0525","volume":"17","author":"CH Bennett","year":"1973","unstructured":"Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525\u2013532 (1973)","journal-title":"IBM J. Res. Dev."},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1137\/0218053","volume":"18","author":"CH Bennett","year":"1989","unstructured":"Bennett, C.H.: Time\/space trade-offs for reversible computation. SIAM J. Comput. 18, 766\u2013776 (1989)","journal-title":"SIAM J. Comput."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1007\/3-540-48224-5_82","volume-title":"Automata, Languages and Programming","author":"H Buhrman","year":"2001","unstructured":"Buhrman, H., Tromp, J., Vit\u00e1nyi, P.: Time and space bounds for reversible simulation. In: Orejas, F., Spirakis, P.G., Leeuwen, J. (eds.) ICALP 2001. LNCS, vol. 2076, pp. 1017\u20131027. Springer, Heidelberg (2001). doi: 10.1007\/3-540-48224-5_82"},{"key":"7_CR6","unstructured":"Pebble games and complexity. Ph.D. thesis, Electrical Engineering and Computer Science, UC Berkeley, Technical report: EECS-2013-145 (2013)"},{"key":"7_CR7","unstructured":"Chattopadhyay, A., Pal, N., Majumder, S.: Ancilla-quantum cost trade-off during reversible logic synthesis using exclusive sum-of-products (2014). arxiv:1405.6073"},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1137\/S089548019325232X","volume":"9","author":"O Goldschmidt","year":"1996","unstructured":"Goldschmidt, O., Hochbaum, D.S., Hurkens, C.A.J., Yu, G.: Approximation algorithms for the $$k$$ -clique covering problem. SIAM J. Disc. Math. 9(3), 492\u2013509 (1996)","journal-title":"SIAM J. Disc. Math."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Green, A., LeFanu Lumsdaine, P., Ross, N., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. In: PLDI 2013 (2013)","DOI":"10.1145\/2491956.2462177"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Heckey, J., Patil, S., Javadi Abhari, A., Holmes, A., Kudrow, D., Brown, K.R., Franklin, D., Chong, F.T., Martonosi, M.: Compiler management of communication and parallelism for quantum computation. In: ASPLOS 2015, pp. 445\u2013456. ACM (2015)","DOI":"10.1145\/2775054.2694357"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.parco.2014.12.001","volume":"45","author":"A JavadiAbhari","year":"2015","unstructured":"JavadiAbhari, A., Patil, S., Kudrow, D., Heckey, J., Lvov, A., Chong, F.T., Martonosi, M.: ScaffCC: scalable compilation and analysis of quantum programs. Parallel Comput. 45, 2\u201317 (2015)","journal-title":"Parallel Comput."},{"issue":"2","key":"7_CR12","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1006\/jcss.1999.1672","volume":"60","author":"KJ Lange","year":"2000","unstructured":"Lange, K.J., McKenzie, P., Tapp, A.: Reversible space equals deterministic space. J. Comput. Syst. Sci. 60(2), 354\u2013367 (2000)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/2564923","volume":"10","author":"C-C Lin","year":"2014","unstructured":"Lin, C.-C., Jha, N.K.: RMDDS: Reed-Muller decision diagram synthesis of reversible logic circuits. ACM J. Emerg. Technol. Comput. Syst. 10(2), 14 (2014)","journal-title":"ACM J. Emerg. Technol. Comput. Syst."},{"key":"7_CR14","unstructured":"Maslov, D.: Reversible logic synthesis benchmarks page. http:\/\/webhome.cs.uvic.ca\/~dmaslov\/"},{"issue":"4","key":"7_CR15","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/1278349.1278355","volume":"12","author":"D Maslov","year":"2007","unstructured":"Maslov, D., Miller, D.M., Dueck, G.W.: Techniques for the synthesis of reversible Toffoli networks. ACM Trans. Des. Autom. Electron. Syst. 12(4), 42 (2007)","journal-title":"ACM Trans. Des. Autom. Electron. Syst."},{"key":"7_CR16","unstructured":"Minkovich, K.: BLIF benchmark suite. http:\/\/cadlab.cs.ucla.edu\/~kirill\/"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Mishchenko, A., Brayton, R., Chatterjee, S.: Boolean factoring and decomposition of logic networks. In: Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design, pp. 38\u201344. IEEE Press (2008)","DOI":"10.1109\/ICCAD.2008.4681549"},{"key":"7_CR18","unstructured":"Mishchenko, A., Perkowski, M.: Fast heuristic minimization of exclusive sum-of-products, 2001. Exorcism is available as part of the ABC software. https:\/\/people.eecs.berkeley.edu\/~alanmi\/"},{"key":"7_CR19","volume-title":"Compiler Design and Implementation","author":"SS Muchnick","year":"1997","unstructured":"Muchnick, S.S.: Compiler Design and Implementation. Morgan Kaufmann, San Francisco (1997)"},{"key":"7_CR20","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"7_CR21","unstructured":"Parent, A., Parker, J., Burns, M., Maslov, D.: Quantum Circuit Viewer. Poster presentation at TQC 2013, University of Guelph, Canada. Software (2013). https:\/\/github.com\/aparent\/QCViewer , http:\/\/qcirc.iqc.uwaterloo.ca\/"},{"key":"7_CR22","unstructured":"Parent, A., Roetteler, M., Svore, K.M.: Reversible circuit compilation with space constraints (2015). arXiv:1510.00377"},{"key":"7_CR23","volume-title":"Introduction to Reversible Computing","author":"KS Perumalla","year":"2014","unstructured":"Perumalla, K.S.: Introduction to Reversible Computing. CRC Press, Boca Raton (2014)"},{"issue":"5&6","key":"7_CR24","doi-asserted-by":"crossref","first-page":"361","DOI":"10.26421\/QIC12.5-6-1","volume":"12","author":"M Saeedi","year":"2012","unstructured":"Saeedi, M., Markov, I.L.: Constant-optimized quantum circuits for modular multiplication and exponentiation. Quantum Information and Computation 12(5&6), 361\u2013394 (2012)","journal-title":"Quantum Information and Computation"},{"issue":"2","key":"7_CR25","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1145\/2431211.2431220","volume":"45","author":"M Saeedi","year":"2013","unstructured":"Saeedi, M., Markov, I.L.: Synthesis and optimization of reversible circuits - a survey. ACM Comput. Surv. 45(2), 21 (2013)","journal-title":"ACM Comput. Surv."},{"key":"7_CR26","unstructured":"Shafaei, A., Saeedi, M., Pedram, M.: Reversible logic synthesis of $$k$$ -input, $$m$$ -output lookup tables. In: DATE 2013, pp. 1235\u20131240 (2013)"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Soeken, M., Robert Wille, R., Hilken, Ch., Przigoda, N., Drechsler, R.: Synthesis of reversible circuits with minimal lines for large functions. In: Proceedings of ASP-DAC 2012 (2012)","DOI":"10.1109\/ASPDAC.2012.6165069"},{"key":"7_CR28","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4302-4651-0","volume-title":"Expert F $$\\#$$ 3.0","author":"D Syme","year":"2012","unstructured":"Syme, D., Granicz, A., Cisternino, A.: Expert F $$\\#$$ 3.0. Apress Publishing, New York (2012)"},{"key":"7_CR29","unstructured":"Thomsen, M.K.: A functional language for describing reversible logic. In: Forum on Specification and Design Languages, pp. 135\u2013142. IEEE (2012)"},{"key":"7_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-3065-8","volume-title":"Quantum Circuit Simulation","author":"GF Viamontes","year":"2009","unstructured":"Viamontes, G.F., Markov, I.L., Hayes, J.P.: Quantum Circuit Simulation. Springer, Heidelberg (2009)"},{"key":"7_CR31","doi-asserted-by":"crossref","unstructured":"Wille, R., Drechsler, R.: BDD-based synthesis of reversible logic for large functions. In: Proceedings of DAC 2009, pp. 270\u2013275 (2009)","DOI":"10.1145\/1629911.1629984"},{"key":"7_CR32","doi-asserted-by":"publisher","DOI":"10.1007\/978-90-481-9579-4","volume-title":"Towards a Design Flow for Reversible Logic","author":"R Wille","year":"2010","unstructured":"Wille, R., Drechsler, R.: Towards a Design Flow for Reversible Logic. Springer, Dodrecht (2010)"},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Wille, R., Offermann, S., Drechsler, R.: SyReC: a programming language for synthesis of reversible circuits. In: Specification Design Languages (FDL), pp. 1\u20136 (2010)","DOI":"10.1049\/ic.2010.0150"},{"key":"7_CR34","doi-asserted-by":"crossref","unstructured":"Wille, R., Soeken, M., Drechsler, R.: Reducing the number of lines in reversible circuits. In: Proceedings of DAC 2010, pp. 647\u2013652 (2010)","DOI":"10.1145\/1837274.1837439"},{"issue":"2","key":"7_CR35","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.vlsi.2013.08.002","volume":"47","author":"R Wille","year":"2014","unstructured":"Wille, R., Soeken, M., Miller, D.M., Drechsler, R.: Trading off circuit lines and gate costs in the synthesis of reversible logic. Integration 47(2), 284\u2013294 (2014)","journal-title":"Integration"},{"key":"7_CR36","doi-asserted-by":"crossref","unstructured":"Yokoyama, T., Gl\u00fcck, R.: A reversible programming language and its invertible self-interpreter. In: PEPM 2007, pp. 144\u2013153 (2007)","DOI":"10.1145\/1244381.1244404"}],"container-title":["Lecture Notes in Computer Science","Reversible Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59936-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,24]],"date-time":"2024-06-24T09:37:32Z","timestamp":1719221852000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59936-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319599359","9783319599366"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59936-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"25 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reversible Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rc2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.reversible-computation.org\/2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}