Pages that link to "Item:Q1171382"

The following pages link to Parallel computation and conflicts in memory access (Q1171382):

Displaying 41 items.

• Computing OR on a randomized fixed adversary CRCW PRAM (Q287164) (← links)
• An improved parallel algorithm for integer GCD (Q582082) (← links)
• Relating the power of the multiple associative computing (MASC) model to that of reconfigurable bus-based models (Q666096) (← links)
• Parallel random access machines with bounded memory wordsize (Q757038) (← links)
• Large parallel machines can be extremely slow for small problems (Q807013) (← links)
• On the complexity of the recognition of parallel 2D-image languages (Q808271) (← links)
• Computing transitive closure on systolic arrays of fixed size (Q808290) (← links)
• A complexity theory of efficient parallel algorithms (Q913512) (← links)
• Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model (Q916359) (← links)
• Incomparability in parallel computation (Q919822) (← links)
• An adaptive and cost-optimal parallel algorithm for minimum spanning trees (Q1060018) (← links)
• Towards optimal parallel bucket sorting (Q1098305) (← links)
• Limits on the power of concurrent-write parallel machines (Q1103403) (← links)
• Fast parallel graph searching with applications (Q1103409) (← links)
• Simulations among concurrent-write PRAMs (Q1104097) (← links)
• Computing dominators in parallel (Q1108035) (← links)
• A parallel bucket sort (Q1108803) (← links)
• On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
• Reducing conflict resolution time for solving graph problems in broadcast communications (Q1183491) (← links)
• Processor-time tradeoffs in PRAM simulations (Q1185246) (← links)
• Expected parallel time and sequential space complexity of graph and digraph problems (Q1186789) (← links)
• Simulating the CRCW PRAM on reconfigurable networks (Q1275082) (← links)
• A new class of parallel algorithms for finding connected components on machines with bit-vector operations (Q1328526) (← links)
• Finding maximum matching for bipartite graphs in parallel (Q1342094) (← links)
• Constant-time parallel recognition of split graphs (Q1349719) (← links)
• Removing Ramsey theory: Lower bounds with smaller domain size (Q1392014) (← links)
• Parallel computation of perfect elimination schemes using partition techniques on triangulated graphs (Q1842819) (← links)
• Linear-size hopsets with small hopbound, and constant-hopbound hopsets in RNC (Q2084978) (← links)
• A parallel algorithm for surface-based object reconstruction (Q2273355) (← links)
• Fast sequential and parallel algorithms for finding extremal sets (Q2710788) (← links)
• Parallel computations on graphs (Q3221400) (← links)
• New fast parallel algorithm for the connected component problem and its VLSI implementation (Q3358233) (← links)
• An 0(log n) parallel algorithm for strong connectivity augmentation problem (Q3804208) (← links)
• FAST PARALLEL ALGORITHMS FOR FINDING CUTPOINTS AND BRIDGES OF UNDIRECTED GRAPHS (Q4820006) (← links)
• PARALLEL BLOCK-FINDING USING DISTANCE MATRICES (Q4820161) (← links)
• FINDING CENTERS AND MEDIANS OF GRAPHS IN PARALLEL (Q4820169) (← links)
• On the Parallel Evaluation of Dwba Integrals (Q4844588) (← links)
• Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)
• PARALLEL VERTEX COLOURING OF INTERVAL GRAPHS (Q5248988) (← links)
• Fast parallel heuristics for the job shop scheduling problem (Q5955476) (← links)
• Parallel approximation of optimization problems (Q6560202) (← links)