{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,25]],"date-time":"2025-10-25T14:06:19Z","timestamp":1761401179806},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[1987,11]]},"DOI":"10.1109\/tcom.1987.1096710","type":"journal-article","created":{"date-parts":[[2004,4,28]],"date-time":"2004-04-28T20:29:18Z","timestamp":1083184158000},"page":"1124-1138","source":"Crossref","is-referenced-by-count":16,"title":["Performance Analysis of Finite Nonhomogeneous Population Tree Conflict Resolution Algorithms Using Constant Size Window Access"],"prefix":"10.1109","volume":"35","author":[{"given":"G.","family":"Polyzos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Molle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Venetsanopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1035237.1035279"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057014"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057013"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1985.1057016"},{"key":"ref14","first-page":"126","article-title":"A unified method for delay analysis of random multiple-access algorithms","author":"merakos","year":"1985","journal-title":"Proc IEEE Globecom '85"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1977.1093713"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.1984.1091845"},{"key":"ref17","author":"knuth","year":"1968","journal-title":"The Art of Computer Programming I"},{"key":"ref18","article-title":"A generalized busy period approach to the delay analysis of window access tree conflict resolution algorithms","author":"polyzos","year":"1987","journal-title":"Proc IEEE ICC'87"},{"key":"ref19","author":"polyzos","year":"1984","journal-title":"Tree conflict resolution algorithms The nonhomogeneous case"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056093"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1979.1094298"},{"key":"ref6","author":"massey","year":"1981","journal-title":"Multi-user Communication"},{"key":"ref5","first-page":"32","article-title":"Slotted multiaccess packet broadcasting feedback channel","volume":"14","author":"tsybakov","year":"1978","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref8","first-page":"74","article-title":"Conflict resolution in random access broadcast networks","author":"gallager","year":"1978","journal-title":"Proc AFOSR Workshop Commun Theory AppL"},{"key":"ref7","first-page":"65","article-title":"Random multiple packet access: Part-and-try algorithm","volume":"16","author":"tsybakov","year":"1980","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1978.1094204"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096261"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.3160130105"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096402"},{"key":"ref22","doi-asserted-by":"crossref","DOI":"10.21236\/ADA055275","author":"capetanakis","year":"1978","journal-title":"The multiple access broadcast channel Protocol and capacity considerations"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056509"},{"key":"ref24","article-title":"Average-case optimized decoders","author":"berlekamp","year":"1983","journal-title":"1983 NATO Advanced Study Inst Impact Processing Techniques Commun"},{"key":"ref23","author":"molle","year":"1987","journal-title":"Current Advances in Distributed Computing and Communications"},{"key":"ref26","author":"kleinrock","year":"1975","journal-title":"Queueing Systems vol I Theory"},{"key":"ref25","first-page":"50","article-title":"Multiple access with reservation","volume":"16","author":"tsybackov","year":"1980","journal-title":"Problemy Peredachi Informatsii"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/26\/24014\/01096710.pdf?arnumber=1096710","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T15:42:11Z","timestamp":1638200531000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1096710\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":26,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1987,11]]}},"URL":"https:\/\/doi.org\/10.1109\/tcom.1987.1096710","relation":{},"ISSN":["0096-2244"],"issn-type":[{"value":"0096-2244","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}