{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T22:56:12Z","timestamp":1776984972619,"version":"3.51.4"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2020,2,1]],"date-time":"2020-02-01T00:00:00Z","timestamp":1580515200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100010663","name":"H2020 European Research Council","doi-asserted-by":"publisher","award":["716562"],"award-info":[{"award-number":["716562"]}],"id":[{"id":"10.13039\/100010663","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2020,2,1]]},"DOI":"10.1109\/tc.2019.2939818","type":"journal-article","created":{"date-parts":[[2019,10,7]],"date-time":"2019-10-07T20:01:24Z","timestamp":1570478484000},"page":"198-211","source":"Crossref","is-referenced-by-count":4,"title":["Optimal Metastability-Containing Sorting via Parallel Prefix Computation"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1108-1091","authenticated-orcid":false,"given":"Johannes","family":"Bund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3290-0674","authenticated-orcid":false,"given":"Christoph","family":"Lenzen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5572-3754","authenticated-orcid":false,"given":"Moti","family":"Medina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","author":"zimmermann","year":"1998","journal-title":"Binary Adder Architectures for Cell-Based VLSI and Their Synthesis"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(88)90043-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2808185"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2017.65"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ASYNC.2017.12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ASYNC.2018.00025"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2011.113"},{"key":"ref15","first-page":"490","article-title":"Fault-tolerant clock synchronization with high precision","author":"huemer","year":"2016","journal-title":"Proc IEEE Comput Soc Annu Symp VLSI"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/320856.320866"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188912"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-017-9840-3"},{"key":"ref19","author":"kinniment","year":"2008","journal-title":"Synchronization and Arbitration in Digital Systems"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICECS.2012.6463557"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342063"},{"key":"ref27","volume":"1","author":"swartzlander","year":"2015","journal-title":"Computer Arithmetic"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2017.7926987"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-04921-2_19"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ASYNC.2017.9"},{"key":"ref5","article-title":"Small hazard-free transducers","volume":"abs 1811 12369","author":"bund","year":"2018","journal-title":"CoRR"},{"key":"ref8","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref7","first-page":"186","article-title":"25 comparators is optimal when sorting 9 inputs (and 29 for 10)","author":"codish","year":"2014","journal-title":"Proc IEEE Int Conf Tools Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1982.1675982"},{"key":"ref9","article-title":"Metastability-containing circuits, parallel distance problems, and terrain guarding","author":"friedrichs","year":"2017"},{"key":"ref1","first-page":"1","article-title":"An $\\mathcal {O}(n \\;\\log n)$O(nlogn) sorting network","author":"ajtai","year":"1983","journal-title":"Proc 15th Annu ACM Symp Theory Comput"},{"key":"ref20","author":"kleene","year":"1952","journal-title":"Introduction to Metamathematics"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1973.5009159"},{"key":"ref21","author":"knuth","year":"1998","journal-title":"The Art of Computer Programming Volume 3 Sorting and Searching"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ASYNC.2016.18"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322232"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TEC.1960.5219822"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1981.6312173"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8959511\/08861160.pdf?arnumber=8861160","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T20:00:33Z","timestamp":1639771233000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8861160\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,1]]},"references-count":31,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tc.2019.2939818","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,1]]}}}