Pages that link to "Item:Q3951543"
From MaRDI portal
The following pages link to A universal interconnection pattern for parallel computers (Q3951543):
Displaying 37 items.
- An improved parallel algorithm for integer GCD (Q582082) (← links)
- Large parallel machines can be extremely slow for small problems (Q807013) (← links)
- Sequential and parallel algorithms for the NCA problem on pure pointer machines (Q818121) (← links)
- Low complexity classes of multidimensional cellular automata (Q861257) (← links)
- An optimal time bound for oblivious routing (Q908701) (← links)
- Incomparability in parallel computation (Q919822) (← links)
- Optical computing (Q1036535) (← links)
- A note on the ''parallel computation thesis'' (Q1056537) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- On the construction of parallel computers from various basis of Boolean functions (Q1083204) (← links)
- Array processing machines: an abstract model (Q1094879) (← links)
- Towards optimal parallel bucket sorting (Q1098305) (← links)
- On nondeterminism in parallel computation (Q1099612) (← links)
- On the time required to sum n semigroup elements on a parallel machine with simultaneous writes (Q1101213) (← links)
- The problem of space invariance for sequential machines (Q1102112) (← links)
- Simulations among concurrent-write PRAMs (Q1104097) (← links)
- On characterizations of the class PSPACE/poly (Q1107320) (← links)
- Parallel computation with threshold functions (Q1107324) (← links)
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits (Q1108006) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- Complexity theory of parallel time and hardware (Q1116695) (← links)
- Communication aspects of networks based on geometric incidence relations (Q1119610) (← links)
- Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs (Q1124332) (← links)
- Processor-time tradeoffs in PRAM simulations (Q1185246) (← links)
- Multiplication, division, and shift instructions in parallel random access machines (Q1193622) (← links)
- Modelling knowledge and action in distributed systems (Q1262142) (← links)
- Restricted CRCW PRAMs (Q1314395) (← links)
- Parallel solutions to geometric problems in the scan model of computation (Q1318471) (← links)
- A chained-matrices approach for parallel computation of continued fractions and its applications (Q1332396) (← links)
- Efficient parallel algorithms for parameterized problems (Q2319897) (← links)
- Parallel pointer machines (Q2366720) (← links)
- The graph matching problem (Q2444585) (← links)
- ON THE POWER OF FAMILIES OF RECOGNIZER SPIKING NEURAL <font>P</font> SYSTEMS (Q3076599) (← links)
- Classifying the computational complexity of problems (Q3781088) (← links)
- THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗† (Q4820105) (← links)
- Fast and optimal simulations between CRCW PRAMs (Q5096768) (← links)
- Computation models and function algebras (Q6064278) (← links)