✦ LIBER ✦

Macroconveyor computations of functions on data structures

✍ Scribed by V. M. Glushkov; Yu. V. Kapitonova; A. A. Letichevskii; S. P. Gorlach

Publisher: Springer US
Year: 1982
Tongue: English
Weight: 978 KB
Volume: 17
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01082474

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Macroconveyor asynchronic calculations o

Macroconveyor asynchronic calculations of structural functions

✍ S. P. Gorlach 📂 Article 📅 1984 🏛 Springer US 🌐 English ⚖ 596 KB

Synthesis of the programmed functions of

Synthesis of the programmed functions offorloops on data structures

✍ V. S. Kostyrko 📂 Article 📅 1987 🏛 Springer US 🌐 English ⚖ 824 KB

Data Independence of Read, Write, and Co

Data Independence of Read, Write, and Control Structures in PRAM Computations

✍ Klaus-Jörn Lange; Rolf Niedermeier 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 322 KB

We introduce the notions of control and communication structures in PRAM computations and relate them to the concept of data independence. Our main result is to characterize differences between unbounded fan-in parallelism AC k , bounded fan-in parallelism NC k , and the sequential classes DSPACE(lo

On the complexity of online computations

On the complexity of online computations of real functions

✍ Klaus Weihrauch 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 813 KB

A reasonable computational complexity theory for real functions is obtained by using the modified infinite binary representation with digits 0, 1, and -1 for the real numbers and Turing machines which transform with one-way output modified binary input sequences into modified binary output sequences

Molecular structure determination on a c

Molecular structure determination on a computational and data grid

✍ Mark L. Green; Russ Miller 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 900 KB

On monotone functions of tree structures

✍ Helmut Prodinger; Friedrich J. Urbanek 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 683 KB