Results 1 
3 of
3
Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
 SIAM Journal on Computing
, 1989
"... .We assume a parallel RAM model which allows both concurrent reads and concurrent writes of a global memory. Our main result is an optimal randomized parallel algorithm for INTEGER SORT (i.e., for sorting n integers in the range [1; n]). Our algorithm costs only logarithmic time and is the first kno ..."
Abstract

Cited by 64 (12 self)
 Add to MetaCart
.We assume a parallel RAM model which allows both concurrent reads and concurrent writes of a global memory. Our main result is an optimal randomized parallel algorithm for INTEGER SORT (i.e., for sorting n integers in the range [1; n]). Our algorithm costs only logarithmic time and is the first known that is optimal: the product of its time and processor bounds is upper bounded by a linear function of the input size. We also give a deterministic sublogarithmic time algorithm for prefix sum. In addition we present a sublogarithmic time algorithm for obtaining a random permutation of n elements in parallel. And finally, we present sublogarithmic time algorithms for GENERAL SORT and INTEGER SORT. Our sublogarithmic GENERAL SORT algorithm is also optimal. Key words. Randomized algorithms, parallel sorting, parallel random access machines, random permutations, radix sort, prefix sum, optimal algorithms. AMS(MOS) subject classifications. 68Q25. 1 A preliminary version of this paper ...
MartinLöf Random and PAcomplete Sets
 In [4
, 2002
"... A set A is MartinLof random iff the class fAg does not have \Sigma 1 measure 0. A set A is PAcomplete if one can compute relative to A a consistent and complete extension of Peano Arithmetic. It is shown that every MartinLof random set either permits to solve the halting problem K or is not ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
A set A is MartinLof random iff the class fAg does not have \Sigma 1 measure 0. A set A is PAcomplete if one can compute relative to A a consistent and complete extension of Peano Arithmetic. It is shown that every MartinLof random set either permits to solve the halting problem K or is not PAcomplete. This result implies a negative answer to the question of AmbosSpies and Kucera whether there is a MartinLof random set not above K which is also PAcomplete.
What is a Random Sequence
 The Mathematical Association of America, Monthly
, 2002
"... there laws of randomness? These old and deep philosophical questions still stir controversy today. Some scholars have suggested that our difficulty in dealing with notions of randomness could be gauged by the comparatively late development of probability theory, which had a ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
there laws of randomness? These old and deep philosophical questions still stir controversy today. Some scholars have suggested that our difficulty in dealing with notions of randomness could be gauged by the comparatively late development of probability theory, which had a