{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T00:17:05Z","timestamp":1758845825564,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T00:00:00Z","timestamp":1597622400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","award":["RGPIN-2015-03761"],"award-info":[{"award-number":["RGPIN-2015-03761"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,8,17]]},"DOI":"10.1145\/3409390.3409395","type":"proceedings-article","created":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T13:35:15Z","timestamp":1597671315000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Symmetric Tokens based Group Mutual Exclusion"],"prefix":"10.1145","author":[{"given":"Alex","family":"Aravind","sequence":"first","affiliation":[{"name":"University of Northern British Columbia, Canada"}]}],"member":"320","published-online":{"date-parts":[[2020,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"7","volume-title":"Proc. of the Concurrency, Specification and Programming Workshop","author":"Abraham U.","year":"1993"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.01.030"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.383967"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2010.09.004"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3309202"},{"key":"e_1_3_2_1_6_1","first-page":"45","volume-title":"Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC)","author":"Bhatt V.","year":"2010"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2076450.2076465"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1081-y"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/362759.362813"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30186-8_6"},{"key":"e_1_3_2_1_11_1","first-page":"36","volume-title":"Proceedings of the 29th annual ACM symposium on Principles of distributed computing","author":"Danek R.","year":"2010"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/365559.365617"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/59287.59292"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/383962.383997"},{"volume-title":"Proceedings of the 17th International Conference on Distributed Computing and Networking (ICDCN), ACM Digital Library","year":"2016","author":"He Y.","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.030"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1360443.1360458"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2013.03.003"},{"key":"e_1_3_2_1_19_1","first-page":"261","article-title":"Bounding Lamport\u2019s Bakery Algorithm, Proceedings of the SOFSEM","volume":"2234","author":"Jayanti P.","year":"2001","journal-title":"LNCS"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/872035.872077"},{"key":"e_1_3_2_1_21_1","first-page":"51","volume-title":"Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing (PODC)","author":"Joung Y.","year":"1998"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301319"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/361082.361093"},{"key":"e_1_3_2_1_24_1","unstructured":"[\n  24\n  ]  2013 ACM Turing Award citation http:\/\/amturing.acm.org\/ award_winners\/lamport_1205376.cfm  [24] 2013 ACM Turing Award citation http:\/\/amturing.acm.org\/ award_winners\/lamport_1205376.cfm"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2771951"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/115372.115370"},{"key":"e_1_3_2_1_27_1","first-page":"399","article-title":"Under the Hood of the Bakery Algorithm: Mutual Exclusion as a Matter of Priority","volume":"9439","author":"Moses Y.","year":"2015","journal-title":"LNCS"},{"key":"e_1_3_2_1_28_1","unstructured":"[\n  28\n  ]  NSF\/IEEE-TCPP Curriculum Initiative on Parallel and Distributed Computing - Core Topics for Undergraduates 2012.  [28] NSF\/IEEE-TCPP Curriculum Initiative on Parallel and Distributed Computing - Core Topics for Undergraduates 2012."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00157"},{"key":"e_1_3_2_1_30_1","first-page":"259","article-title":"Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model, Proc. of the COCOON","volume":"2387","author":"Takamura M.","year":"2002","journal-title":"LNCS"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45071-8_25"},{"key":"e_1_3_2_1_32_1","first-page":"56","article-title":"of the DISC","volume":"3274","author":"Taubenfeld G.","year":"2004","journal-title":"LNCS"},{"volume-title":"Proc. of Design, Analysis and Simulation of Distributed Systems","year":"2003","author":"Vijayaraghavan S.","key":"e_1_3_2_1_33_1"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/94574.94581"}],"event":{"name":"ICPP Workshops '20: Workshops","acronym":"ICPP Workshops '20","location":"Edmonton AB Canada"},"container-title":["49th International Conference on Parallel Processing - ICPP : Workshops"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409390.3409395","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409390.3409395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:38:40Z","timestamp":1750199920000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409390.3409395"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,17]]},"references-count":34,"alternative-id":["10.1145\/3409390.3409395","10.1145\/3409390"],"URL":"https:\/\/doi.org\/10.1145\/3409390.3409395","relation":{},"subject":[],"published":{"date-parts":[[2020,8,17]]},"assertion":[{"value":"2020-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}