{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T18:40:49Z","timestamp":1773081649299,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553894","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T22:07:35Z","timestamp":1114034855000},"page":"313-328","source":"Crossref","is-referenced-by-count":33,"title":["A full sensing window Random-Access algorithm for messages with strict delay constraints"],"prefix":"10.1007","volume":"4","author":[{"given":"M.","family":"Paterakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L.","family":"Georgiadis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Papantoni-Kazakos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"No. 1","key":"BF01553894_CR1","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/861.870","volume":"16","author":"J. Kurose","year":"1984","unstructured":"J. Kurose, M. Schwartz, and Y. Yemini, Multiple-Access Protocols and Time Constrained Communication,ACM Computing Surveys, Vol. 16, No. 1, March 1984, pp. 43\u201370.","journal-title":"ACM Computing Surveys"},{"key":"BF01553894_CR2","doi-asserted-by":"crossref","unstructured":"T. Gonsalves, Packet-Voice Communication on an Ethernet Local Computer Network: An Experimental Study,Proceedings of the SIGCOM Communications Architectures and Protocols Symposium, Austin, TX, March 8\u20139, 1983, pp. 178\u2013185.","DOI":"10.1145\/1035237.1035273"},{"key":"BF01553894_CR3","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/TCOM.1982.1095390","volume":"30","author":"G. Nutt","year":"1982","unstructured":"G. Nutt and D. Bayer, Performance of CSMA\/CD Networks Under Combined Voice and Data Loads,IEEE Transactions on Communications, Vol. 30, January 1982, pp. 6\u201311.","journal-title":"IEEE Transactions on Communications"},{"key":"BF01553894_CR4","doi-asserted-by":"crossref","unstructured":"J. Kurose, M. Schwartz, and Y. Yemini, Controlling Time Window Protocols for Time Constrained Communication in a Multiple Access Environment,Proceedings of the 8th International Data Communications Symposium, North Falmouth, MA, October 1983, pp. 75\u201384.","DOI":"10.1145\/800034.800904"},{"issue":"No. 6","key":"BF01553894_CR5","doi-asserted-by":"crossref","first-page":"1051","DOI":"10.1109\/JSAC.1987.1146613","volume":"5","author":"L. Georgiadis","year":"1987","unstructured":"L. Georgiadis, L. Merakos, and P. Papantoni-Kazakos, A Unified Method for Delay Analysis of Random Multiple Access Algorithms,IEEE Journal on Selected Areas in Communications, Vol. 5, No. 6, July 1987, pp. 1051\u20131062.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"No. 11","key":"BF01553894_CR6","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1109\/TCOM.1987.1096696","volume":"35","author":"M. Paterakis","year":"1987","unstructured":"M. Paterakis, L. Georgiadis, and P. Papantoni-Kazakos, On the Relation Between the Finite and the Infinite Population Models for a Class of RAA's,IEEE Transactions on Communications, Vol. 35, No. 11, November 1987, pp. 1239\u20131240.","journal-title":"IEEE Transactions on Communications"},{"key":"BF01553894_CR7","volume-title":"Non-Negative Matrices","author":"E. Seneta","year":"1973","unstructured":"E. Seneta,Non-Negative Matrices, Wiley, New York, 1973."},{"key":"BF01553894_CR8","series-title":"CISM Courses and Lectures Series","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-7091-2900-5_4","volume-title":"Multi-user Communications","author":"J. L. Massey","year":"1981","unstructured":"J. L. Massey, Collision Resolution Algorithms and Random Access Communications, inMulti-user Communications (G. Longo, ed.), CISM Courses and Lectures Series, Springer-Verlag, New York, 1981, pp. 73\u2013137."},{"issue":"No. 4","key":"BF01553894_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1109\/TCOM.1986.1096539","volume":"34","author":"P. A. Humblet","year":"1986","unstructured":"P. A. Humblet, On the Throughput of Channel Access Algorithms with Limited Sensing,IEEE Transactions on Communications, Vol. 34, No. 4, April 1986, pp. 345\u2013347.","journal-title":"IEEE Transactions on Communications"},{"issue":"No. 2","key":"BF01553894_CR10","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1109\/TIT.1987.1057278","volume":"33","author":"L. Georgiadis","year":"1987","unstructured":"L. Georgiadis and P. Papantoni-Kazakos, A 0.487 Throughput Limited Sensing Algorithm,IEEE Transactions on Information Theory, Vol. 33, No. 2, March 1987, pp. 233\u2013237.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553894.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553894\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553894","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T14:21:13Z","timestamp":1556893273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553894"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":10,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553894"],"URL":"https:\/\/doi.org\/10.1007\/bf01553894","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}