{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:10:08Z","timestamp":1758845408033},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00114-1","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T20:25:18Z","timestamp":1034022318000},"page":"51-67","source":"Crossref","is-referenced-by-count":7,"title":["Sorting algorithms for broadcast communications: mathematical analysis"],"prefix":"10.1016","volume":"289","author":[{"given":"Peter J.","family":"Grabner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00114-1_BIB1","series-title":"Handbook of Mathematical Functions","author":"Abramowitz","year":"1965"},{"key":"10.1016\/S0304-3975(01)00114-1_BIB2","series-title":"Special Functions.","volume":"Number 71","author":"Andrews","year":"1999"},{"key":"10.1016\/S0304-3975(01)00114-1_BIB3","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1214\/aoap\/1035463332","article-title":"On the distribution for the duration of a randomized leader election algorithm","volume":"6","author":"Fill","year":"1996","journal-title":"Ann. Appl. Probab."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(01)00114-1_BIB4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0304-3975(94)00281-M","article-title":"Mellin transforms and asymptotics: finite differences and Rice's integrals","volume":"144","author":"Flajolet","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00114-1_BIB5","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/S0020-0190(97)00225-1","article-title":"An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication","volume":"65","author":"Grabner","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00114-1_BIB6","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/rsa.3240040107","article-title":"Searching for losers","volume":"4","author":"Grabner","year":"1993","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0304-3975(01)00114-1_BIB7","series-title":"The Riemann Zeta-Function","author":"Ivi\u0107","year":"1985"},{"issue":"# R17","key":"10.1016\/S0304-3975(01)00114-1_BIB8","doi-asserted-by":"crossref","first-page":"17pp","DOI":"10.37236\/1302","article-title":"Analysis of an asymmetric leader election algorithm","volume":"4","author":"Janson","year":"1997","journal-title":"Electron. J. Combin."},{"issue":"2","key":"10.1016\/S0304-3975(01)00114-1_BIB9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/TIT.1985.1057013","article-title":"Q-ary collision resolution algorithms in random access systems with free or blocked channel access","volume":"IT-31","author":"Mathys","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(01)00114-1_BIB10","series-title":"Handbuch der Theorie der Gammafunktion","author":"Nielsen","year":"1906"},{"key":"10.1016\/S0304-3975(01)00114-1_BIB11","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/0012-365X(93)90572-B","article-title":"How to select a loser","volume":"120","author":"Prodinger","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(01)00114-1_BIB12","series-title":"Introduction to the Analysis of Algorithms","author":"Sedgewick","year":"1996"},{"key":"10.1016\/S0304-3975(01)00114-1_BIB13","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(96)00143-3","article-title":"A fast maximum finding algorithm on broadcast communications","volume":"60","author":"Shiau","year":"1996","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00114-1_BIB14","doi-asserted-by":"crossref","unstructured":"S.-H. Shiau, C.-B. Yang, A fast sorting algorithm and its generalization on broadcast communications, In Proc. of Sixth Annual International Computing and Combinatorics Conference, COCOON2000. pp. 252\u2013261, Sydney, Australia, July 26\u201328, 2000.","DOI":"10.1007\/3-540-44968-X_25"},{"key":"10.1016\/S0304-3975(01)00114-1_BIB15","unstructured":"S.-H. Shiau, C.-B. Yang, Sorting algorithms on broadcast communications: algorithm and fundamental analysis, 2000, In Technical Report Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan, R.O.C., 2000."},{"key":"10.1016\/S0304-3975(01)00114-1_BIB16","series-title":"The Theory of Functions","author":"Titchmarsh","year":"1939"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001141?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001141?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T15:39:25Z","timestamp":1622216365000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001141"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501001141"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00114-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}