{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:31:55Z","timestamp":1743006715817,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030522483"},{"type":"electronic","value":"9783030522490"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-52249-0_43","type":"book-chapter","created":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T11:03:49Z","timestamp":1593774229000},"page":"645-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Improved Deterministic Broadcasting for\u00a0Multiple Access Channels"],"prefix":"10.1007","author":[{"given":"Bader A.","family":"Aldawsari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Haadi\u00a0Jafarian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,4]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"Aldawsari, B.A., Chlebus, B.S., Kowalski, D.R.: Broadcasting on adversarial multiple access channels. In: Proceedings of the 18th IEEE International Symposium on Network Computing and Applications (NCA 2019). IEEE (2019)","DOI":"10.1109\/NCA.2019.8935052"},{"key":"43_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.tcs.2015.03.034","volume":"584","author":"L Anantharamu","year":"2015","unstructured":"Anantharamu, L., Chlebus, B.S.: Broadcasting in ad hoc multiple access channels. Theor. Comput. Sci. 584, 155\u2013176 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"43_CR3","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jcss.2018.07.001","volume":"99","author":"L Anantharamu","year":"2019","unstructured":"Anantharamu, L., Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Packet latency of deterministic broadcasting in adversarial multiple access channels. J. Comput. Syst. Sci. 99, 27\u201352 (2019)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"43_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1145\/363647.363677","volume":"48","author":"M Andrews","year":"2001","unstructured":"Andrews, M., Awerbuch, B., Fern\u00e1ndez, A., Leighton, F.T., Liu, Z., Kleinberg, J.M.: Universal-stability results and performance bounds for greedy contention-resolution protocols. J. ACM 48(1), 39\u201369 (2001)","journal-title":"J. ACM"},{"issue":"4","key":"43_CR5","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1145\/1082036.1082040","volume":"52","author":"M Andrews","year":"2005","unstructured":"Andrews, M., Fern\u00e1ndez, A., Goel, A., Zhang, L.: Source routing and scheduling in packet networks. J. ACM 52(4), 582\u2013601 (2005)","journal-title":"J. ACM"},{"key":"43_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 325\u2013332. SPAA 2005, ACM, New York (2005)","DOI":"10.1145\/1073970.1074023"},{"issue":"1","key":"43_CR7","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1145\/363647.363659","volume":"48","author":"A Borodin","year":"2001","unstructured":"Borodin, A., Kleinberg, J.M., Raghavan, P., Sudan, M., Williamson, D.P.: Adversarial queuing theory. J. ACM 48(1), 13\u201338 (2001)","journal-title":"J. ACM"},{"issue":"2","key":"43_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00446-009-0086-4","volume":"22","author":"BS Chlebus","year":"2009","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Maximum throughput of multiple access channels in adversarial environments. Distrib. Comput. 22(2), 93\u2013116 (2009)","journal-title":"Distrib. Comput."},{"issue":"1","key":"43_CR9","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/2071379.2071384","volume":"8","author":"BS Chlebus","year":"2012","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple access channel. ACM Trans. Algorithms 8(1), 5:1\u20135:31 (2012)","journal-title":"ACM Trans. Algorithms"},{"key":"43_CR10","first-page":"485","volume-title":"Discrete Univariate Distributions","author":"L Devroye","year":"1986","unstructured":"Devroye, L.: Discrete Univariate Distributions, pp. 485\u2013553. Springer, New York (1986)"},{"issue":"2","key":"43_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","volume":"31","author":"R Gallager","year":"1985","unstructured":"Gallager, R.: A perspective on multiaccess channels. IEEE Trans. Inf. Theory 31(2), 124\u2013142 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"43_CR12","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"AG Greenberg","year":"1985","unstructured":"Greenberg, A.G., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32(3), 589\u2013596 (1985)","journal-title":"J. ACM"},{"key":"43_CR13","volume-title":"An Engineering Approach to Computer Networking","author":"S Keshav","year":"2009","unstructured":"Keshav, S.: An Engineering Approach to Computer Networking. Addison-Wesley, Boston (2009)"},{"issue":"2","key":"43_CR14","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/TIT.1985.1057020","volume":"31","author":"J Komlos","year":"1985","unstructured":"Komlos, J., Greenberg, A.: An asymptotically fast nonadaptive algorithm for conflict resolution in multiple-access channels. IEEE Trans. Inf. Theory 31(2), 302\u2013306 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"43_CR15","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1145\/360248.360253","volume":"19","author":"RM Metcalfe","year":"1976","unstructured":"Metcalfe, R.M., Boggs, D.R.: Ethernet: distributed packet switching for local computer networks. Commun. ACM 19(7), 395\u2013404 (1976)","journal-title":"Commun. ACM"},{"issue":"9","key":"43_CR16","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/5.317085","volume":"82","author":"K Pahlavan","year":"1994","unstructured":"Pahlavan, K., Levesque, A.H.: Wireless data communications. Proc. IEEE 82(9), 1398\u20131430 (1994)","journal-title":"Proc. IEEE"},{"issue":"6","key":"43_CR17","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s00224-006-1248-4","volume":"39","author":"A Rosen","year":"2006","unstructured":"Rosen, A., Tsirkin, M.S.: On delivery times in packet networks under adversarial traffic. Theory Comput. Syst. 39(6), 805\u2013827 (2006)","journal-title":"Theory Comput. Syst."}],"container-title":["Advances in Intelligent Systems and Computing","Intelligent Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-52249-0_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,3]],"date-time":"2020-07-03T23:32:45Z","timestamp":1593819165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-52249-0_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030522483","9783030522490"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-52249-0_43","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"4 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Science and Information Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sai2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/saiconference.com\/Computing","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}