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=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Combinatorial analysis of the fault-diameter of the
n
-cube
Shahram Latifi
IEEE Transactions on Computers
42
(1), 1993, January, pp. 27-33
Availability of
k
-coterie
Hirotsugu Kakugawa
,
Satoshi Fujita
,
Masafumi Yamashita
,
Tadashi Ae
IEEE Transactions on Computers
42
(5), 1993, May, pp. 553-558
Rearrangeable three-stage interconnection networks and their routing properties
Barry G. Douglass
IEEE Transactions on Computers
42
(5), 1993, May, pp. 559-567
A new technique for fast number comparison in the residue number system
G. Dimauro
,
S. Impedovo
,
G. Pirlo
IEEE Transactions on Computers
42
(5), 1993, May, pp. 608-612
Line digraph iterations and connectivity analysis of de Bruijn and Kautz graphs
Ding-Zhu Du
,
Yuh-Dauh Lyuu
,
D. Frank Hsu
IEEE Transactions on Computers
42
(5), 1993, May, pp. 612-616
New redundant representations of complex numbers and vectors
Jean Duprat
,
Yvan Herreros
,
Sylvanus Kla
IEEE Transactions on Computers
42
(7), 1993, July, pp. 817-824
Manipulating general vectors on synchronous binary
N
-cube
Woei Lin
IEEE Transactions on Computers
42
(7), 1993, July, pp. 863-871
Scattering and gathering messages in networks of processors
Sandeep N. Bhatt
,
Geppino Pucci
,
Abhiram Ranade
,
Arnold L. Rosenberg
IEEE Transactions on Computers
42
(8), 1993, August, pp. 938-949
On the lower bound to the VLSI complexity of number conversion from weighted to residue representation
Giuseppe Alia
,
Enrico Martinelli
IEEE Transactions on Computers
42
(8), 1993, August, pp. 962-967
Fault-tolerant meshes and hypercubes with minimal numbers of spares
Jehoshua Bruck
,
Robert Cypher
,
Ching-Tien Ho
IEEE Transactions on Computers
42
(9), 1993, September, pp. 1089-1104
A reduced-area scheme for carry-select adders
Akhilesh Tyagi
IEEE Transactions on Computers
42
(10), 1993, October, pp. 1163-1170
Assessing reliability of multistage interconnection networks
Charles J. Colbourn
,
John S. Devitt
,
Daryl D. Harms
,
Miro Kraetzl
IEEE Transactions on Computers
42
(10), 1993, October, pp. 1207-1221
Creating disjoint paths in Gamma interconnection networks
Nian-Feng Tzeng
,
Po-Jen Chuang
,
Chwan-Hwa Wu
IEEE Transactions on Computers
42
(10), 1993, October, pp. 1247-1252
Bounds on the performance of message routing heuristics
P.J. Bernhard
IEEE Transactions on Computers
42
(10), 1993, October, pp. 1253-1256
Broadcasting on incomplete hypercubes
Jenn-Yang Tien
,
Ching-Tien Ho
,
Wei-Pang Yang
IEEE Transactions on Computers
42
(11), 1993, November, pp. 1393-1398
A routing and broadcasting scheme on faulty star graphs
Nader Bagherzadeh
,
Nayla Nassif
,
Shahram Latifi
IEEE Transactions on Computers
42
(11), 1993, November, pp. 1398-1403