{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T20:19:02Z","timestamp":1649017142376},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":[[1996,10]]},"DOI":"10.1016\/s0020-0190(96)00143-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:21:21Z","timestamp":1027621281000},"page":"81-89","source":"Crossref","is-referenced-by-count":4,"title":["A fast maximum finding algorithm on broadcast communication"],"prefix":"10.1016","volume":"60","author":[{"given":"Shiau","family":"Shyue-Horng","sequence":"first","affiliation":[]},{"given":"Chang-Biau","family":"Yang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/S0020-0190(96)00143-3_BIB1","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","article-title":"Tree algorithms for packet broadcast channels","volume":"25","author":"Capetanakis","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"10.1016\/S0020-0190(96)00143-3_BIB2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TC.1986.1676745","article-title":"Broadcast communications and distributed algorithms","volume":"35","author":"Dechter","year":"1986","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(96)00143-3_BIB3","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/S0020-0190(96)00143-3_BIB4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-8191(90)90057-G","article-title":"Distributed selectsort sorting algorithm on broadcast communication","volume":"16","author":"Huang","year":"1990","journal-title":"Parallel Comput."},{"key":"10.1016\/S0020-0190(96)00143-3_BIB5","series-title":"Proc. 3rd Internat. Conf. on Distributed Computing Systems","first-page":"666","article-title":"Algorithms for broadcast protocol multiprocessor","author":"Levitan","year":"1982"},{"key":"10.1016\/S0020-0190(96)00143-3_BIB6","series-title":"Proc. 1982 Internat. Symp. on Computer Architecture","first-page":"321","article-title":"Finding an extremum in a network","author":"Levitan","year":"1982"},{"key":"10.1016\/S0020-0190(96)00143-3_BIB7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0020-0190(94)90133-3","article-title":"Maximum finding on a multi access broadcast network","volume":"52","author":"Martel","year":"1994","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(96)00143-3_BIB8","series-title":"Proc. 1993 Internat. Conf. on Parallel and Distributed Systems","first-page":"414","article-title":"A dynamic solution to prioritized conflict resolution on a multiple access broadcast channel","author":"Moh","year":"1993"},{"key":"10.1016\/S0020-0190(96)00143-3_BIB9","series-title":"Proc. 1989 Singapore Internat. Conf. on Networks","first-page":"458","article-title":"Distributed sorting on the serially connected local area networks","author":"Tang","year":"1989"},{"key":"10.1016\/S0020-0190(96)00143-3_BIB10","series-title":"Proc. 16th Ann. ACM Symp. on Theory of Computing","first-page":"512","article-title":"Log-logarithmic protocols for resolving ethernet and semaphore conflicts","author":"Willard","year":"1984"},{"key":"10.1016\/S0020-0190(96)00143-3_BIB11","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(91)90197-P","article-title":"Reducing conflict resolution time for solving graph problems in broadcast communications","volume":"40","author":"Yang","year":"1991","journal-title":"Inform. Process. Lett."},{"issue":"12","key":"10.1016\/S0020-0190(96)00143-3_BIB12","doi-asserted-by":"crossref","first-page":"1468","DOI":"10.1109\/12.61071","article-title":"Parallel graph algorithms based upon broadcast communications","volume":"39","author":"Yang","year":"1990","journal-title":"IEEE Trans. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001433?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001433?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:42Z","timestamp":1556058282000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019096001433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["S0020019096001433"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(96)00143-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}