default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDParallel Computing, Volume 15
Volume 15, Number 1-3, September 1990
- S. Knecht, E. Laermann, Wolfgang E. Nagel:
Parallelizing QCD with dynamical fermions on a Cray multiprocessor system. 3-20 - Ibrahim N. Hajj, Stig Skelboe:
A multilevel parallel solver for block tridiagonal and banded linear systems. 21-45 - F. F. Van der Vlugt, D. A. van Delft, A. F. Bakker, T. H. van der Meer:
The implementation of a 3D Navier-Stokes algorithm on an algorithm oriented processor. 47-60 - Amir Averbuch, Eran Gabber, Boaz Gordissky, Yoav Medan:
A parallel FFT on an MIMD machine. 61-74 - Michel Cosnard, Pierre Fraigniaud:
Finding the roots of a polynomial on an MIMD multicomputer. 75-85 - Inmaculada García
, Juan Julián Merelo Guervós, Javier D. Bruguera, Emilio L. Zapata:
Parallel quadrant interlocking factorization on hypercube computers. 87-100 - T. Z. Kalamboukis:
The symmetric tridiagonal eigenvalue problem on a transputer network. 101-106 - J. Boreddy, Arogyaswami Paulraj:
On the performance of transputer arrays for dense linear systems. 107-117 - L. Bomans, Dirk Roose, R. Hempel:
The Argonne/GMD macros in FORTRAN for portable parallel programming and their implementation on the Intel iPSC/2. 119-132 - Igor Z. Milovanovic, Emina I. Milovanovic, Mile K. Stojcev:
An optimal algoPaulrajrithm for Gaussian elimination of band matrices on an MIMD computer. 133-145 - Michael Thuné:
A partitioning strategy for explicit difference methods. 147-154 - István Deák:
Uniform random number generators for parallel computers. 155-164 - Peter J. Varman, Balakrishna R. Iyer, Donald J. Haderle, Stephen M. Dunn:
Parallel merging: algorithm and implementation results. 165-177 - Sajal K. Das, Narsingh Deo, Sushil K. Prasad:
Two minimum spanning forest algorithms on fixed-size hypercube computers. 179-187 - Ferng-Ching Lin, Kuo-Liang Chung:
A cost-optimal parallel tridiagonal system solver. 189-199 - Frank K. H. A. Dehne, Afonso Ferreira, Andrew Rau-Chaplin:
A. G. Ferreira Parallel branch and bound on fine-grained hypercube multiprocessors. 201-209 - Abdelhamid Benaini, Yves Robert:
Spacetime-minimal systolic arrays for Gaussian elimination and the algebraic path problem. 211-225 - Konstantinos G. Margaritis, David J. Evans:
Systolic designs for Bernoulli's method. 227-240 - Sung Kwon Kim:
Parallel algorithms for planar dominance counting. 241-246 - Derrick Morris, Colin J. Theaker, R. Phillips, D. Gareth Evans:
An experimental parallel system (EPS). 247-259 - Evgenij E. Tyrtyshnikov:
New approaches to deriving parallel algorithms. 261-265 - Chau-Jy Lin:
Parallel generation of permutations on systolic arrays. 267-276 - Sajal K. Das, Nitin H. Vaidya, Lalit M. Patnaik:
A systolic algorithm for hidden surface removal. 277-289
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-19 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
