Pages that link to "Item:Q5402548"
From MaRDI portal
The following pages link to Parallelism in random access machines (Q5402548):
Displaying 50 items.
- The latency-of-data-access model for analyzing parallel computation (Q293286) (← links)
- Low-contention data structures (Q433458) (← links)
- Parallel \(\mathcal H\)-matrix arithmetics on shared memory systems (Q556636) (← links)
- Parallel algorithms for a class of graphs generated recursively (Q582922) (← links)
- A bridging model for multi-core computing (Q619912) (← links)
- Reliable computations on faulty EREW PRAM (Q671425) (← links)
- Fast rehashing in PRAM emulations (Q672145) (← links)
- Fast recognition of deterministic cfl's with a smaller number of processors (Q685360) (← links)
- A note on the parallel complexity of anti-unification (Q688579) (← links)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- The cache complexity of multithreaded cache oblivious algorithms (Q733717) (← links)
- Analysis of parallel uniform hashing (Q750157) (← links)
- Deterministic P-RAM simulation with constant redundancy (Q756419) (← links)
- A parallel-design distributed-implementation (PDDI) general-purpose computer (Q797283) (← links)
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- Re-scheduling invocations of services for RPC grids (Q875959) (← links)
- Optimally edge-colouring outerplanar graphs is in NC (Q909461) (← links)
- Parallelism and fast solution of linear systems (Q911213) (← links)
- A new scheme for the deterministic simulation of PRAMs in VLSI (Q911777) (← links)
- Parallel tree pattern matching (Q912610) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Parallel models of computation: An introductory survey (Q916358) (← links)
- A parallel method for fast and practical high-order Newton interpolation (Q920539) (← links)
- Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
- Optical computing (Q1036535) (← links)
- A note on the ''parallel computation thesis'' (Q1056537) (← links)
- Depth-first search is inherently sequential (Q1062456) (← links)
- Speedups of deterministic machines by synchronous parallel machines (Q1074339) (← links)
- Routing, merging, and sorting on parallel models of computation (Q1082818) (← links)
- A parallel algorithm for the monadic unification problem (Q1083189) (← links)
- Parallel approximation schemes for subset sum and knapsack problems (Q1084863) (← links)
- Optimal parallel parsing of bracket languages (Q1093379) (← links)
- Array processing machines: an abstract model (Q1094879) (← links)
- Parallel time O(log n) recognition of unambiguous context-free languages (Q1096400) (← links)
- Parallelism and the maximal path problem (Q1098641) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- An optimal parallel algorithm for triangulating a set of points in the plane (Q1100899) (← links)
- A parallel algorithm for the maximal path problem (Q1100916) (← links)
- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes (Q1101213) (← links)
- Optimal parallel randomized algorithms for sparse addition and identification (Q1103402) (← links)
- Data structures and algorithms for approximate string matching (Q1104103) (← links)
- An efficient parallel algorithm for updating minimum spanning trees (Q1105383) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits (Q1108006) (← links)
- Parallel algorithms for finding Hamilton cycles in random graphs (Q1108039) (← links)
- A probabilistic simulation of PRAMs on a bounded degree network (Q1113672) (← links)
- An efficient parallel algorithm for planarity (Q1114415) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Parallel approximation algorithms for bin packing (Q1123807) (← links)