%0 Journal Article %1 Gupta1984 %A Gupta, P. %A Bhattacharjee, G. P. %D 1984 %J BIT Numerical Mathematics %K algorithm canada discovery emm parallel selection subgroup %N 3 %P 274--287 %R 10.1007/BF02136026 %T A parallel selection algorithm %U https://doi.org/10.1007/BF02136026 %V 24 %X The problem of selecting thekth largest or smallest element of \x i +y j |x i $\epsilon$X andy j $\epsilon$Y ∀i,j\ whereX=(x1,x2, ..,x n ) andY=(y1,y2, ...,y n ) are two arrays ofn elements each, is considered. Certain improvements to an existing algorithm are proposed. An algorithm requiringO(logk·logn) units of time on a Shared Memory Model of a parallel computer havingO(n1+1/$\beta$) processors is presented where $\beta$ is a pre-assigned constant lying between 1 and 2.

@article{Gupta1984, abstract = {The problem of selecting thekth largest or smallest element of {\{}x i +y j |x i $\epsilon$X andy j $\epsilon$Y ∀i,j{\}} whereX=(x1,x2, ..,x n ) andY=(y1,y2, ...,y n ) are two arrays ofn elements each, is considered. Certain improvements to an existing algorithm are proposed. An algorithm requiringO(logk{\textperiodcentered}logn) units of time on a Shared Memory Model of a parallel computer havingO(n1+1/$\beta$) processors is presented where $\beta$ is a pre-assigned constant lying between 1 and 2.}, added-at = {2018-06-03T14:54:34.000+0200}, author = {Gupta, P. and Bhattacharjee, G. P.}, biburl = {https://www.bibsonomy.org/bibtex/21d9db3897def3f41ffa4c6d85d1f48d4/becker}, day = 01, description = {A parallel selection algorithm | SpringerLink}, doi = {10.1007/BF02136026}, interhash = {e6aea902c7e6a28c9b899e943a343cc4}, intrahash = {1d9db3897def3f41ffa4c6d85d1f48d4}, issn = {1572-9125}, journal = {BIT Numerical Mathematics}, keywords = {algorithm canada discovery emm parallel selection subgroup}, month = sep, number = 3, pages = {274--287}, timestamp = {2018-06-03T14:54:34.000+0200}, title = {A parallel selection algorithm}, url = {https://doi.org/10.1007/BF02136026}, volume = 24, year = 1984 }