Optimal Metastability-Containing Sorting via Parallel Prefix Computation

Bund, Johannes; Lenzen, Christoph; Medina, Moti

doi:10.1109/TC.2019.2939818

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

Optimal Metastability-Containing Sorting via Parallel Prefix Computation

MPS-Authors

/persons/resource/persons220570

Bund, Johannes
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons123371

Lenzen, Christoph
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

Optimal_Metastability-Containing_Sorting_via_Parallel_Prefix_Computation.pdf
(Publisher version), 2MB

Supplementary Material (public)

There is no public supplementary material available

Citation

Bund, J., Lenzen, C., & Medina, M. (2020). Optimal Metastability-Containing Sorting via Parallel Prefix Computation. IEEE Transactions on Computers, 69(2), 198-211. doi:10.1109/TC.2019.2939818.

Cite as: https://hdl.handle.net/21.11116/0000-0005-9E7F-C

Abstract

There is no abstract available