{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T11:21:05Z","timestamp":1742383265413},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1992,6,1]],"date-time":"1992-06-01T00:00:00Z","timestamp":707356800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1992,6]]},"DOI":"10.1016\/0020-0190(92)90240-v","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:45:40Z","timestamp":1027640740000},"page":"203-208","source":"Crossref","is-referenced-by-count":12,"title":["Sorting on PRAMs with reconfigurable buses"],"prefix":"10.1016","volume":"42","author":[{"given":"Ramachandran","family":"Vaidyanathan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(92)90240-V_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(92)90240-V_BIB2","series-title":"Proc 3rd Aegean Workshop on Computing","first-page":"81","article-title":"Deterministic parallel list ranking","volume":"319","author":"Anderson","year":"1988"},{"key":"10.1016\/0020-0190(92)90240-V_BIB3","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1145\/65950.65958","article-title":"Optimal bounds for decision problems on the CRCW PRAM","volume":"36","author":"Beame","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(92)90240-V_BIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(91)90031-V","article-title":"Improved deterministic parallel integer sorting","volume":"94","author":"Bhatt","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/0020-0190(92)90240-V_BIB5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(92)90240-V_BIB6","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0020-0190(90)90158-T","article-title":"Constant time sorting on a processor array with a reconfigurable bus system","volume":"34","author":"Wang","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(92)90240-V_BIB7","doi-asserted-by":"crossref","first-page":"500","DOI":"10.1109\/71.80177","article-title":"Constant time algorithms for the transitive closure and some related graph problems on processor arrays with reconfigurable bus systems","volume":"1","author":"Wang","year":"1990","journal-title":"IEEE Trans. Parallel Distributed Systems"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290240V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909290240V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:21:20Z","timestamp":1555118480000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909290240V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,6]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,6]]}},"alternative-id":["002001909290240V"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(92)90240-v","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1992,6]]}}}