{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:28:06Z","timestamp":1725456486722},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540602163"},{"type":"electronic","value":"9783540447337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0030868","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T03:51:40Z","timestamp":1133409100000},"page":"472-481","source":"Crossref","is-referenced-by-count":1,"title":["A fast maximum finding algorithm on broadcast communication"],"prefix":"10.1007","author":[{"given":"Shyue-Horng","family":"Shiau","sequence":"first","affiliation":[]},{"given":"Chang-Biau","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,20]]},"reference":[{"issue":"No.5","key":"55_CR1","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","volume":"25","author":"J. I. Capetanakis","year":"1979","unstructured":"J. I. Capetanakis, \u201cTree algorithms for packet broadcast channels,\u201d IEEE Transactions on Information Theory, Vol. 25, No. 5, pp. 505\u2013515, May 1979.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"No.3","key":"55_CR2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1109\/TC.1986.1676745","volume":"35","author":"R. Dechter","year":"1986","unstructured":"R. Dechter and L. Kleinrock, \u201cBroadcast communications and distributed algorithms,\u201d IEEE Transactions on Computers, Vol. 35, No. 3, pp. 210\u2013219, Mar. 1986.","journal-title":"IEEE Transactions on Computers"},{"key":"55_CR3","unstructured":"K. D. E., The Art of Computer Programming: Fundamental Algorithms, Vol. 1. Addison, Wesley Publish Company Inc., 1968."},{"key":"55_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0167-8191(90)90057-G","volume":"16","author":"J. H. Huang","year":"1990","unstructured":"J. H. Huang and L. Kleinrock, \u201cDistributed selectsort sorting algorithm on broadcast communication,\u201d Parallel Computing, Vol. 16, pp. 183\u2013190, 1990.","journal-title":"Parallel Computing"},{"key":"55_CR5","unstructured":"S. Levitan, \u201cAlgorithms for broadcast protocol multiprocessor,\u201d Proc. of 3rd International Conference on Distributed Computing Systems, pp. 666\u2013671, 1982."},{"key":"55_CR6","doi-asserted-by":"crossref","unstructured":"S. P. Levitan and C. C. Foster, \u201cFinding an extremum in a network,\u201d Proc. of 1982 International Symposium on Computer Architechure, pp. 321\u2013325, 1982.","DOI":"10.1145\/1067649.801741"},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(94)90133-3","volume":"52","author":"C. U. Martel","year":"1994","unstructured":"C. U. Martel, \u201cMaximum finding on a multi access broadcast network,\u201d Information Processing Letters, Vol. 52, pp. 7\u201313, 1994.","journal-title":"Information Processing Letters"},{"key":"55_CR8","unstructured":"W. M. Moh, C. U. Martel, and T. S. Moh, \u201cA dynamic solution to prioritized conflict resolution on a multiple access broadcast channel,\u201d Proc. of 1993 International Conference on Parallel and Distributed Systems, pp. 414\u2013418, 1993."},{"key":"55_CR9","unstructured":"C. Y. Tang and M. J. Chiu, \u201cDistributed sorting on the serially connected local area networks,\u201d Proc. of 1989 Singapore International Conference on Networks, pp. 458\u2013462, 1989."},{"key":"55_CR10","doi-asserted-by":"crossref","unstructured":"D. E. Willard, \u201cLog-logarithmic protocols for resolving ethernet and semaphore conflicts,\u201d Proc. of 16th Annual ACM Symposium on Theory of Computing, pp. 512\u2013521, 1984.","DOI":"10.1145\/800057.808721"},{"key":"55_CR11","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(91)90197-P","volume":"40","author":"C. B. Yang","year":"1991","unstructured":"C. B. Yang, \u201cReducing conflict resolution time for solving graph problems in broadcast communications,\u201d Information Processing Letters, Vol. 40, pp. 295\u2013302, 1991.","journal-title":"Information Processing Letters"},{"issue":"No.12","key":"55_CR12","doi-asserted-by":"publisher","first-page":"1468","DOI":"10.1109\/12.61071","volume":"39","author":"C. B. Yang","year":"1990","unstructured":"C. B. Yang, R. C. T. Lee, and W. T. Chen, \u201cParallel graph algorithms based upon broadcast communications,\u201d IEEE Transactions on Computers, Vol. 39, No. 12, pp. 1468\u20131472, Dec. 1990.","journal-title":"IEEE Transactions on Computers"},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"C. B. Yang, R. C. T. Lee, and W. T. Chen, \u201cConflict-free sorting algorithm broadcast under single-channel and multi-channel broadcast communication models,\u201d Proc. of 1985 International Conference on Computing and Information, pp. 350\u2013359, 1991.","DOI":"10.1007\/3-540-54029-6_183"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030868","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T01:50:40Z","timestamp":1549417840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030868"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540602163","9783540447337"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/bfb0030868","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}