Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=505

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

Parallel evaluation of functional programs: The \langle\nu,G\rangle-machine approach
Thomas Johnsson
Lecture Notes in Computer Science 505, 1991, pp. 1-5
Towards a single model of efficient computation in real parallel machines
Pilar de la Torre, Clyde P. Kruskal
Lecture Notes in Computer Science 505, 1991, pp. 6-24
Neural computing and the GALATEA project
Philip C. Treleaven
Lecture Notes in Computer Science 505, 1991, pp. 25-33
A novel high-speed memory organization for fine-grain multi-thread computing
Herbert H.J. Hum, Guang R. Gao
Lecture Notes in Computer Science 505, 1991, pp. 34-51
Evaluation of futurebus hierarchical caching
K.G. Langendoen, H.L. Muller, L.O. Hertzberger
Lecture Notes in Computer Science 505, 1991, pp. 52-68
Efficient global computations on a processor network with programmable logic
Jean Marie Filloque, Eric Gautrin, Bernard Pottier
Lecture Notes in Computer Science 505, 1991, pp. 69-82
POMP or how to design a massively parallel machine with small developments
Philippe Hoogvorst, Ronan Keryell, Philippe Matherat, Nicolas Paris
Lecture Notes in Computer Science 505, 1991, pp. 83-100
The function processor: An architecture for efficient execution of recursive functions
Jonas Vasell, Jesper Vasell
Lecture Notes in Computer Science 505, 1991, pp. 101-118
The G-line: A distributed processor for graph reduction
R. Milikowski, W.G. Vree
Lecture Notes in Computer Science 505, 1991, pp. 119-136
The derivation of distributed termination detection algorithms from garbage collection schemes
Gerard Tel, Friedemann Mattern
Lecture Notes in Computer Science 505, 1991, pp. 137-149
Indirect reference counting: A distributed garbage collection algorithm
José M. Piquer
Lecture Notes in Computer Science 505, 1991, pp. 150-165
Periodic multiprocessor scheduling
Jan H.M. Korst, Emile H.L. Aarts, Jan Karel Lenstra, Jaap Wessels
Lecture Notes in Computer Science 505, 1991, pp. 166-178
Embeddings of shuffle-like graphs in hypercubes
M. Baumslag, M.C. Heydemann, J. Opatrny, D. Sotteau
Lecture Notes in Computer Science 505, 1991, pp. 179-190
Mapping uniform recurrences onto small size arrays
Vincent van Dongen
Lecture Notes in Computer Science 505, 1991, pp. 191-208
Area complexity of multilective merging
Pavel Ferianc, Ondrej Sýkora
Lecture Notes in Computer Science 505, 1991, pp. 209-218
Deriving fully efficient systolic arrays by quasi-linear allocation functions
Xiaoxiong Zhong, Sanjay Rajopadhye
Lecture Notes in Computer Science 505, 1991, pp. 219-235
Affine timings for systems of affine recurrence equations
C. Mongenet
Lecture Notes in Computer Science 505, 1991, pp. 236-251
On the computational complexity of optimal sorting network verification
Ian Parberry
Lecture Notes in Computer Science 505, 1991, pp. 252-269
Managing a parallel heap efficiently
Sajal K. Das, Wen-Bing Horng
Lecture Notes in Computer Science 505, 1991, pp. 270-287
Parallel complexity in the design and analysis of concurrent systems
Carme Àlvarez, José L. Balcázar, Joaquim Gabarró, Miklós Sántha
Lecture Notes in Computer Science 505, 1991, pp. 288-303
FORK: A high-level language for PRAMs
T. Hagerup, A. Schmitt, H. Seidl
Lecture Notes in Computer Science 505, 1991, pp. 304-320
Neural network-based decision making for large incomplete databases
A.R. Hurson, B. Jín, S.H. Pakzad
Lecture Notes in Computer Science 505, 1991, pp. 321-337
An optical content-addressable parallel processor for fast searching and retrieving
Ahmed Louri
Lecture Notes in Computer Science 505, 1991, pp. 338-354
Towards an efficient hybrid dataflow architecture model
Guang R. Gao, Herbert H.J. Hum, Jean-Marc Monti
Lecture Notes in Computer Science 505, 1991, pp. 355-371
Data flow implementation of generalized guarded commands
R. Govindarajan, Sheng Yu
Lecture Notes in Computer Science 505, 1991, pp. 372-389

Seiten 1 2 >