Parallelism and algorithms for algebraic manipulation: current work
ACM SIGSAM Bulletin
Improved algorithms for graph four-connectivity
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Cascading divide-and-conquer: A technique for designing parallel algorithms
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Short Communication: A faster optimal algorithm for the measure problem
Parallel Computing
Short Communication: An efficient parallel algorithm for multiselection
Parallel Computing
Recursion and parallel algorithms in geometric modeling problems
Cybernetics and Systems Analysis
The system of common algorithmic space to create visual models of phenomena and processes
Proceedings of the International Conference on Applications of Computer and Information Sciences to Nature Research
The round complexity of distributed sorting: extended abstract
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Implementation matters: programming best practices for evolutionary algorithms
IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part II
| Hi-index | 0.00 |
We give a parallel implementation of merge sort on a CREW PRAM that uses n processors and O(logn) time; the constant in the running time is small. We also give a more complex version of the algorithm for the EREW PRAM; it also uses n processors and O(logn) time. The constant in the running time is still moderate, though not as small.