Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=IEEE Trans.~Comput. AND Volume=C-32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The NYU ultracomputer - designing an MIMD shared memory parallel computer
A. Gottlieb
,
R. Grishman
,
C. Kruskal
,
K. McAuliffe
,
L. Rudolph
,
M. Snir
IEEE Transactions on Computers
C-32
(2), 1983, February, pp. 175-189
An efficient implementation of Batcher's odd-even merge algorithm and its application in parallel sorting schemes
Manoj Kumar
,
Daniel S. Hirschberg
IEEE Transactions on Computers
C-32
(3), 1983, March, pp. 254-264
Asynchronous and clocked control structures for VLSI based interconnection networks
Donald Wann
,
Mark Franklin
IEEE Transactions on Computers
C-32
(3), 1983, March, pp. 284-293
Binary trees and parallel scheduling algorithms
Eliezer Dekel
,
Sartaj Sahni
IEEE Transactions on Computers
C-32
(3), 1983, March, pp. 307-315
Searching, merging, and sorting in parallel computation
Clyde Kruskal
IEEE Transactions on Computers
C-32
(10), 1983, October, pp. 942-946