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

Local TagsRelease HistoryDetailsSummary

HEX: Scaling Honeycombs is Easier than Scaling Clock Trees

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.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002A-41BE-F Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-1944-7

Genre: Journal Article

Latex : {HEX}: {S}caling Honeycombs is Easier than Scaling Clock Trees

Files

show Files

Locators

show

Creators

show

hide

Creators:
Dolev, Danny¹, Author
Függer, Matthias¹, Author
Lenzen, Christoph², Author
Perner, Martin¹, Author
Schmid, Ulrich¹, Author

Affiliations:
1External Organizations, ou_persistent22
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019

Content

show

Details

show

hide

Language(s): eng - English

Dates: Accepted: 2016-03-07Published Online: 2016-03-15Date issued: 2016

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1016/j.jcss.2016.03.001
BibTex Citekey: Dolev2016a

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Journal of Computer and System Sciences

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: Amsterdam : Elsevier

Pages: - Volume / Issue: 82 (5) Sequence Number: - Start / End Page: 929 - 956 Identifier: ISSN: 0022-0000
CoNE: https://pure.mpg.de/cone/journals/resource/954922645032