{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T15:41:28Z","timestamp":1774798888464,"version":"3.50.1"},"reference-count":11,"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.1057014","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"244-254","source":"Crossref","is-referenced-by-count":88,"title":["Analysis of a stack algorithm for random multiple-access communication"],"prefix":"10.1109","volume":"31","author":[{"given":"G.","family":"Fayolle","sequence":"first","affiliation":[]},{"given":"P.","family":"Flajolet","sequence":"additional","affiliation":[]},{"given":"M.","family":"Hofri","sequence":"additional","affiliation":[]},{"given":"P.","family":"Jacquet","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","author":"fayolle","year":"1983","journal-title":"On the capacity of a collision resolution channel under stack-based collision resolution algorithms"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/322017.322019"},{"key":"ref10","first-page":"259","article-title":"Free synchronous packet access in a broadcast channel with feedback","volume":"14","author":"tsybakov","year":"1978","journal-title":"Prob Inform Trans"},{"key":"ref6","author":"jacquet","year":"1983","journal-title":"Proprietes moyennes du protocole Capetanakis"},{"key":"ref11","first-page":"230","article-title":"Random multiple access stack algorithms","volume":"16","author":"tsybakov","year":"1980","journal-title":"Prob Inform Trans"},{"key":"ref5","author":"greenberg","year":"1984","journal-title":"Estimating the multiplicities of conflicts in multiple access channels"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7091-2900-5_4"},{"key":"ref7","volume":"265","year":"1981","journal-title":"Multi-User Communication Systems"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.2307\/1427308"},{"key":"ref9","article-title":"Q-ary collision resolution algorithms in random-access systems with free or blocked channel-access","author":"mathys","year":"0","journal-title":"IEEE Trans Inform Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22747\/01057014.pdf?arnumber=1057014","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,21]],"date-time":"2025-07-21T18:07:46Z","timestamp":1753121266000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1057014\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,3]]},"references-count":11,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1985.1057014","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,3]]}}}