A parallel-design distributed-implementation (PDDI) general-purpose computer
From MaRDI portal
(Redirected from Publication:797283)
Cites work
- scientific article; zbMATH DE number 3843145 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3543634 (Why is no real title available?)
- A Survey of Parallel Algorithms in Numerical Linear Algebra
- A fast parallel algorithm for routing in permutation networks
- An Efficient General-Purpose Parallel Computer
- An Efficient Parallel Biconnectivity Algorithm
- An O(logn) parallel connectivity algorithm
- An O(n2log n) parallel max-flow algorithm
- An optimal parallel connectivity algorithm
- Computing connected components on parallel computers
- Efficient parallel algorithms for some graph problems
- Fast parallel sorting algorithms
- Finding the maximum, merging, and sorting in a parallel computation model
- Implementation of simultaneous memory address access in models that forbid it
- New Parallel-Sorting Schemes
- On the computational power of pushdown automata
- Parallelism in random access machines
- Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories
- Simulation of Parallel Random Access Machines by Circuits
- Sorting in \(c \log n\) parallel steps
- The VLSI Complexity of Sorting
- Ultracomputers
Cited in
(4)- Resource bounds for parallel computation of threshold and symmetric functions
- Separation and lower bounds for ROM and nondeterministic models of parallel computation
- Parallélisation d'algorithmes avec un nombre fixe de processeurs
- An improved simulation of space and reversal bounded deterministic Turing machines by width and depth bounded uniform circuits
This page was built for publication: A parallel-design distributed-implementation (PDDI) general-purpose computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797283)
