{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:02:37Z","timestamp":1760709757965,"version":"3.37.3"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001711","name":"Schweizerischer Nationalfonds zur F\u00f6rderung der Wissenschaftlichen Forschung","doi-asserted-by":"publisher","award":["200021-169084 MAJesty","ERC-2014-ADG 669354 CyberCare"],"award-info":[{"award-number":["200021-169084 MAJesty","ERC-2014-ADG 669354 CyberCare"]}],"id":[{"id":"10.13039\/501100001711","id-type":"DOI","asserted-by":"publisher"}]},{"name":"ENEAC","award":["EP\/N002539\/1"],"award-info":[{"award-number":["EP\/N002539\/1"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2019,5,1]]},"DOI":"10.1109\/tc.2018.2881245","type":"journal-article","created":{"date-parts":[[2018,11,14]],"date-time":"2018-11-14T19:58:49Z","timestamp":1542225529000},"page":"791-797","source":"Crossref","is-referenced-by-count":7,"title":["Mapping Monotone Boolean Functions into Majority"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1114-8476","authenticated-orcid":false,"given":"Eleonora","family":"Testa","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0229-8766","authenticated-orcid":false,"given":"Mathias","family":"Soeken","sequence":"additional","affiliation":[]},{"given":"Luca G.","family":"Amaru","sequence":"additional","affiliation":[]},{"given":"Winston","family":"Haaswijk","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7827-3215","authenticated-orcid":false,"given":"Giovanni","family":"De Micheli","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2014.36"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2664059"},{"journal-title":"The Art of Computer Programming Volume 4A","year":"2011","author":"knuth","key":"ref13"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-24508-4","author":"jukna","year":"2012","journal-title":"Boolean Function Complexity"},{"year":"1978","author":"schensted","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1947-08864-9"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9939-1954-0064749-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-5139-3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2506566"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2488484"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1675"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1961.5219266"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LED.2011.2156379"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/0221053"},{"journal-title":"The Art of Computer Programming Volume 3 Second Edition","year":"1998","author":"knuth","key":"ref29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(02)00025-9"},{"key":"ref8","first-page":"49:1","article-title":"Computing majority by constant depth majority circuits with low fan-in gates","author":"kulikov","year":"2017","journal-title":"Proc Symp Theoretical Aspects Comput Sci"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1964.263829"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/4\/1\/004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288611"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1063\/1.3609062"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2016.21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1962.5219329"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1962.16"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2006.888267"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1063\/1.356375"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2593069.2593158"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2463209.2488792"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8683959\/08534447.pdf?arnumber=8534447","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:48:53Z","timestamp":1657745333000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8534447\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,1]]},"references-count":30,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tc.2018.2881245","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[2019,5,1]]}}}