Illustration of Reif Macros
作者： Mukund N. Thapa , Sanguthevar Rajasekaran , Morgan Kaufmann , Sandeep Sen
DOI:
关键词: Computer science 、 Programming language
摘要:
uconn.edu 参考文章(26)
John H. Reif, On the Power of Probabilistic Choice in Synchronous Parallel Computations international colloquium on automata, languages and programming. pp. 442- 450 ,(1982) , 10.1007/BFB0012790
Sanguthevar Rajasekaran, Randomized Parallel Selection foundations of software technology and theoretical computer science. pp. 215- 224 ,(1990) , 10.1007/3-540-53487-3_46
Aho AV, JE Hopcroft, JD Ullman, The Design and Analysis of Computer Algorithms ,(1974)
Yossi Shiloach, Uzi Vishkin, Finding the maximum, merging and sorting in a parallel computation model Conpar 81. pp. 314- 327 ,(1981) , 10.1007/BFB0105127
Preparata, New Parallel-Sorting Schemes IEEE Transactions on Computers. ,vol. 27, pp. 669- 673 ,(1978) , 10.1109/TC.1978.1675167
Robert W. Floyd, Ronald L. Rivest, Expected time bounds for selection Communications of The ACM. ,vol. 18, pp. 165- 172 ,(1975) , 10.1145/360680.360691
John H. Reif, Leslie G. Valiant, A logarithmic time sort for linear size networks symposium on the theory of computing. pp. 10- 16 ,(1983) , 10.1145/800061.808727
Sandeep Sen, Finding an approximate median with high probability in constant parallel time Information Processing Letters. ,vol. 34, pp. 77- 80 ,(1990) , 10.1016/0020-0190(90)90140-S
Wassily Hoeffding, On the Distribution of the Number of Successes in Independent Trials Annals of Mathematical Statistics. ,vol. 27, pp. 713- 721 ,(1956) , 10.1214/AOMS/1177728178
Howard Karloff, Prabhakar Raghavan, Randomized algorithms and pseudorandom numbers symposium on the theory of computing. pp. 310- 321 ,(1988) , 10.1145/62212.62242