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=Theor.~Comput.~Sci. AND Volume=196
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The queue-read queue-write asychronous PRAM model
P.B. Gibbons
,
Y. Matias
,
V. Ramachandran
Theoretical Computer Science
196
(1-2), 1998, pp. 3-29
Speedup and efficiency of large-size applications on heterogenous networks
L. Colombet
,
L. Desbat
Theoretical Computer Science
196
(1-2), 1998, pp. 31-44
A framework for viewing atomic events in distributed computations
Ajay D. Kshemkalyani
Theoretical Computer Science
196
(1-2), 1998, pp. 45-70
Efficient high-level parallel programming
George Horaţiu Botorog
,
Herbert Kuchen
Theoretical Computer Science
196
(1-2), 1998, pp. 71-107
The bulk-synchronous parallel random access machine
Alexandre Tiskin
Theoretical Computer Science
196
(1-2), 1998, pp. 109-130
Efficient delay routing
Miriam di Ianni
Theoretical Computer Science
196
(1-2), 1998, pp. 131-151
ERCW PRAMs and optical communication
Philip D. MacKenzie
,
Vijaya Ramachandran
Theoretical Computer Science
196
(1-2), 1998, pp. 153-180
Routing on networks of optical crossbars
Friedhelm Meyer auf der Heide
,
Klaus Schröder
,
Frank Schwarze
Theoretical Computer Science
196
(1-2), 1998, pp. 181-200
Reducing the mean latency of floating-point addition
Stuart F. Oberman
,
Michael J. Flynn
Theoretical Computer Science
196
(1-2), 1998, pp. 201-214
A shared-memory implementation of the hierarchical radiosity method
Axel Podehl
,
Thomas Rauber
,
Gudula Rünger
Theoretical Computer Science
196
(1-2), 1998, pp. 215-240
Using cost to control instrumentation overhead
Jeffrey K. Hollingsworth
,
Barton P. Miller
Theoretical Computer Science
196
(1-2), 1998, pp. 241-258
Triangular grid protocol: An efficient scheme for replica control with uniform access quorums
Cheng-Hong Cho
,
Jer-Tsang Wang
Theoretical Computer Science
196
(1-2), 1998, pp. 259-288
DAQV: Distributed array query and visualization framework
Steven T. Hackstadt
,
Allen D. Malony
Theoretical Computer Science
196
(1-2), 1998, pp. 289-317
Performance of fault-tolerant data and compute intensive programs over a network of workstations
J.A. Smith
,
S.K. Shrivastava
Theoretical Computer Science
196
(1-2), 1998, pp. 319-345
List scheduling in the presence of branches - A theoretical evaluation
Franco Gasperoni
,
Uwe Schwiegelshohn
Theoretical Computer Science
196
(1-2), 1998, pp. 347-363
Eliminating partially dead code in explicitly parallel programs
Jens Knoop
Theoretical Computer Science
196
(1-2), 1998, pp. 365-393
Affine scheduling on bounded convex polyhedric domains is asymptotically optimal
Patrick Le Gouëslier d'Argence
Theoretical Computer Science
196
(1-2), 1998, pp. 395-415