On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks

Hromkoviĉ, J; Loryś, Krzysztof; Kanarek, Przemysława

Przejdź do menu głównego Przejdź do wyszukiwarki Przejdź do zawartości

polski
English

Home page
On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks

Description

Title: On the size of permutation networks and consequences for efficient simulation of hypercube algorithms on bounded-degree networks
Group publication title: Lecture Notes in Computer Science ; 900
Collective work title: STACS 95 : 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, Germany, March 2-4, 1995 : proceedings
Creator: Hromkoviĉ, J ; Loryś, Krzysztof ; Kanarek, Przemysława
Pages: S. 255-266
Date issued: 1995
Type: Tekst
Language: eng
Detailed object type: rozdz
Object type: Rozdział

The build of the Digital Demonstration Library was commissioned by the Name of the Institution of the Foundation's Institution. The Name of the Foundation under the Program, the Library Project and its creation under the patronage of the Name of the Institution.

Europejski Fundusz Rozwoju Regionalnego Unii Europejskiej

The project titled "Workflow to develop digital publications at the university" co-financed by the European Union from the European Regional Development Fund.

We use files, through the cookie quality improvement layer of our website.For more information, please read the document Privacy Policy