Optimal Metastability-Containing Sorting via Parallel Prefix Computation

DOI10.1109/TC.2019.2939818MaRDI QIDQ5211782zbMATH OpenOpenAlexFDO

Authors Johannes Bund, Christoph Lenzen, Moti Medina

Publication date 28 January 2020

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.00267

Mathematics Subject Classification ID

Computer science (68-XX)

Cited in

(2)

• On the complexity of fanout-bounded parallel prefix circuits
• On the complexity of hazard-free formulas

This page was built for publication: Optimal Metastability-Containing Sorting via Parallel Prefix Computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5211782)