Parallel selection

[1]  R. Häggkvist,et al.  Sorting and Merging in Rounds , 1982 .

[2]  Noga Alon,et al.  Sorting, Approximate Sorting, and Searching in Rounds , 1988, SIAM J. Discret. Math..

[3]  Richard Cole,et al.  Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.

[4]  János Komlós,et al.  Deterministic selection in O(loglog N) parallel time , 1986, STOC '86.

[5]  Manuel Blum,et al.  Time Bounds for Selection , 1973, J. Comput. Syst. Sci..

[6]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[7]  Nimrod Megiddo,et al.  Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[8]  Yossi Azar,et al.  Tight Comparison Bounds on the Complexity of Parallel Sorting , 2018, SIAM J. Comput..

[9]  Noga Alon,et al.  Finding an Approximate Maximum , 1989, SIAM J. Comput..

[10]  Nicholas Pippenger,et al.  Sorting and Selecting in Rounds , 1987, SIAM J. Comput..

[11]  E. Szemerédi,et al.  Sorting inc logn parallel steps , 1983 .

[12]  Clyde P. Kruskal,et al.  Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.

[13]  Nicholas Pippenger.  CHAPTER 15 – Communication Networks , 1990 .

[14]  P. Turán.  On the theory of graphs , 1954 .