An asymptotically optimal layout for the shuffle-exchange graph
type: Item
instance of: scholarly article
title: An asymptotically optimal layout for the shuffle-exchange graph
zbMATH Open document ID: 0509.68061
DOI: 10.1016/0022-0000(83)90005-3
author: Daniel J. Kleitman
author: Margaret Lepley
author: F. Thomson Leighton
author: Gary L. Miller
published in: Journal of Computer and System Sciences
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q05
zbMATH DE Number: 3804867
zbMATH Keywords: parallel computation
zbMATH Keywords: shuffle-exchange computer
MaRDI profile type: Publication
full work available at URL: 0022-0000(83)90005-3
OpenAlex ID: W2044646290
cites work: Periods in strings
cites work: String overlaps, pattern matching, and nontransitive games
cites work: Efficient detection of determinacy races in cilk programs
cites work: New lower bound techniques for VLSI
cites work: Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram
cites work: Three-Dimensional Circuit Layouts
cites work: Notes on Shuffle/Exchange-Type Switching Networks
cites work: Optimal three-dimensional VLSI layouts
cites work: Parallel Processing with the Perfect Shuffle
cites work: Ultracomputers
cites work: A layout for the shuffle-exchange network with theta(\(N^ 2\) /log N) area
description: scientific article; zbMATH DE number 3804867