Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Fast parallel sorting algorithms
Communications of the ACM
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Efficient schemes for parallel communication
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Randomized parallel communication (Preliminary Version)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Tight bounds on the complexity of parallel sorting
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Computational Aspects of VLSI
Dynamic parallel complexity of computational circuits
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The construction of Huffman-equivalent prefix code in NC
ACM SIGACT News
Efficient Parallel Convex Hull Algorithms
IEEE Transactions on Computers
Dynamic computational geometry on parallel computers
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Polling: a new randomized sampling technique for computational geometry
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Parallel Quicksort Using Fetch-And-Add
IEEE Transactions on Computers
Randomized algorithms for binary search and load balancing with geometric applications
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Optimal disk I/O with parallel block transfer
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Large-scale sorting in parallel memories (extended abstract)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Optimal VLSI Sorting with Reduced Number of Processors
IEEE Transactions on Computers
Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal sorting on mesh-connected processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Maintaining dynamic ordered sets on processor networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Implementations of randomized sorting on large parallel machines
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
High-level optimization via automated statistical modeling
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
Accounting for memory bank contention and delay in high-bandwidth multiprocessors
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Mesh Connected Computers with Fixed and Reconfigurable Buses: Packet Routing and Sorting
IEEE Transactions on Computers
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fast Parallel Sorting Under LogP: Experience with the CM-5
IEEE Transactions on Parallel and Distributed Systems
Work-preserving emulations of fixed-connection networks
Journal of the ACM (JACM)
Improved routing and sorting on multibutterflies
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Accounting for Memory Bank Contention and Delay in High-Bandwidth Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
An Efficient Sorting Algorithm on the Multi-Mesh Network
IEEE Transactions on Computers
A framework for simple sorting algorithms on parallel disk systems (extended abstract)
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Parallel and Distributed Systems
Fast incremental maintenance of approximate histograms
ACM Transactions on Database Systems (TODS)
Journal of Algorithms
A Randomized Sorting Algorithm on the BSP model
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Faster deterministic sorting through better sampling
Theoretical Computer Science
Randomized selection in n + C + o(n) comparisons
Information Processing Letters
Evaluating holistic aggregators efficiently for very large datasets
The VLDB Journal — The International Journal on Very Large Data Bases
A scalable VLSI speed/area tunable sorting network
Journal of Systems Architecture: the EUROMICRO Journal
Algorithms and theory of computation handbook
Automated tuning in parallel sorting on multi-core architectures
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Basic computations in wireless networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
GPC'06 Proceedings of the First international conference on Advances in Grid and Pervasive Computing
Communication and energy efficient routing protocols for single-hop radio networks
Journal of Parallel and Distributed Computing
HykSort: a new variant of hypercube quicksort on distributed memory architectures
Proceedings of the 27th international ACM conference on International conference on supercomputing
| Hi-index | 0.02 |
A randomized algorithm that sorts on an N node network with constant valence in O(log N) time is given. More particularly, the algorithm sorts N items on an N-node cube-connected cycles graph, and, for some constant k, for all large enough &agr;, it terminates within k&agr; log N time with probability at least 1 - N-&agr;.