A universal interconnection pattern for parallel computers

Cited in

(40)

Optical computing
A note on the parallel computation thesis
An introduction to parallelism in combinatorial optimization
On the construction of parallel computers from various basis of Boolean functions
Array processing machines: an abstract model
Towards optimal parallel bucket sorting
On nondeterminism in parallel computation
On the time required to sum n semigroup elements on a parallel machine with simultaneous writes
The problem of space invariance for sequential machines
Simulations among concurrent-write PRAMs
On characterizations of the class PSPACE/poly
Parallel computation with threshold functions
An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs
Complexity theory of parallel time and hardware
Communication aspects of networks based on geometric incidence relations
Efficient simulations of simple models of parallel computation by time- bounded ATMs and space-bounded TMs
Processor-time tradeoffs in PRAM simulations
Multiplication, division, and shift instructions in parallel random access machines
Modelling knowledge and action in distributed systems
Restricted CRCW PRAMs
Parallel solutions to geometric problems in the scan model of computation
A chained-matrices approach for parallel computation of continued fractions and its applications
Efficient parallel algorithms for parameterized problems
Parallel pointer machines
The graph matching problem
On the power of families of recognizer spiking neural P systems
Classifying the computational complexity of problems
THE MAXIMUM WEIGHT PERFECT MATCHING PROBLEM FOR COMPLETE WEIGHTED GRAPHS IS IN PC∗†
Fast and optimal simulations between CRCW PRAMs
An improved parallel algorithm for integer GCD
Computation models and function algebras
Parallel machine models: how they are and where are they going
Imperative process algebra and models of parallel computation
On the formalization of the notion of a concurrent algorithm
Large parallel machines can be extremely slow for small problems
Sequential and parallel algorithms for the NCA problem on pure pointer machines
Low complexity classes of multidimensional cellular automata
An optimal time bound for oblivious routing
Incomparability in parallel computation

This page was built for publication: A universal interconnection pattern for parallel computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3951543)