An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network

DOI10.1137/0215015zbMath0589.68052OpenAlexW2060946121MaRDI QIDQ3718170

Tuvi Etzion, Abraham Lempel

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/d55e2015d6908f27e8f54275ec9bb6352f04fd52

zbMATH Keywords

permutationsparallel processingbit-permutations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Theory of operating systems (68N25)

Related Items (2)

Graphs with the unique path property: Structure, cycles, factors, and constructions ⋮ Trends in systolic and cellular computation

This page was built for publication: An Efficient Algorithm for Generating Linear Transformations in a Shuffle-Exchange Network