{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T06:03:33Z","timestamp":1783577013060,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3662158.3662791","type":"proceedings-article","created":{"date-parts":[[2024,6,5]],"date-time":"2024-06-05T14:38:06Z","timestamp":1717598286000},"page":"380-390","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0109-2432","authenticated-orcid":false,"given":"Yi-Jun","family":"Chang","sequence":"first","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-1565-881X","authenticated-orcid":false,"given":"Oren","family":"Hecht","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2775-9207","authenticated-orcid":false,"given":"Dean","family":"Leitersdorf","sequence":"additional","affiliation":[{"name":"National University of Singapore, Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9660-1270","authenticated-orcid":false,"given":"Philipp","family":"Schneider","sequence":"additional","affiliation":[{"name":"University of Bern, Bern, Switzerland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Proceedings of the 35th International Symposium on Distributed Computing (DISC)","volume":"209","author":"Anagnostides Ioannis","year":"2021","unstructured":"Ioannis Anagnostides and Themis Gouleakis. 2021. Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. In Proceedings of the 35th International Symposium on Distributed Computing (DISC), Vol. 209. 5:1--5:19."},{"key":"e_1_3_2_2_2_1","volume-title":"Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. In 35th International Symposium on Distributed Computing. 5:1--5:19","author":"Anagnostides Ioannis","year":"2021","unstructured":"Ioannis Anagnostides and Themis Gouleakis. 2021. Deterministic Distributed Algorithms and Lower Bounds in the Hybrid Model. In 35th International Symposium on Distributed Computing. 5:1--5:19."},{"key":"e_1_3_2_2_3_1","volume-title":"Distributed graph realizations","author":"Augustine John","year":"2021","unstructured":"John Augustine, Keerti Choudhary, Avi Cohen, David Peleg, Sumathi Sivasubramaniam, and Suman Sourav. 2021. Distributed graph realizations. IEEE transactions on parallel and distributed systems 33, 6 (2021), 1321--1337."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3323165.3323195"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.78"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0088-2"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767447"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1233534"},{"key":"e_1_3_2_2_9_1","first-page":"1","article-title":"Distance Computations in the Hybrid Network Model via Oracle Simulations. In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS)","volume":"21","author":"Censor-Hillel Keren","year":"2021","unstructured":"Keren Censor-Hillel, Dean Leitersdorf, and Volodymyr Polosukhin. 2021. Distance Computations in the Hybrid Network Model via Oracle Simulations. In Proceedings of the 38th Symposium on Theoretical Aspects of Computer Science (STACS). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 21:1--21:19.","journal-title":"Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461798"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Yi-Jun Chang Oren Hecht Dean Leitersdorf and Philipp Schneider. 2023. Universally Optimal Information Dissemination and Shortest Paths in the HYBRID Distributed Model. arXiv:2311.09548v2 [cs.DC]","DOI":"10.1145\/3662158.3662791"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331599"},{"key":"e_1_3_2_2_13_1","volume-title":"Proceedings of the 25th International Conference on Principles of Distributed Systems (OPODIS","author":"Coy Sam","year":"2022","unstructured":"Sam Coy, Artur Czumaj, Michael Feldmann, Kristian Hinnenthal, Fabian Kuhn, Christian Scheideler, Philipp Schneider, and Martijn Struijs. 2022. Near-Shortest Path Routing in Hybrid Communication Networks. In Proceedings of the 25th International Conference on Principles of Distributed Systems (OPODIS 2021). 11:1--11:23."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-32733-9_14"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851223"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2020.31"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261118"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP). 137:1--137:15","author":"Gmyr Robert","year":"2017","unstructured":"Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, and Christian Sohler. 2017. Distributed monitoring of network properties: The power of hybrid networks. In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP). 137:1--137:15."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451081"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018442"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.OPODIS.2015.6"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01325-7_28"},{"key":"e_1_3_2_2_24_1","volume-title":"An overview of device-to-device communication in cellular networks. ICT express 4, 4","author":"Kar Udit Narayana","year":"2018","unstructured":"Udit Narayana Kar and Debarshi Kumar Sanyal. 2018. An overview of device-to-device communication in cellular networks. ICT express 4, 4 (2018), 203--208."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3382734.3405719"},{"key":"e_1_3_2_2_26_1","volume-title":"Routing Schemes and Distance Oracles in the Hybrid Model. In International Symposium on Distributed Computing (DISC)","volume":"246","author":"Kuhn Fabian","year":"2022","unstructured":"Fabian Kuhn and Philipp Schneider. 2022. Routing Schemes and Distance Oracles in the Hybrid Model. In International Symposium on Distributed Computing (DISC), Vol. 246. 28:1--28:22."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"crossref","unstructured":"Christoph Lenzen. 2013. Optimal deterministic routing and sorting on the congested clique. In Principles of Distr. Comp. (PODC). 42--50.","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_2_28_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_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933066"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.01.003"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384298"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519935.3520074"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","unstructured":"Philipp Schneider. 2023. Power and Limitations of Hybrid Communication Networks. Ph. D. Dissertation. University of Freiburg. 10.6094\/UNIFR\/232804","DOI":"10.6094\/UNIFR\/232804"},{"key":"e_1_3_2_2_34_1","volume-title":"A mathematical theory of communication. The Bell system technical journal 27, 3","author":"Shannon Claude Elwood","year":"1948","unstructured":"Claude Elwood Shannon. 1948. A mathematical theory of communication. The Bell system technical journal 27, 3 (1948), 379--423."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220006"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2011.5876498"}],"event":{"name":"PODC '24: 43rd ACM Symposium on Principles of Distributed Computing","location":"Nantes France","acronym":"PODC '24","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662791","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:41Z","timestamp":1750290221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3662158.3662791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":36,"alternative-id":["10.1145\/3662158.3662791","10.1145\/3662158"],"URL":"https:\/\/doi.org\/10.1145\/3662158.3662791","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"}}]}}