{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T19:01:55Z","timestamp":1769281315688,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,2,21]],"date-time":"2016-02-21T00:00:00Z","timestamp":1456012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,2,21]]},"DOI":"10.1145\/2847263.2847277","type":"proceedings-article","created":{"date-parts":[[2016,2,4]],"date-time":"2016-02-04T16:26:02Z","timestamp":1454603162000},"page":"215-223","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Optimal Circuits for Streamed Linear Permutations Using RAM"],"prefix":"10.1145","author":[{"given":"Fran\u00e7ois","family":"Serre","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Holenstein","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"P\u00fcschel","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,2,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/82.160168"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1502793.1502799"},{"key":"e_1_3_2_1_3_1","volume-title":"System and method for designing architecture for specified permutation and datapath circuits for permutation","author":"P\u00fcschel M.","year":"2008","unstructured":"M. P\u00fcschel , P. A. Milder , and J. C. Hoe , \" System and method for designing architecture for specified permutation and datapath circuits for permutation ,\" 2008 . US Patent 8,321,823. M. P\u00fcschel, P. A. Milder, and J. C. Hoe, \"System and method for designing architecture for specified permutation and datapath circuits for permutation,\" 2008. US Patent 8,321,823."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2159542.2159547"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684746.2689068"},{"key":"e_1_3_2_1_6_1","volume-title":"The Art of Computer Programming, 2Nd Ed","author":"Knuth D. E.","year":"1978","unstructured":"D. E. Knuth , The Art of Computer Programming, 2Nd Ed . ( Addison-Wesley Series in Computer Science and Information. Boston, MA, USA : Addison-Wesley Longman Publishing Co. , Inc., 2 nd ed., 1978 . D. E. Knuth, The Art of Computer Programming, 2Nd Ed. (Addison-Wesley Series in Computer Science and Information. Boston, MA, USA: Addison-Wesley Longman Publishing Co., Inc., 2nd ed., 1978.","edition":"2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2854150"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/1038001"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1977.1674863"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00289714"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1991-1052103-1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2008.05.007"},{"key":"e_1_3_2_1_13_1","first-page":"1408","article-title":"A lower-upper-lower block triangular decomposition with minimal off-diagonal ranks","author":"Serre F.","year":"2014","unstructured":"F. Serre and M. P\u00fcschel , \" A lower-upper-lower block triangular decomposition with minimal off-diagonal ranks ,\" ArXiv e-prints , 2014 . arXiv: 1408 .0994. F. Serre and M. P\u00fcschel, \"A lower-upper-lower block triangular decomposition with minimal off-diagonal ranks,\" ArXiv e-prints, 2014. arXiv:1408.0994.","journal-title":"ArXiv e-prints"},{"key":"e_1_3_2_1_14_1","first-page":"1118","volume-title":"Automation and Test in Europe (DATE)","author":"Milder P. A.","year":"2009","unstructured":"P. A. Milder , J. C. Hoe , and M. P\u00fcschel , \" Automatic generation of streaming datapaths for arbitrary fixed permutations,\" in Design , Automation and Test in Europe (DATE) , pp. 1118 -- 1123 , 2009 . P. A. Milder, J. C. Hoe, and M. P\u00fcschel, \"Automatic generation of streaming datapaths for arbitrary fixed permutations,\" in Design, Automation and Test in Europe (DATE), pp. 1118--1123, 2009."},{"key":"e_1_3_2_1_15_1","first-page":"1","volume-title":"Automatic generation of high throughput energy efficient streaming architectures for arbitrary fixed permutations,\" in Field Programmable Logic and Applications (FPL)","author":"Chen R.","year":"2015","unstructured":"R. Chen and V. Prasanna , \" Automatic generation of high throughput energy efficient streaming architectures for arbitrary fixed permutations,\" in Field Programmable Logic and Applications (FPL) , pp. 1 -- 8 , 2015 . R. Chen and V. Prasanna, \"Automatic generation of high throughput energy efficient streaming architectures for arbitrary fixed permutations,\" in Field Programmable Logic and Applications (FPL), pp. 1--8, 2015."},{"key":"e_1_3_2_1_16_1","volume-title":"Mathematical Theory of Connecting Networks and Telephone Traffic","author":"V. E.","year":"1965","unstructured":"V. E. Bene\\v s , Mathematical Theory of Connecting Networks and Telephone Traffic . Academic Press , 1965 . V. E. Bene\\v s, Mathematical Theory of Connecting Networks and Telephone Traffic. Academic Press, 1965."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/321439.321449"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1983.1676255"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.1675791"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025114.1025191"}],"event":{"name":"FPGA'16: The 2016 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","location":"Monterey California USA","acronym":"FPGA'16","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2016 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2847263.2847277","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2847263.2847277","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:48:23Z","timestamp":1750225703000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2847263.2847277"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,21]]},"references-count":20,"alternative-id":["10.1145\/2847263.2847277","10.1145\/2847263"],"URL":"https:\/\/doi.org\/10.1145\/2847263.2847277","relation":{},"subject":[],"published":{"date-parts":[[2016,2,21]]},"assertion":[{"value":"2016-02-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}