Implementation of simultaneous memory address access in models that forbid it
- 1 March 1983
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 4 (1), 45-50
- https://doi.org/10.1016/0196-6774(83)90033-0
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An O(n2log n) parallel max-flow algorithmJournal of Algorithms, 1982
- An O(logn) parallel connectivity algorithmJournal of Algorithms, 1982
- Finding the maximum, merging, and sorting in a parallel computation modelJournal of Algorithms, 1981
- A fast parallel algorithm for routing in permutation networksIEEE Transactions on Computers, 1981
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Computing connected components on parallel computersCommunications of the ACM, 1979
- Fast parallel sorting algorithmsCommunications of the ACM, 1978
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Parallel Computations in Graph TheorySIAM Journal on Computing, 1978
- Merging with parallel processorsCommunications of the ACM, 1975