Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
A fast and simple randomized parallel algorithm for the maximal independent set problem
Journal of Algorithms
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Tight comparison bounds on the complexity of parallel sorting
SIAM Journal on Computing
An optimally efficient selection algorithm
Information Processing Letters
The average complexity of deterministic and randomized parallel comparison-sorting algorithms
SIAM Journal on Computing
SIAM Journal on Computing
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
Optimal and sublogarithmic time randomized parallel sorting algorithms
SIAM Journal on Computing
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Cutting hyperplane arrangements
Discrete & Computational Geometry
Ultra-fast expected time parallel algorithms
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fast deterministic approximate and exact parallel sorting
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
On construction of k-wise independent random variables
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On linear-time deterministic algorithms for optimization problems in fixed dimension
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Chernoff-Hoeffding bounds for applications with limited independence
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Optimal deterministic approximate parallel prefix sums and their applications
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Waste makes haste: tight bounds for loose parallel sorting
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Randomness-efficient oblivious sampling
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Parallel algorithms for higher-dimensional convex hulls
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Approximate parallel prefix computation and its applications
IPPS '93 Proceedings of the 1993 Seventh International Parallel Processing Symposium
| Hi-index | 0.00 |
Given an input array of n real numbers, sorting with padding λ consists in writing those numbers in order in an array of size (1+λR)n, thus leaving λn entries empty. Only comparisons are allowed between the numbers to be sorted. We describe an algorithm that, with nk processors in the CRCW PRAM model, sorts the input array with padding o(1) using time O(logkn log*(logkn) + loglogk). This improves a previous algorithm with time bound O(logk n (loglog k)3 ċ 2C(log*n-log*k)) The best known lower bound is Ω(logk n).