{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:39:14Z","timestamp":1762270754717,"version":"build-2065373602"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0743-7315(92)90061-q","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"79-84","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":24,"title":["Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting"],"prefix":"10.1016","volume":"15","author":[{"given":"Yen-Cheng","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Tsuen","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gen-Huey","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0743-7315(92)90061-Q_BIB1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TC.1986.1676658","article-title":"Optimal bounds for finding maximum on array of processors with k Global buses","volume":"35","author":"Aggarwal","year":"1986","journal-title":"IEEE Trans. Comput. C"},{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/0743-7315(92)90061-Q_BIB2"},{"key":"10.1016\/0743-7315(92)90061-Q_BIB3","series-title":"Proc. 1981 International Conference on Parallel Processing","first-page":"302","article-title":"MAX: An algorithm for finding maximum in an array processor with a Global Bus","author":"Bokhari","year":"1981"},{"issue":"2","key":"10.1016\/0743-7315(92)90061-Q_BIB4","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TC.1984.1676405","article-title":"Finding maximum on an array processor with a global bus","volume":"33","author":"Bokhari","year":"1984","journal-title":"IEEE Trans. Comput. C"},{"key":"10.1016\/0743-7315(92)90061-Q_BIB5","series-title":"Proc. 1985 International Conference on Parallel Processing","first-page":"418","article-title":"A mesh automation for solving dense linear systems","author":"Cappello","year":"1985"},{"key":"10.1016\/0743-7315(92)90061-Q_BIB6","series-title":"Proc. 1985 International Conference on Parallel Processing","first-page":"715","article-title":"Performing tree and prefix computations on modified mesh-connected parallel computers","author":"Carlson","year":"1985"},{"key":"10.1016\/0743-7315(92)90061-Q_BIB7","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0743-7315(90)90073-X","article-title":"Solving linear recurrence systems on mesh-connected computers with multiple global buses","volume":"8","author":"Carlson","year":"1990","journal-title":"J. Parallel Distrib. Comput."},{"issue":"2","key":"10.1016\/0743-7315(92)90061-Q_BIB8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/71.80135","article-title":"Designing efficient parallel algorithms on mesh-connected computers with multiple broadcasting","volume":"1","author":"Chen","year":"1990","journal-title":"IEEE Trans. Parallel Distrib. Systems"},{"article-title":"parallel algorithms for two-variable linear programming on mesh-connected computers with multiple broadcasting","year":"1990","author":"Chen","key":"10.1016\/0743-7315(92)90061-Q_BIB9"},{"key":"10.1016\/0743-7315(92)90061-Q_BIB10","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0743-7315(87)90003-7","article-title":"Array processor with multiple broadcasting","volume":"4","author":"Prasanna Kumar","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0743-7315(92)90061-Q_BIB11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1137\/0212052","article-title":"Linear-time algorithms for linear programming in R3 and related problems","volume":"12","author":"Megiddo","year":"1983","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(92)90061-Q_BIB12","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1109\/TPAMI.1985.4767645","article-title":"Geometric algorithms for digitized pictures on a mesh-connected computer","volume":"PAMI-7","author":"Miller","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"2","key":"10.1016\/0743-7315(92)90061-Q_BIB13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TC.1981.6312172","article-title":"Data broadcasting in SIMD computers","volume":"30","author":"Nassimi","year":"1981","journal-title":"IEEE Trans. Comput. C"},{"issue":"9","key":"10.1016\/0743-7315(92)90061-Q_BIB14","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1109\/TC.1983.1676331","article-title":"Mesh-connected computers with broadcasting","volume":"32","author":"Stout","year":"1983","journal-title":"IEEE Trans. Comput. C"},{"key":"10.1016\/0743-7315(92)90061-Q_BIB15","series-title":"Proc. 27th IEEE Symposium on Foundations of Computer Science","first-page":"264","article-title":"Meshes with multiple buses","author":"Stout","year":"1986"},{"issue":"4","key":"10.1016\/0743-7315(92)90061-Q_BIB16","first-page":"263","article-title":"Sorting on a mesh-connected computer","volume":"20","author":"Thompson","year":"1977","journal-title":"Comm. Assoc. Comput. Mach."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290061Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290061Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T15:25:59Z","timestamp":1762269959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290061Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["074373159290061Q"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90061-q","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90061-Q","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}