{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T16:30:21Z","timestamp":1754152221766,"version":"3.41.2"},"reference-count":10,"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.1057015","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"255-263","source":"Crossref","is-referenced-by-count":22,"title":["Analytic properties of multiple-access trees"],"prefix":"10.1109","volume":"31","author":[{"given":"M.","family":"Kaplan","sequence":"first","affiliation":[]},{"given":"E.","family":"Gulko","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"journal-title":"Collision-based multiple access when the multiplicities of the conflicts are known","year":"1982","author":"gulko","key":"ref4"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094298"},{"key":"ref10","first-page":"35","article-title":"Multiple access with reservation","volume":"16","author":"tsybakov","year":"1980","journal-title":"Probl Inform Trans"},{"journal-title":"The Art of Computer Programming Vol 3 Sorting and Searching","year":"1973","author":"knuth","key":"ref6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"ref8","article-title":"A comparison of Q-ary tree algorithms for collision resolution","author":"mathys","year":"1982","journal-title":"Abstracts of Papers Int Symp Information Theory"},{"journal-title":"Collision-Resolution Algorithms and Random-Access Communications","year":"1980","author":"massey","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"ref9","first-page":"259","article-title":"Free synchronous packet access in a broadcast channel with feedback","volume":"14","author":"tsybakov","year":"1978","journal-title":"Probl Inform Trans"},{"key":"ref1","article-title":"A contention resolution algorithm using multi-bit feedback","author":"berger","year":"1983","journal-title":"Abstracts of Papers Int Symp Information Theory"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22747\/01057015.pdf?arnumber=1057015","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:45Z","timestamp":1753121265000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1057015\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":10,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1985.1057015","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}