{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:41:38Z","timestamp":1774021298798,"version":"3.50.1"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1985,3,1]],"date-time":"1985-03-01T00:00:00Z","timestamp":478483200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1985,3]]},"DOI":"10.1109\/tit.1985.1057013","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"217-243","source":"Crossref","is-referenced-by-count":153,"title":["Q-ary collision resolution algorithms in random-access systems with free or blocked channel access"],"prefix":"10.1109","volume":"31","author":[{"given":"P.","family":"Mathys","sequence":"first","affiliation":[]},{"given":"P.","family":"Flajolet","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref32b","first-page":"80","volume":"16","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref30b","first-page":"32","volume":"14","year":"1978","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref30a","first-page":"259","author":"tsybakov","year":"0","journal-title":"Free synchronous packet access in a broadcast channel with feedback"},{"key":"ref3b","year":"1977","journal-title":"IEEE Int Symp Inform Theory"},{"key":"ref3a","author":"capetanakis","year":"1977","journal-title":"The multiple access broadcast channel Protocol and capacity considerations"},{"key":"ref34b","first-page":"77","volume":"20","year":"1984","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref29a","first-page":"35","author":"tsybakov","year":"0","journal-title":"Multiple access with reservation"},{"key":"ref34a","first-page":"137","year":"0","journal-title":"Packet delay in the case of multiple access stack algorithm"},{"key":"ref32a","first-page":"230","author":"tsybakov","year":"0","journal-title":"Random Multiple-Access Stack Algorithm"},{"key":"ref29b","first-page":"50","volume":"16","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref31a","first-page":"305","year":"0","journal-title":"Random multiple packet access Part-and-try algorithm"},{"key":"ref31b","first-page":"65","volume":"16","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref10a","author":"fayolle","year":"1982","journal-title":"On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057014"},{"key":"ref12a","author":"fayolle","year":"1983","journal-title":"On the capacity of a collision channel under stack-based collision resolution algorithms"},{"key":"ref13","volume":"1","author":"feller","year":"1968","journal-title":"An Introduction to Probability Theory and Its Applications"},{"key":"ref14","year":"0"},{"key":"ref12b","year":"0","journal-title":"J Ass Comput Mach"},{"key":"ref15","article-title":"A recursive partitioning process of computer science","author":"flajolet","year":"1982","journal-title":"Proc 2nd World Conf on Math at the Service of Man"},{"key":"ref16","first-page":"74","article-title":"Conflict resolution in random access broadcast networks","author":"gallager","year":"1978","journal-title":"Proc AFOSR Workshop Comm Theory and Applications"},{"key":"ref17","author":"greene","year":"1982","journal-title":"Mathematical Analysis of Algorithms"},{"key":"ref18","author":"hajek","year":"1980","journal-title":"Expected number of slots needed for the Capetanakis collision-resolution algorithm"},{"key":"ref19","volume":"1","author":"henrici","year":"1974","journal-title":"Applied and Computational Complex Analysis"},{"key":"ref28","year":"0"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"ref27","author":"mathys","year":"1984","journal-title":"Analysis of random-access algorithms"},{"key":"ref33a","first-page":"131","author":"vvedenskaya","year":"0","journal-title":"Random Multiple Access of Packets to a Channel with Errors"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5512-1","volume":"25","author":"davies","year":"1978","journal-title":"Integral Transforms and their Applications Applied Mathematical Sciences"},{"key":"ref33b","first-page":"52","volume":"19","year":"1983","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094298"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-4147-4","volume":"ii","author":"doetsch","year":"1955","journal-title":"Handbuch der Laplace Transformation"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-0348-6984-3"},{"key":"ref2","author":"amati","year":"1981","journal-title":"Recursive analysis of certain random access algorithms"},{"key":"ref9","article-title":"On the behavior of certain random-access protocols with free access","author":"faltings","year":"1983","journal-title":"IEEE Trans Inform Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1478462.1478502"},{"key":"ref20","author":"hofri","year":"1982","journal-title":"Stack algorithms for collision-detecting channels and their analysis A limited survey"},{"key":"ref22","author":"kleinrock","year":"1976","journal-title":"Queueing Systems Volume II Computer Applications"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1980.271872"},{"key":"ref24","author":"kuczma","year":"1968","journal-title":"Functional Equations in a Single Variable"},{"key":"ref10b","year":"1985","journal-title":"Adv Appl Prob"},{"key":"ref23","author":"knuth","year":"1973","journal-title":"The Art of Computer Programming Vol 3 Sorting and Searching"},{"key":"ref26","article-title":"A comparison of Q-ary tree algorithms for collision resolution","author":"mathys","year":"1982","journal-title":"IEEE Int Symp Inform Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2900-5_4"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22747\/01057013.pdf?arnumber=1057013","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:43Z","timestamp":1753121263000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1057013\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1985.1057013","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}