{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:37:29Z","timestamp":1649147849757},"reference-count":11,"publisher":"World Scientific Pub Co Pte Lt","issue":"01","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,2]]},"abstract":"<jats:p> Partitioned Optical Passive Stars (POPS) network has been presented recently as a desirable model of parallel computation. Several papers have been published that address fundamental problems on this architecture. The algorithms presented in this paper are valid for POPS(d,g) where d&gt;g and use randomization. We present an algorithm that solves the problem of sparse enumeration sorting of d<jats:sup>\u220a<\/jats:sup> keys in [Formula: see text] time and hence performs better than previous algorithms. We also present algorithms that allow us to do stable sorting of integers in the range [1, log n] and [Formula: see text] in [Formula: see text] time. When g=n<jats:sup>\u220a<\/jats:sup>, for any constant 0&lt;\u220a&lt;\u00bd this allows us to do sorting of integers in the range [1,n] in [Formula: see text] time. We finally use these algorithms to solve the problem of multiple binary search in the case where we have d<jats:sup>\u220a<\/jats:sup> keys in [Formula: see text] time and in the case where we have integer keys in the range [1,n] in [Formula: see text] time, when g=n<jats:sup>\u220a<\/jats:sup>, for some constant 0&lt;\u220a&lt;\u00bd. <\/jats:p>","DOI":"10.1142\/s0129054105002899","type":"journal-article","created":{"date-parts":[[2005,3,14]],"date-time":"2005-03-14T03:00:11Z","timestamp":1110769211000},"page":"105-116","source":"Crossref","is-referenced-by-count":2,"title":["RANDOMIZED SORTING ON THE POPS NETWORK"],"prefix":"10.1142","volume":"16","author":[{"given":"JAIME","family":"DAVILA","sequence":"first","affiliation":[]},{"given":"SANGUTHEVAR","family":"RAJASEKARAN","sequence":"additional","affiliation":[]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf3","first-page":"306","volume":"14","author":"Datta A.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1145\/321592.321600"},{"key":"rf6","volume-title":"Computer Algorithms","author":"Horowitz E.","year":"1998"},{"key":"rf7","volume-title":"The Art of Computer Programming, Vol. 3: Sorting and Searching","author":"Knuth D. E.","year":"1973"},{"key":"rf10","volume-title":"Proc. Tenth International IEEE Conference on Parallel and Distributed Systems (ICPADS)","author":"Rajasekaran S.","year":"2004"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1137\/0218041"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1109\/71.642947"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/BF01178563"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1109\/71.877830"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1109\/71.877832"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185406"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105002899","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:27:01Z","timestamp":1565177221000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105002899"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":11,"journal-issue":{"issue":"01","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,2]]}},"alternative-id":["10.1142\/S0129054105002899"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105002899","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}