Parallel Integer Sorting Is More Efficient Than Parallel Comparison Sorting on Exclusive Write PRAMs

Authors:
Yijie Han;Xiaojun Shen
Affiliations:
-;-
Venue:
SIAM Journal on Computing
Year:
2002

Citing 0
Cited 6

Recognizing and representing proper interval graphs in parallel using merging and sorting

Discrete Applied Mathematics
Approximating Huffman codes in parallel

Journal of Discrete Algorithms
On coding labeled trees

Theoretical Computer Science
An efficient parallel algorithm for building the separating tree

Journal of Parallel and Distributed Computing
Fast computation of small cuts via cycle space sampling

ACM Transactions on Algorithms (TALG)
More efficient parallel integer sorting

FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Collective coin-flipping is the problem of producing common random bits in a distributed computing environment with adversarial faults. We consider the perfect information model: all communication is by broadcast and corrupt players are computationally ...