scientific article

Publication date: 23 January 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

optimization decision sorting graph theory computational geometry searching combinations generating permutations numerical problems traversing combinatorial

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Distributed algorithms (68W15)

Related Items (45)

A chained-matrices approach for parallel computation of continued fractions and its applications ⋮ An approach to parallel algorithm design ⋮ Implicit matrix multiplication with maximum accuracy on various transputer networks ⋮ Construction of preconditioners for Wiener-Hopf equations by operator splitting ⋮ On random and adaptive parallel generation of combinatorial objects ⋮ Simple parallel algorithms for primality testing and integer factorization ⋮ OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS ⋮ OPTIMAL PARALLEL PREFIX ON MESH ARCHITECTURES ⋮ EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗ ⋮ AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM ⋮ AN EREW-PRAM MULTIPLE SEARCHING AND MERGING ALGORITHM ⋮ AN EFFICIENT PARALLEL ALGORITHM FOR THE ASSIGNMENT PROBLEM ON THE PLANE∗ ⋮ THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† ⋮ A NEW METHOD FOR GENERATING INTEGER COMPOSITIONS IN PARALLEL ⋮ Fast parallel algorithms for forecasting ⋮ A parametric algorithm for semigroup computation on mesh with buses ⋮ On practical implementation of robust kalman filtering ⋮ Linear-code multicast on parallel architectures ⋮ Circulant and skew-circulant splitting methods for Toeplitz systems. ⋮ An optimal algorithm for generating equivalence relations on a linear array of processors ⋮ A programming model for BSP with partitioned synchronisation ⋮ Pipelined search on coarse grained networks ⋮ Constant time sorting on a processor array with a reconfigurable bus system ⋮ LINEAR LAYOUT OF GENERALIZED HYPERCUBES ⋮ Modelling a fast parallel thinning algorithm for shared memory SIMD computers ⋮ SIMPLE: An optimal disk system with two restricted heads ⋮ Efficient algorithms for parallel sorting on mesh multicomputers ⋮ TOWARDS PARALLEL PROGRAMMING BY TRANSFORMATION: THE FAN SKELETON FRAMEWORK* ⋮ Toeplitz preconditioners for Hermitian Toeplitz systems ⋮ A parallel algorithm for subset selection ⋮ On Computable Numbers, Nonuniversality, and the Genuine Power of Parallelism ⋮ A parallel algorithm for solving the incompressible Navier-Stokes problem ⋮ Unnamed Item ⋮ Listing combinatorial objects in parallel ⋮ Massively time-parallel, approximate simulation of loss queueing systems ⋮ Parallel generation of í-ary trees with ballot-sequences ⋮ Parallel computation of the multi-exponentiation for cryptosystems ⋮ OPTIMAL PARALLEL MATCHING ON BIPARTITE PERMUTATION GRAPHS ⋮ Embedding cycles and meshes onto incomplete hypercubes ⋮ From Parallelism to Nonuniversality: An Unconventional Trajectory ⋮ Sorting and computing convex hulls on processor arrays with reconfigurable bus systems ⋮ Block-circulant preconditioners for systems arising from discretization of the three-dimensional convection-diffusion equation ⋮ BLOCK-JACOBI SVD ALGORITHMS FOR DISTRIBUTED MEMORY SYSTEMS I: HYPERCUBES AND RINGS* ⋮ Space-efficient parallel merging ⋮ Molecular conformation on the CM-5 by parallel two-level simulated annealing

This page was built for publication: