{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:53:05Z","timestamp":1787500385110,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":59,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519978","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T11:29:32Z","timestamp":1654860572000},"page":"1220-1233","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Randomized communication and implicit graph representations"],"prefix":"10.1145","author":[{"given":"Nathaniel","family":"Harms","sequence":"first","affiliation":[{"name":"University of Waterloo, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastian","family":"Wild","sequence":"additional","affiliation":[{"name":"University of Liverpool, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Viktor","family":"Zamaraev","sequence":"additional","affiliation":[{"name":"University of Liverpool, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"#cr-split#-e_1_3_2_1_1_1.1","unstructured":"Jungho Ahn Kevin Hendrey Donggyu Kim and Sang-il Oum. 2021. Bounds for the Twin-width of Graphs. arXiv preprint arXiv:2110.03957 https:\/\/doi.org\/10.48550\/arXiv.2110.03957 10.48550\/arXiv.2110.03957"},{"key":"#cr-split#-e_1_3_2_1_1_1.2","unstructured":"Jungho Ahn Kevin Hendrey Donggyu Kim and Sang-il Oum. 2021. Bounds for the Twin-width of Graphs. arXiv preprint arXiv:2110.03957 https:\/\/doi.org\/10.48550\/arXiv.2110.03957"},{"key":"e_1_3_2_1_2_1","first-page":"148","article-title":"Range of values of entropy of hereditary classes of graphs","volume":"4","author":"Alekseev Vladimir Evgen\u2019evich","year":"1992","unstructured":"Vladimir Evgen\u2019evich Alekseev . 1992 . Range of values of entropy of hereditary classes of graphs . Diskretnaya Matematika , 4 , 2 (1992), 148 \u2013 157 . Vladimir Evgen\u2019evich Alekseev. 1992. Range of values of entropy of hereditary classes of graphs. Diskretnaya Matematika, 4, 2 (1992), 148\u2013157.","journal-title":"Diskretnaya Matematika"},{"key":"e_1_3_2_1_3_1","volume-title":"On lower layers of a lattice of hereditary classes of graphs. Diskretnyi Analiz i Issledovanie Operatsii, 4, 1","author":"Alekseev Vladimir Evgen\u2019evich","year":"1997","unstructured":"Vladimir Evgen\u2019evich Alekseev . 1997. On lower layers of a lattice of hereditary classes of graphs. Diskretnyi Analiz i Issledovanie Operatsii, 4, 1 ( 1997 ), 3\u201312. Vladimir Evgen\u2019evich Alekseev. 1997. On lower layers of a lattice of hereditary classes of graphs. Diskretnyi Analiz i Issledovanie Operatsii, 4, 1 (1997), 3\u201312."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.20355"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480103433409"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1024214"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2014.09.008"},{"key":"#cr-split#-e_1_3_2_1_8_1.1","unstructured":"Jakub Balab\u00e1n and Petr Hlin\u011bn\u1ef3. 2021. Twin-Width is Linear in the Poset Width. arXiv preprint arXiv:2106.15337 https:\/\/doi.org\/10.48550\/arXiv.2106.15337 10.48550\/arXiv.2106.15337"},{"key":"#cr-split#-e_1_3_2_1_8_1.2","unstructured":"Jakub Balab\u00e1n and Petr Hlin\u011bn\u1ef3. 2021. Twin-Width is Linear in the Poset Width. arXiv preprint arXiv:2106.15337 https:\/\/doi.org\/10.48550\/arXiv.2106.15337"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1952"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2005.02.004"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.APPROX-RANDOM.2014.465"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.ITC.2021.16"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1112\/blms\/27.5.417"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.118"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3486655"},{"key":"#cr-split#-e_1_3_2_1_16_1.1","unstructured":"Maurice Chandoo. 2018. A Complexity Theory For Labeling Schemes. arXiv preprint arXiv:1802.02819 https:\/\/doi.org\/10.48550\/arXiv.1802.02819 10.48550\/arXiv.1802.02819"},{"key":"#cr-split#-e_1_3_2_1_16_1.2","unstructured":"Maurice Chandoo. 2018. A Complexity Theory For Labeling Schemes. arXiv preprint arXiv:1802.02819 https:\/\/doi.org\/10.48550\/arXiv.1802.02819"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.CCC.2019.14"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.22469"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1090\/proc\/13626"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90004-G"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3477542"},{"key":"e_1_3_2_1_22_1","volume-title":"A combinatorial problem in geometry. Compositio mathematica, 2","author":"Erd\u0151s Paul","year":"1935","unstructured":"Paul Erd\u0151s and George Szekeres . 1935. A combinatorial problem in geometry. Compositio mathematica, 2 ( 1935 ), 463\u2013470. Paul Erd\u0151s and George Szekeres. 1935. A combinatorial problem in geometry. Compositio mathematica, 2 (1935), 463\u2013470."},{"key":"e_1_3_2_1_23_1","unstructured":"Louis Esperet Nathaniel Harms and Andrey Kupavskii. 2022. Sketching Distances in Monotone Graph Classes. arxiv:2202.09253  Louis Esperet Nathaniel Harms and Andrey Kupavskii. 2022. Sketching Distances in Monotone Graph Classes. arxiv:2202.09253"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584031"},{"key":"#cr-split#-e_1_3_2_1_25_1.1","unstructured":"Jakub Gajarsk\u1ef3 Micha\u0142 Pilipczuk and Szymon Toru\u0144czyk. 2021. Stable graphs of bounded twin-width. arXiv preprint arXiv:2107.03711 https:\/\/doi.org\/10.48550\/arXiv.2107.03711 10.48550\/arXiv.2107.03711"},{"key":"#cr-split#-e_1_3_2_1_25_1.2","doi-asserted-by":"crossref","unstructured":"Jakub Gajarsk\u1ef3 Micha\u0142 Pilipczuk and Szymon Toru\u0144czyk. 2021. Stable graphs of bounded twin-width. arXiv preprint arXiv:2107.03711 https:\/\/doi.org\/10.48550\/arXiv.2107.03711","DOI":"10.1145\/3531130.3533356"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-018-0166-6"},{"key":"#cr-split#-e_1_3_2_1_27_1.1","unstructured":"Lianna Hambardzumyan Hamed Hatami and Pooya Hatami. 2021. A Counterexample to the Probabilistic Universal Graph Conjecture via Randomized Communication. arXiv preprint arXiv:2111.10436 https:\/\/doi.org\/10.48550\/arXiv.2111.10436 10.48550\/arXiv.2111.10436"},{"key":"#cr-split#-e_1_3_2_1_27_1.2","doi-asserted-by":"crossref","unstructured":"Lianna Hambardzumyan Hamed Hatami and Pooya Hatami. 2021. A Counterexample to the Probabilistic Universal Graph Conjecture via Randomized Communication. arXiv preprint arXiv:2111.10436 https:\/\/doi.org\/10.48550\/arXiv.2111.10436","DOI":"10.1016\/j.dam.2022.07.023"},{"key":"e_1_3_2_1_28_1","unstructured":"Lianna Hambardzumyan Hamed Hatami and Pooya Hatami. 2021. Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. 66. https:\/\/eccc.weizmann.ac.il\/report\/2021\/066  Lianna Hambardzumyan Hamed Hatami and Pooya Hatami. 2021. Dimension-free Bounds and Structural Results in Communication Complexity. Electron. Colloquium Comput. Complex. 66. https:\/\/eccc.weizmann.ac.il\/report\/2021\/066"},{"key":"e_1_3_2_1_29_1","volume-title":"Handbook of product graphs","author":"Hammack Richard","unstructured":"Richard Hammack , Wilfried Imrich , and Sandi Klav\u017ear . 2011. Handbook of product graphs . CRC press . Richard Hammack, Wilfried Imrich, and Sandi Klav\u017ear. 2011. Handbook of product graphs. CRC press."},{"key":"e_1_3_2_1_30_1","volume-title":"11th Innovations in Theoretical Computer Science Conference (ITCS 2020","author":"Harms Nathaniel","year":"2020","unstructured":"Nathaniel Harms . 2020 . Universal Communication, Universal Graphs, and Graph Labeling . In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020 ). https:\/\/doi.org\/10.48550\/arXiv.1911.03757 10.48550\/arXiv.1911.03757 Nathaniel Harms. 2020. Universal Communication, Universal Graphs, and Graph Labeling. In 11th Innovations in Theoretical Computer Science Conference (ITCS 2020). https:\/\/doi.org\/10.48550\/arXiv.1911.03757"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Nathaniel Harms Sebastian Wild and Viktor Zamaraev. 2021. Randomized Communication and the Implicit Graph Conjecture. arXiv preprint arXiv:2111.03639.  Nathaniel Harms Sebastian Wild and Viktor Zamaraev. 2021. Randomized Communication and the Implicit Graph Conjecture. arXiv preprint arXiv:2111.03639.","DOI":"10.1145\/3519935.3519978"},{"key":"#cr-split#-e_1_3_2_1_32_1.1","unstructured":"Hamed Hatami and Pooya Hatami. 2021. The Implicit Graph Conjecture is False. arXiv preprint arXiv:2111.13198 https:\/\/doi.org\/10.48550\/arXiv.2111.13198 10.48550\/arXiv.2111.13198"},{"key":"#cr-split#-e_1_3_2_1_32_1.2","doi-asserted-by":"crossref","unstructured":"Hamed Hatami and Pooya Hatami. 2021. The Implicit Graph Conjecture is False. arXiv preprint arXiv:2111.13198 https:\/\/doi.org\/10.48550\/arXiv.2111.13198","DOI":"10.1109\/FOCS54457.2022.00109"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.01.014"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-012-9394-8"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0405049"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2017.05.008"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.21799"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01364272"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-2013-05820-5"},{"key":"e_1_3_2_1_40_1","unstructured":"John H Muller. 1989. Local structure in graph classes.  John H Muller. 1989. Local structure in graph classes."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.120"},{"key":"e_1_3_2_1_42_1","volume-title":"Communication Complexity","author":"Nisan Noam","unstructured":"Noam Nisan and Eyal Kushilevitz . 1997. Communication Complexity . Cambridge University Press . Noam Nisan and Eyal Kushilevitz. 1997. Communication Complexity. Cambridge University Press."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-021-00210-5"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.4064\/aa-9-4-331-340"},{"key":"e_1_3_2_1_45_1","volume-title":"Communication Complexity and Applications","author":"Rao Anup","unstructured":"Anup Rao and Amir Yehudayoff . 2020. Communication Complexity and Applications . Cambridge University Press . Anup Rao and Amir Yehudayoff. 2020. Communication Complexity and Applications. Cambridge University Press."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(86)90023-4"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00095"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(99)00025-4"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1027"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977042.6"},{"key":"#cr-split#-e_1_3_2_1_51_1.1","unstructured":"Pierre Simon and Szymon Toru\u0144czyk. 2021. Ordered graphs of bounded twin-width. arXiv preprint arXiv:2102.06881 https:\/\/doi.org\/10.48550\/arXiv.2102.06881 10.48550\/arXiv.2102.06881"},{"key":"#cr-split#-e_1_3_2_1_51_1.2","unstructured":"Pierre Simon and Szymon Toru\u0144czyk. 2021. Ordered graphs of bounded twin-width. arXiv preprint arXiv:2102.06881 https:\/\/doi.org\/10.48550\/arXiv.2102.06881"},{"key":"e_1_3_2_1_52_1","volume-title":"Efficient graph representations","author":"Spinrad Jeremy P","unstructured":"Jeremy P Spinrad . 2003. Efficient graph representations . American Mathematical Society . Jeremy P Spinrad. 2003. Efficient graph representations. American Mathematical Society."}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","location":"Rome Italy","acronym":"STOC '22","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519978","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:49:39Z","timestamp":1750254579000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":59,"alternative-id":["10.1145\/3519935.3519978","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519978","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}