Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions

Ganian, Robert; Kalany, Martin; Szeider, Stefan; Träff, Jesper Larsson

doi:10.48550/arXiv.1506.09100

Notice
This item was automatically migrated from a legacy system. It's data has not been checked and might not meet the quality criteria of the present system.

Record link:

http://hdl.handle.net/20.500.12708/176437

Title:

Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions

Citation:

Ganian, R., Kalany, M., Szeider, S., & Träff, J. L. (2015). Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions. arXiv. https://doi.org/10.48550/arXiv.1506.09100

Publisher DOI:

10.48550/arXiv.1506.09100

Publication Type:

Preprint

Authors:

Ganian, Robert
Kalany, Martin
Szeider, Stefan
Träff, Jesper Larsson

Organisational Unit:

E192-03 - Forschungsbereich Knowledge Based Systems
E191-04 - Forschungsbereich Parallel Computing

ArXiv ID:

1506.09100

Date (published):

2015