The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Parallel Evaluation of General Arithmetic Expressions
Journal of the ACM (JACM)
Bounds to Complexities of Networks for Sorting and for Switching
Journal of the ACM (JACM)
Communications of the ACM
Merging with parallel processors
Communications of the ACM
An efficient data structure for dynamic memory management
Journal of Systems and Software
On the time required for a sequence of matrix products
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Parallel algorithms for the transitive closure and the connected component problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Sorting on a mesh-connected parallel computer
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A study of parallelism in graph theory.
A study of parallelism in graph theory.
A taxonomy of parallel sorting
ACM Computing Surveys (CSUR)
A logarithmic time sort for linear size networks
Journal of the ACM (JACM)
A parallel algorithm for record clustering
ACM Transactions on Database Systems (TODS)
Sorting with Linear Speedup on a Pipelined Hypercube
IEEE Transactions on Computers
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
Efficient parallel algorithms for some integer problems
CSC '91 Proceedings of the 19th annual conference on Computer Science
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Efficient parallel algorithms for some graph problems
Communications of the ACM
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Computing connected components on parallel computers
Communications of the ACM
Bit-Sliced VLSI Algorithm for Search and Sort
VLDB '84 Proceedings of the 10th International Conference on Very Large Data Bases
A Study of Sort Algorithms for Multiprocessor Database Machines
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
An expandable multiprocessor architecture for video graphics (Preliminary Report)
ISCA '79 Proceedings of the 6th annual symposium on Computer architecture
Google's MapReduce programming model — Revisited
Science of Computer Programming
Binary Trees and Parallel Scheduling Algorithms
IEEE Transactions on Computers
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
The Parallel Enumeration Sorting Scheme for VLSI
IEEE Transactions on Computers
Google's MapReduce programming model – Revisited
Science of Computer Programming
The architecture of MANIP: a parallel computer system for solving NP-complete problems
AFIPS '81 Proceedings of the May 4-7, 1981, national computer conference
IBM Journal of Research and Development
A fast parallel algorithm for routing in permutation networks
IEEE Transactions on Computers
A cost optimal parallel quicksorting and its implementation on a shared memory parallel computer
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
A bibliography on computational molecular biology and genetics
Mathematical and Computer Modelling: An International Journal
| Hi-index | 48.28 |
A parallel bucket-sort algorithm is presented that requires time O(log n) and the use of n processors. The algorithm makes use of a technique that requires more space than the product of processors and time. A realistic model is used in which no memory contention is permitted. A procedure is also presented to sort n numbers in time O(k log n) using n1+1/k processors, for k an arbitrary integer. The model of computation for this procedure permits simultaneous fetches from the same memory location.