{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T06:10:07Z","timestamp":1747203007285,"version":"3.40.5"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T00:00:00Z","timestamp":1741219200000},"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":[],"published-print":{"date-parts":[[2025,3,6]]},"DOI":"10.1109\/ncc63735.2025.10983549","type":"proceedings-article","created":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:43:35Z","timestamp":1747158215000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Non-FCFS Algorithms for Multiple Access"],"prefix":"10.1109","author":[{"given":"Soumyadeep","family":"Datta","sequence":"first","affiliation":[{"name":"NYU Tandon School of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shivendra S.","family":"Panwar","sequence":"additional","affiliation":[{"name":"NYU Tandon School of Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Budhiraja","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology,Kanpur"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"volume-title":"Computer Networking: A Top-down Approach","year":"2022","author":"Kurose","key":"ref1"},{"volume-title":"An efficient contention resolution algorithm for multiple access channels","year":"1979","author":"Moseley","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096261"},{"key":"ref4","article-title":"Nonoptimality of the part-and-try algorithm","volume-title":"Proc. of the Int. Workshop on Convolutional Codes and Multiuser Commun.","author":"Vvedenskaya","year":"1983"},{"volume-title":"Data Networks","year":"1992","author":"Bertsekas","key":"ref5"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1478462.1478502"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1024916.1024920"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.21236\/ADA055275"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2019.2935970"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2022.3193968"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23760-7_5"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1998.708696"},{"key":"ref13","first-page":"64","article-title":"Upper bound on the capacity of a random multiple-access system","volume":"23","author":"Tsybakov","year":"1987","journal-title":"Probl. Peredachi lnf."},{"volume-title":"GitHub repository accessed","year":"2025","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.17487\/rfc8985"}],"event":{"name":"2025 National Conference on Communications (NCC)","start":{"date-parts":[[2025,3,6]]},"location":"New Delhi, India","end":{"date-parts":[[2025,3,9]]}},"container-title":["2025 National Conference on Communications (NCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/10982528\/10982694\/10983549.pdf?arnumber=10983549","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T05:42:26Z","timestamp":1747201346000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10983549\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,6]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/ncc63735.2025.10983549","relation":{},"subject":[],"published":{"date-parts":[[2025,3,6]]}}}