Pages that link to "Item:Q913512"

The following pages link to A complexity theory of efficient parallel algorithms (Q913512):

Displaying 32 items.

• Low-contention data structures (Q433458) (← links)
• Integer merging on EREW PRAM (Q644851) (← links)
• A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
• Efficient sampling of random permutations (Q954966) (← links)
• Parallel merging with restriction (Q1009355) (← links)
• The bulk-synchronous parallel random access machine (Q1128714) (← links)
• Parallel computation: Theory and algorithms (review) (Q1183834) (← links)
• A theory of strict P-completeness (Q1337145) (← links)
• Improved parallel integer sorting without concurrent writing (Q1362905) (← links)
• Parallel algorithms for certain matrix computations (Q1390874) (← links)
• Algorithms for the parallel alternating direction access machine (Q1575740) (← links)
• Improved fast integer sorting in linear space (Q1854461) (← links)
• Parallel local search (Q1922627) (← links)
• Efficient PRAM simulation on a distributed memory machine (Q1923863) (← links)
• Data independence of read, write, and control structures in PRAM computations (Q1975968) (← links)
• Division in logspace-uniform NC (Q2773023) (← links)
• Space-efficient parallel merging (Q3142264) (← links)
• (Q3369018) (← links)
• A taxonomy of problems with fast parallel algorithms (Q3694688) (← links)
• The Dynamic Parallel Complexity of Computational Circuits (Q4268813) (← links)
• (Q4282847) (← links)
• MIMD VERSUS SIMD COMPUTATION: EXPERIENCE WITH NON-NUMERIC PARALLEL ALGORITHMS∗ † (Q4819986) (← links)
• THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
• FAST, EFFICIENT MUTUAL AND SELF SIMULATIONS FOR SHARED MEMORY AND RECONFIGURABLE MESH (Q4820153) (← links)
• Strict sequential P-completeness (Q5048935) (← links)
• PRAM's towards realistic parallelism: BRAM's (Q5055910) (← links)
• A theory of strict P-completeness (Q5096767) (← links)
• A parallel algorithm for computing the flow complex (Q5174462) (← links)
• Polynomial hash functions are reliable (Q5204320) (← links)
• Fast deterministic simulation of computations on faulty parallel machines (Q6102293) (← links)
• Recursively divisible problems (Q6487438) (← links)
• Imperative process algebra and models of parallel computation (Q6580081) (← links)