HEX: Scaling Honeycombs is Easier than Scaling Clock Trees

Dolev, Danny; Függer, Matthias; Lenzen, Christoph; Perner, Martin; Schmid, Ulrich

doi:10.1016/j.jcss.2016.03.001

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

HEX: Scaling Honeycombs is Easier than Scaling Clock Trees

MPS-Authors

/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)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Dolev, D., Függer, M., Lenzen, C., Perner, M., & Schmid, U. (2016). HEX: Scaling Honeycombs is Easier than Scaling Clock Trees. Journal of Computer and System Sciences, 82(5), 929-956. doi:10.1016/j.jcss.2016.03.001.

Cite as: https://hdl.handle.net/11858/00-001M-0000-002A-41BE-F

Abstract

There is no abstract available