The following pages link to (Q3992991):
Displayed 40 items.
- Design of parallel algorithms for the single resource allocation problem (Q1584827) (← links)
- Robust algorithms for constructing strongly convex hulls in parallel. (Q1853528) (← links)
- Improving the efficiency of parallel minimum spanning tree algorithms (Q1861567) (← links)
- Squares, cubes, and time-space efficient string searching (Q1894296) (← links)
- The parallel complexity of growth models (Q1906438) (← links)
- Stochastic modelling of diffusion equations on a parallel machine (Q1923740) (← links)
- The computational complexity of generating random fractals (Q1946896) (← links)
- Computing parameters of sequence-based dynamic graphs (Q1999994) (← links)
- Dense edge-disjoint embedding of complete binary trees in the hypercube (Q2365823) (← links)
- Speed and quality of collective decision making: Imperfect information processing (Q2373770) (← links)
- The balanced binary tree technique on mesh-connected computers (Q2638775) (← links)
- Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs (Q2947012) (← links)
- Covering Polygons with Rectangles (Q2988828) (← links)
- A sequential sorting network analogous to the batcher merge (Q3361877) (← links)
- A TREE-HEIGHT HIERARCHY OF CONTEXT-FREE LANGUAGES (Q3401487) (← links)
- EFFICIENT HARDWARE ALGORITHMS FOR <font>N</font> CHOOSE <font>K</font> COUNTERS USING THE BITONIC MERGER (Q3444843) (← links)
- The quickest flow problem (Q4031968) (← links)
- A PARALLEL DEMAND-DRIVEN SIMULATION ALGORITHM FOR SIMD COMPUTERS (Q4240888) (← links)
- From the theory to the tools: parallel dynamic programming (Q4487154) (← links)
- OPTIMAL PARALLEL PREPROCESSING ALGORITHMS FOR TESTING WEAK VISIBILITY OF POLYGONS FROM SEGMENTS (Q4819957) (← links)
- parallel parsing from recurrence equations (Q4870969) (← links)
- The Power of Spreadsheet Computations (Q5049057) (← links)
- A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)
- Efficient parallel computing with memory faults (Q5055934) (← links)
- An optimal parallel algorithm for computing a near-optimal order of matrix multiplications (Q5056129) (← links)
- Lower bounds for the matrix chain ordering problem (Q5096328) (← links)
- Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition (Q5096776) (← links)
- Graph layout problems (Q5096816) (← links)
- Parallel recognition and ranking of context-free languages (Q5096817) (← links)
- Natural complexity, computational complexity and depth (Q5264347) (← links)
- TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION (Q5696966) (← links)
- On the complexity of the maximum biplanar subgraph problem (Q5946290) (← links)
- Parallel dynamics and computational complexity of the Bak-Sneppen model (Q5947837) (← links)
- Fast parallel heuristics for the job shop scheduling problem (Q5955476) (← links)
- Fast parallel algorithms for the maximum empty rectangle problem. (Q5955753) (← links)
- Fast deterministic simulation of computations on faulty parallel machines (Q6102293) (← links)
- Sub-cubic cost algorithms for the all pairs shortest path problem (Q6122235) (← links)
- The parallel complexity of elimination ordering procedures (Q6143979) (← links)
- The maximal f-dependent set problem for planar graphs is in NC (Q6184372) (← links)
- Approximating minimum weight perfect matchings for complete graphs satisfying the triangle inequality (Q6184389) (← links)