{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T00:14:49Z","timestamp":1698106489709},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,2,1]],"date-time":"1989-02-01T00:00:00Z","timestamp":602294400000},"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":[[1989,2]]},"DOI":"10.1016\/0020-0190(89)90130-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:10:11Z","timestamp":1027656611000},"page":"127-132","source":"Crossref","is-referenced-by-count":3,"title":["Bit complexity of order statistics on a distributed star network"],"prefix":"10.1016","volume":"30","author":[{"given":"O.","family":"Gerstel","sequence":"first","affiliation":[]},{"given":"Y.","family":"Mansour","sequence":"additional","affiliation":[]},{"given":"S.","family":"Zaks","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(89)90130-0_BIB1","first-page":"154","article-title":"Tradeoffs for selection in distributed networks","author":"Fredrickson","year":"1983","journal-title":"Proc. 2nd ACM Colloquium on Principles of Disturbed Computing"},{"key":"10.1016\/0020-0190(89)90130-0_BIB2","series-title":"TR 373","article-title":"On the Message Complexity and Bit Complexity of Distributes Sorting","author":"Gerstel","year":"1985"},{"key":"10.1016\/0020-0190(89)90130-0_BIB3","first-page":"235","article-title":"Distributed algorithms for ranking the nodes of a network","author":"Korach","year":"1982","journal-title":"Proc. 13th Southeastern Conf. on Combinatorics, Graph Theory and Computing"},{"issue":"1\u20133","key":"10.1016\/0020-0190(89)90130-0_BIB4","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/S0019-9958(84)80022-4","article-title":"The complexity of sorting on distributed systems","volume":"60","author":"Loui","year":"1984","journal-title":"Inform. and Control"},{"issue":"4","key":"10.1016\/0020-0190(89)90130-0_BIB5","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/TC.1985.5009389","article-title":"Distributed sorting","volume":"C-34","author":"Rotem","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(89)90130-0_BIB6","first-page":"143","article-title":"Distributed k-selection: from a sequential to a distributed algorithm","author":"Shrira","year":"1983","journal-title":"Proc. 2nd ACM Colloquium on Principles of Distributed Computing"},{"issue":"4","key":"10.1016\/0020-0190(89)90130-0_BIB7","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1109\/TC.1985.5009390","article-title":"Optimal distributed algorithms for sorting and ranking","volume":"C-34","author":"Zaks","year":"1985","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019089901300?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:55:34Z","timestamp":1555088134000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019089901300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["0020019089901300"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(89)90130-0","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}