The following pages link to (Q3773322):
Displayed 35 items.
- A divide and conquer method for polynomial zeros (Q911228) (← links)
- Speedup and optimality in pipeline programs (Q915426) (← links)
- Partial sum problem mapping into a hypercube (Q918652) (← links)
- Parallel depth first search. II: Analysis (Q1116344) (← links)
- A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
- Analysis and benchmarking of two parallel sorting algorithms: Hyperquicksort and quickmerge (Q1123621) (← links)
- Branch-and-bound as a higher-order function (Q1179748) (← links)
- Data-movement-intensive problems: Two folk theorems in parallel computation revisited (Q1184985) (← links)
- Parallel solution of Toeplitzlike linear systems (Q1190529) (← links)
- Multiplication, division, and shift instructions in parallel random access machines (Q1193622) (← links)
- Efficient algorithms for parallel sorting on mesh multicomputers (Q1193763) (← links)
- Chordal rings as fault-tolerant loops (Q1199459) (← links)
- The one-to-one shortest-path problem: An empirical analysis with the two- tree Dijkstra algorithm (Q1260623) (← links)
- Improved parallel computations with Toeplitz-like and Hankel-like matrices (Q1260780) (← links)
- Parallel processing for difficult combinatorial optimization problems (Q1268289) (← links)
- A parallel QR algorithm for the nonsymmetric eigenvalue problem (Q1330634) (← links)
- Coarse-grain parallelizations of interval algorithms decomposing dense matrices and solving triangular systems on multicomputers (Q1340868) (← links)
- A parallel algorithm for solving the incompressible Navier-Stokes problem (Q1802452) (← links)
- Parallel processing for fuzzy sets operations (Q1855498) (← links)
- Parallel tree contraction and prefix computations on a large family of interconnection topologies (Q1892710) (← links)
- Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints (Q1922637) (← links)
- Parallelization of differential problems by partitioning method (synchronized algorithm) (Q2367562) (← links)
- Proof that pyramid networks are 1-Hamiltonian-connected with high probability (Q2384537) (← links)
- On the strong distance problems of pyramid networks (Q2467410) (← links)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- Space-efficient parallel merging (Q3142264) (← links)
- Iteration grain sized asynchronous parallel algorithms in optimization (Q4243253) (← links)
- The calculation of separated flows using a distributed memory mimd computer (Q4289552) (← links)
- A fast algorithm to compute irreducible and primitive polynomials in finite fields (Q4327377) (← links)
- (Q4791046) (← links)
- Parallel algorithms for a multi-level network optimization problem (Q4819658) (← links)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS (Q4819957) (← links)
- EFFICIENT PARALLEL ALGORITHMS FOR PATTERN RECOGNITION∗ (Q4819983) (← links)
- THE CELLULAR AUTOMATA PARADIGM FOR THE PARALLEL SOLUTION OF HEAT TRANSFER PROBLEMS (Q4820170) (← links)
- The Performance of greedy algorithms for the on-line steiner tree and related problems (Q4850333) (← links)