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=Theory of Computing Systems AND YEAR=1997
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Processor-time tradeoffs under bounded-speed message propagation: Part I - Upper bounds
G. Bilardi
,
F.P. Preparata
Theory of Computing Systems
30
(6), 1997, pp. 523-546
A randomized parallel three-dimensional convex hull algorithm for coarse-grained mlticomputers
F. Dehne
,
X. Deng
,
P. Dymond
,
A. Fabri
,
A.A. Khokhar
Theory of Computing Systems
30
(6), 1997, pp. 547-558
On probabilisitc networks for selection, merging, and sorting
T. Leighton
,
Y. Ma
,
T. Suel
Theory of Computing Systems
30
(6), 1997, pp. 559-582
Parallel algorithms for the circuit value update problem
C.E. Leiserson
,
K.H. Randall
Theory of Computing Systems
30
(6), 1997, pp. 583-597
Lower bounds for randomized exclusive write PRAMs
P.D. MacKenzie
Theory of Computing Systems
30
(6), 1997, pp. 599-626
Optimal tradeoffs between size and slowdown for universal parallel networks
F. Meyer auf der Heide
,
M. Storch
,
R. Wanka
Theory of Computing Systems
30
(6), 1997, pp. 627-644
Elimination trees and the construction of pools and stacks
N. Shavit
,
D. Touitou
Theory of Computing Systems
30
(6), 1997, pp. 645-670
Seiten
<
1
2