scientific article
From MaRDI portal
Publication:3992671
zbMath0825.68397MaRDI QIDQ3992671
Publication date: 23 January 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Parallel algorithms in computer science (68W10)
Related Items
A chained-matrices approach for parallel computation of continued fractions and its applications, A linear time algorithm for metric dimension of cactus block graphs, Massively parallel tabu search for the quadratic assignment problem, The incremental maintenance of a depth-first-search tree in directed acyclic graphs, K-M-P string matching revisited, The NPO-completeness of the longest Hamiltonian cycle problem, Trading uninitialized space for time, A fast algorithm for computing a longest common increasing subsequence, Path-based depth-first search for strong and biconnected components, Resolving error propagation in distributed systems, On the longest increasing subsequence of a circular list, Winograd's algorithm statistically revisited: it pays to weigh than to count!, Parallelizing Strassen's method for matrix multiplication on distributed-memory MIMD architectures, On completeness for NP via projection translations, Cybernetic optimization by simulated annealing: Accelerating convergence by parallel processing and probabilistic feedback control, All-pairs-shortest-length on strongly chordal graphs, Enhanced Modified-Polygon Method for Point-in-Polygon Problem, Data-movement-intensive problems: Two folk theorems in parallel computation revisited, Variety and connectivity in kinematic chains, The BOXEL framework for 2.5D data with applications to virtual drivethroughs and ray tracing, An artificial neural network based approach for online string matching/filtering of large databases, Parallel methods for visibility and shortest-path problems in simple polygons, Efficient intensity map splitting algorithms for intensity-modulated radiation therapy, Automating the approximate record-matching process, Topological recognition of polyhedral objects from multiple views, Two efficient algorithms for the computation of ideal sums in quadratic orders, On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic, Unnamed Item, Two flow network simplification algorithms, Models for concurrent product and process design, Regular Expressions and Transducers Over Alphabet-Invariant and User-Defined Labels, Enumerating \(k\)-way trees
