{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:52:50Z","timestamp":1730328770340,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662794","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"106-116","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model"],"prefix":"10.1145","author":[{"ORCID":"http:\/\/orcid.org\/0000-0002-0109-2432","authenticated-orcid":false,"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0540-0292","authenticated-orcid":false,"given":"Gopinath","family":"Mishra","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"http:\/\/orcid.org\/0009-0006-7993-2952","authenticated-orcid":false,"given":"Hung Thuan","family":"Nguyen","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"http:\/\/orcid.org\/0009-0006-8971-2064","authenticated-orcid":false,"given":"Mingyang","family":"Yang","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]},{"ORCID":"http:\/\/orcid.org\/0009-0006-0686-8750","authenticated-orcid":false,"given":"Yu-Cheng","family":"Yeh","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-024-00460-w"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212741"},{"key":"e_1_3_2_1_3_1","volume-title":"Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, V\u00e1clav Rozho\u0148, and Jukka Suomela.","author":"Akbari Amirreza","year":"2024","unstructured":"Amirreza Akbari, Xavier Coiteux-Roy, Francesco d'Amore, Fran\u00e7ois Le Gall, Henrik Lievonen, Darya Melnyk, Augusto Modanese, Shreyas Pai, Marc-Olivier Renou, V\u00e1clav Rozho\u0148, and Jukka Suomela. 2024. Online Locality Meets Distributed Quantum Computing. arXiv preprint arXiv:2403.01903 (2024)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ICALP.2023.10"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188922"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3338529"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/3174304.3175267"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087801.3087833"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.2312.01384"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1117537"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1157957"},{"key":"e_1_3_2_1_12_1","volume-title":"Proceedings of the 56th Annual ACM SIGACT Symposium on Theory of Computing (STOC).","author":"Coiteux-Roy Xavier","year":"2024","unstructured":"Xavier Coiteux-Roy, Francesco d'Amore, Rishikesh Gajjala, Fabian Kuhn, Fran\u00e7ois Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, and Jukka Suomela. 2024. No distributed quantum advantage for approximate graph coloring. In Proceedings of the 56th Annual ACM SIGACT Symposium on Theory of Computing (STOC)."},{"volume-title":"Independent Set with Advice: The Impact of Graph Knowledge","author":"Dobrev Stefan","key":"e_1_3_2_1_13_1","unstructured":"Stefan Dobrev, Rastislav Kr\u00e1lovi\u010d, and Richard Kr\u00e1lovi\u010d. 2013. Independent Set with Advice: The Impact of Graph Knowledge. In Approximation and Online Algorithms, Thomas Erlebach and Giuseppe Persiano (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 2--15."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055471"},{"key":"e_1_3_2_1_15_1","volume-title":"Simple dynamic algorithms for maximal independent set and other problems. arXiv preprint arXiv:1804.01823","author":"Gupta Manoj","year":"2018","unstructured":"Manoj Gupta and Shahbaz Khan. 2018. Simple dynamic algorithms for maximal independent set and other problems. arXiv preprint arXiv:1804.01823 (2018)."},{"key":"e_1_3_2_1_16_1","volume-title":"International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Springer, 99--111","author":"Ivkovi\u0107 Zoran","year":"1993","unstructured":"Zoran Ivkovi\u0107 and Errol L Lloyd. 1993. Fully dynamic maintenance of vertex cover. In International Workshop on Graph-Theoretic Concepts in Computer Science (WG). Springer, 99--111."},{"key":"e_1_3_2_1_17_1","series-title":"SIAM Journal on computing 21, 1","volume-title":"Locality in distributed graph algorithms","author":"Linial Nathan","year":"1992","unstructured":"Nathan Linial. 1992. Locality in distributed graph algorithms. SIAM Journal on computing 21, 1 (1992), 193--201."},{"key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Simple deterministic algorithms for fully dynamic maximal matching","volume":"12","author":"Neiman Ofer","year":"2015","unstructured":"Ofer Neiman and Shay Solomon. 2015. Simple deterministic algorithms for fully dynamic maximal matching. ACM Transactions on Algorithms (TALG) 12, 1 (2015), 1--15.","journal-title":"ACM Transactions on Algorithms (TALG)"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"David Peleg. 2000. Distributed computing: a locality-sensitive approach. SIAM.","DOI":"10.1137\/1.9780898719772"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Nantes France","acronym":"PODC '24"},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"deposited":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T15:18:57Z","timestamp":1717600737000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662794"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":20,"alternative-id":["10.1145\/3662158.3662794","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662794","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}