𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The parallel complexity of deadlock detection

✍ Scribed by Paul Spirakis

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
1021 KB
Volume
52
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The parallel complexity of function appr
The parallel complexity of function approximation
✍ JΓΆrg-Detlef Kern πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 679 KB

We introduce a parallel model of computation over the reals. We then obtain lower and upper bounds on the parallel complexity of approximating certain types of smooth functions in n dimensions. The bounds are obtained for both unbounded and bounded parallelism. o IW Academic PRSS, IIIC.