Publication:4003441
From MaRDI portal
zbMath0754.68053MaRDI QIDQ4003441
Publication date: 23 January 1993
optimization; decision; sorting; graph theory; computational geometry; searching; combinations; generating permutations; numerical problems; traversing combinatorial
68-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68W15: Distributed algorithms
Related Items
Simple parallel algorithms for primality testing and integer factorization, A parallel algorithm for subset selection, Embedding cycles and meshes onto incomplete hypercubes, On practical implementation of robust kalman filtering, An approach to parallel algorithm design, SIMPLE: An optimal disk system with two restricted heads, Toeplitz preconditioners for Hermitian Toeplitz systems, Modelling a fast parallel thinning algorithm for shared memory SIMD computers, Efficient algorithms for parallel sorting on mesh multicomputers, Sorting and computing convex hulls on processor arrays with reconfigurable bus systems, Molecular conformation on the CM-5 by parallel two-level simulated annealing, A chained-matrices approach for parallel computation of continued fractions and its applications, Implicit matrix multiplication with maximum accuracy on various transputer networks, Fast parallel algorithms for forecasting, A parallel algorithm for solving the incompressible Navier-Stokes problem, Massively time-parallel, approximate simulation of loss queueing systems, Construction of preconditioners for Wiener-Hopf equations by operator splitting, A parametric algorithm for semigroup computation on mesh with buses, Parallel computation of the multi-exponentiation for cryptosystems, OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS, Space-efficient parallel merging, On random and adaptive parallel generation of combinatorial objects, BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS*
