Near-Optimal Metastability-Containing Sorting Networks

Bund, Johannes; Lenzen, Christoph; Medina, Moti

doi:10.23919/DATE.2017.7926987

Item

ITEM ACTIONSEXPORT

Add to Basket

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2389782_5

DetailsSummary

Released

Conference Paper

Near-Optimal Metastability-Containing Sorting Networks

MPS-Authors

/persons/resource/persons123371

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

/persons/resource/persons185330

Medina, Moti
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)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Bund, J., Lenzen, C., & Medina, M. (2017). Near-Optimal Metastability-Containing Sorting Networks. In Proceedings of the 2017 Design, Automation & Test in Europe (pp. 226-231). Piscataway, NJ: IEEE. doi:10.23919/DATE.2017.7926987.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002C-571A-2

Abstract

There is no abstract available