Ultracomputers
From MaRDI portal
Cited in
(40)- The mathematics of perfect shuffles
- A multiprocess network logic with temporal and spatial modalities
- An introduction to parallelism in combinatorial optimization
- Routing, merging, and sorting on parallel models of computation
- Optimal computation of prefix sums on a binary tree of processors
- Parallel computation with threshold functions
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
- On efficient parallel computations for some dynamic programming problems
- A probabilistic simulation of PRAMs on a bounded degree network
- Interpolation between bases and the shuffle exchange network
- Techniques for parallel manipulation of sparse matrices
- A layout for the shuffle-exchange network with theta(N^ 2 /log N) area
- Oblivious routing with limited buffer capacity
- Radix sort on the hypercube
- Processor-efficient implementation of a maximum flow algorithm
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
- Optimal routing algorithms for mesh-connected processor arrays
- Efficient parallel algorithms for graph problems
- Deterministic sorting in nearly logarithmic time on the hypercube and related computers
- Parallel solutions to geometric problems in the scan model of computation
- A design of a parallel dictionary using skip lists
- Divide-and-conquer algorithms on the hypercube
- Efficient massively parallel implementation of some combinatorial algorithms
- Representing graph families with edge grammars
- An asymptotically optimal layout for the shuffle-exchange graph
- Parallel tree contraction and prefix computations on a large family of interconnection topologies
- Shuffle-ring: A new constant-degree network
- Space-efficient parallel merging
- Layouts for the Shuffle-Exchange Graph Based on the Complex Plane Diagram
- Parallélisation d'algorithmes avec un nombre fixe de processeurs
- Parallélisation sémantique
- On the performance and cost of some PRAM models on CMP hardware
- Exposing graph uniformities via algebraic specification
- Communication primitives for BSP computers
- The 1982 ACM Turing Award lecture. An overview of computational complexity
- A parallel-design distributed-implementation (PDDI) general-purpose computer
- An optimal parallel connectivity algorithm
- A new scheme for the deterministic simulation of PRAMs in VLSI
- A complexity theory of efficient parallel algorithms
- Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model
This page was built for publication: Ultracomputers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3922148)
