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
[1]
Hilfe
Suche: Author="Pietracaprina, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The complexity of parallel multisearch on coarse-grained machines
A. Bäumker
,
W. Dittrich
,
A. Pietracaprina
Algorithmica
24
(3-4), 1999, pp. 209-242
BSP versus LogP
G. Bilardi
,
K.T. Herley
,
A. Pietracaprina
,
G. Pucci
,
P. Spirakis
Algorithmica
24
(3-4), 1999, pp. 405-421
Practical constructive schemes for deterministic shared-memory access
A. Pietracaprina
,
F.P. Preparata
Theory of Computing Systems
30
(1), 1997, pp. 3-37
The complexity of deterministic PRAM simulation on distributed memory machines
A. Pietracaprina
,
G. Pucci
Theory of Computing Systems
30
(3), 1997, pp. 231-247
An
O(\sqrt n)
-worst-case-time solution to the granularity problem
A. Pietracaprina
,
F.P. Preparata
Lecture Notes in Computer Science
665
, 1993, pp. 110-119
A practical constructive scheme for deterministic shared-memory access
A. Pietracaprina
,
F.P. Preparata
Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'93 (Velen, Germany, June 30 - July 2, 1993)
, 1993, pp. 100-109
A new scheme for the deterministic simulation of PRAMs in VLSI
F. Luccio
,
A. Pietracaprina
,
G. Pucci
Algorithmica
5
, 1990, pp. 529-544
A probabilistic simulation of PRAMs on a bounded degree network
Fabrizio Luccio
,
A. Pietracaprina
,
G. Pucci
Information Processing Letters
28
, 1988, pp. 141-147