{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:06:36Z","timestamp":1750694796241,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,20]],"date-time":"2022-07-20T00:00:00Z","timestamp":1658275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972191"],"award-info":[{"award-number":["61972191"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Anhui Initiative in Quantum Information Technologies","award":["AHY150100"],"award-info":[{"award-number":["AHY150100"]}]},{"name":"National Key R&D Program of China","award":["2018YFB1003202"],"award-info":[{"award-number":["2018YFB1003202"]}]},{"name":"Program for Innovative Talents and Entrepreneur in Jiangsu"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,20]]},"DOI":"10.1145\/3519270.3538441","type":"proceedings-article","created":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T16:23:51Z","timestamp":1658420631000},"page":"120-130","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Quantum Complexity of Weighted Diameter and Radius in CONGEST Networks"],"prefix":"10.1145","author":[{"given":"Xudong","family":"Wu","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}]},{"given":"Penghui","family":"Yao","sequence":"additional","affiliation":[{"name":"Nanjiing University, Nanjing, China"}]}],"member":"320","published-online":{"date-parts":[[2022,7,21]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325"},{"key":"e_1_3_2_2_2_1","volume-title":"DISC 2016, Paris, France, September 27--29, 2016. Proceedings (Lecture Notes in Computer Science","volume":"42","author":"Abboud Amir","year":"2016","unstructured":"Amir Abboud , Keren Censor-Hillel , and Seri Khoury . 2016 . Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. In Distributed Computing - 30th International Symposium , DISC 2016, Paris, France, September 27--29, 2016. Proceedings (Lecture Notes in Computer Science , Vol. 9888), Cyril Gavoille and David Ilcinkas (Eds.). Springer, 29-- 42 . https:\/\/doi.org\/10.1007\/ 978--3--662--53426--7_3 Amir Abboud, Keren Censor-Hillel, and Seri Khoury. 2016. Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks. In Distributed Computing - 30th International Symposium, DISC 2016, Paris, France, September 27--29, 2016. Proceedings (Lecture Notes in Computer Science, Vol. 9888), Cyril Gavoille and David Ilcinkas (Eds.). Springer, 29--42. https:\/\/doi.org\/10.1007\/ 978--3--662--53426--7_3"},{"key":"e_1_3_2_2_3_1","volume-title":"Distributed Distance Approximation. In 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14--16, 2020, Strasbourg, France (Virtual Conference) (LIPIcs","volume":"17","author":"Ancona Bertie","year":"2020","unstructured":"Bertie Ancona , Keren Censor-Hillel , Mina Dalirrooyfard , Yuval Efron , and Virginia Vassilevska Williams . 2020 . Distributed Distance Approximation. In 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14--16, 2020, Strasbourg, France (Virtual Conference) (LIPIcs , Vol. 184), Quentin Bramas, Rotem Oshman, and Paolo Romano (Eds.). Schloss Dagstuhl - Leibniz- Zentrum f\u00fcr Informatik, 30:1--30: 17 . https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020. 30 10.4230\/LIPIcs.OPODIS.2020 Bertie Ancona, Keren Censor-Hillel, Mina Dalirrooyfard, Yuval Efron, and Virginia Vassilevska Williams. 2020. Distributed Distance Approximation. In 24th International Conference on Principles of Distributed Systems, OPODIS 2020, December 14--16, 2020, Strasbourg, France (Virtual Conference) (LIPIcs, Vol. 184), Quentin Bramas, Rotem Oshman, and Paolo Romano (Eds.). Schloss Dagstuhl - Leibniz- Zentrum f\u00fcr Informatik, 30:1--30:17. https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2020. 30"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060662"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218053"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316326"},{"key":"e_1_3_2_2_7_1","volume-title":"Quantum Distributed Algorithms for Detection of Cliques. In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022","volume":"25","author":"Censor-Hillel Keren","year":"2022","unstructured":"Keren Censor-Hillel , Orr Fischer , Fran\u00e7ois Le Gall , Dean Leitersdorf , and Rotem Oshman . 2022 . Quantum Distributed Algorithms for Detection of Cliques. In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022 , January 31 - February 3, 2022, Berkeley, CA, USA (LIPIcs, Vol. 215), Mark Braverman (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 35:1--35: 25 . https:\/\/doi.org\/ 10.4230\/LIPIcs.ITCS.2022.35 10.4230\/LIPIcs.ITCS.2022.35 Keren Censor-Hillel, Orr Fischer, Fran\u00e7ois Le Gall, Dean Leitersdorf, and Rotem Oshman. 2022. Quantum Distributed Algorithms for Detection of Cliques. In 13th Innovations in Theoretical Computer Science Conference, ITCS 2022, January 31 - February 3, 2022, Berkeley, CA, USA (LIPIcs, Vol. 215), Mark Braverman (Ed.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 35:1--35:25. https:\/\/doi.org\/ 10.4230\/LIPIcs.ITCS.2022.35"},{"key":"e_1_3_2_2_8_1","volume-title":"Single-Source Shortest Paths in the CONGEST Model with Improved Bound. In PODC '20: ACM Symposium on Principles of Distributed Computing","author":"Chechik Shiri","year":"2020","unstructured":"Shiri Chechik and Doron Mukhtar . 2020 . Single-Source Shortest Paths in the CONGEST Model with Improved Bound. In PODC '20: ACM Symposium on Principles of Distributed Computing , Virtual Event, Italy, August 3--7 , 2020, Yuval Emek and Christian Cachin (Eds.). ACM, 464--473. https:\/\/doi.org\/10.1145\/3382734.3405729 10.1145\/3382734.3405729 Shiri Chechik and Doron Mukhtar. 2020. Single-Source Shortest Paths in the CONGEST Model with Improved Bound. In PODC '20: ACM Symposium on Principles of Distributed Computing, Virtual Event, Italy, August 3--7, 2020, Yuval Emek and Christian Cachin (Eds.). ACM, 464--473. https:\/\/doi.org\/10.1145\/3382734.3405729"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441058"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611488"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.91"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3212734.3212744"},{"key":"e_1_3_2_2_13_1","volume-title":"Quantum Advantage for the LOCAL Model in Distributed Computing. In 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019","volume":"14","author":"Gall Fran\u00e7ois Le","year":"2019","unstructured":"Fran\u00e7ois Le Gall , Harumichi Nishimura , and Ansis Rosmanis . 2019 . Quantum Advantage for the LOCAL Model in Distributed Computing. In 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019 , March 13 --16 , 2019, Berlin, Germany (LIPIcs, Vol. 126), Rolf Niedermeier and Christophe Paul (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 49:1--49: 14 . https: \/\/doi.org\/10.4230\/LIPIcs.STACS.2019.49 10.4230\/LIPIcs.STACS.2019.49 Fran\u00e7ois Le Gall, Harumichi Nishimura, and Ansis Rosmanis. 2019. Quantum Advantage for the LOCAL Model in Distributed Computing. In 36th International Symposium on Theoretical Aspects of Computer Science, STACS 2019, March 13--16, 2019, Berlin, Germany (LIPIcs, Vol. 126), Rolf Niedermeier and Christophe Paul (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 49:1--49:14. https: \/\/doi.org\/10.4230\/LIPIcs.STACS.2019.49"},{"key":"e_1_3_2_2_14_1","volume-title":"23rd International Symposium, DISC 2009, Elche, Spain, September 23--25, 2009. Proceedings (Lecture Notes in Computer Science","volume":"257","author":"Gavoille Cyril","year":"2009","unstructured":"Cyril Gavoille , Adrian Kosowski , and Marcin Markiewicz . 2009 . What Can Be Observed Locally?. In Distributed Computing , 23rd International Symposium, DISC 2009, Elche, Spain, September 23--25, 2009. Proceedings (Lecture Notes in Computer Science , Vol. 5805), Idit Keidar (Ed.). Springer, 243-- 257 . https:\/\/doi.org\/10.1007\/978- 3--642-04355-0_26 10.1007\/978- Cyril Gavoille, Adrian Kosowski, and Marcin Markiewicz. 2009. What Can Be Observed Locally?. In Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23--25, 2009. Proceedings (Lecture Notes in Computer Science, Vol. 5805), Idit Keidar (Ed.). Springer, 243--257. https:\/\/doi.org\/10.1007\/978- 3--642-04355-0_26"},{"key":"e_1_3_2_2_15_1","volume-title":"DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science","volume":"564","author":"Holzer Stephan","year":"2014","unstructured":"Stephan Holzer , David Peleg , Liam Roditty , and Roger Wattenhofer . 2014 . Distributed 3\/2-Approximation of the Diameter. In Distributed Computing - 28th International Symposium , DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science , Vol. 8784), Fabian Kuhn (Ed.). Springer, 562-- 564 . https:\/\/link.springer.com\/content\/pdf\/bbm%3A978--3--662--45174--8%2F1.pdf Stephan Holzer, David Peleg, Liam Roditty, and Roger Wattenhofer. 2014. Distributed 3\/2-Approximation of the Diameter. In Distributed Computing - 28th International Symposium, DISC 2014, Austin, TX, USA, October 12--15, 2014. Proceedings (Lecture Notes in Computer Science, Vol. 8784), Fabian Kuhn (Ed.). Springer, 562-- 564. https:\/\/link.springer.com\/content\/pdf\/bbm%3A978--3--662--45174--8%2F1.pdf"},{"key":"e_1_3_2_2_16_1","volume-title":"Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. In 19th International Conference on Principles of Distributed Systems, OPODIS 2015","volume":"16","author":"Holzer Stephan","year":"2015","unstructured":"Stephan Holzer and Nathan Pinsker . 2015 . Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. In 19th International Conference on Principles of Distributed Systems, OPODIS 2015 , December 14 --17 , 2015, Rennes, France (LIPIcs, Vol. 46), Emmanuelle Anceaume, Christian Cachin, and Maria Gradinariu Potop-Butucaru (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 6:1--6: 16 . https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2015.6 10.4230\/LIPIcs.OPODIS.2015.6 Stephan Holzer and Nathan Pinsker. 2015. Approximation of Distances and Shortest Paths in the Broadcast Congest Clique. In 19th International Conference on Principles of Distributed Systems, OPODIS 2015, December 14--17, 2015, Rennes, France (LIPIcs, Vol. 46), Emmanuelle Anceaume, Christian Cachin, and Maria Gradinariu Potop-Butucaru (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 6:1--6:16. https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2015.6"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332504"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331628"},{"key":"e_1_3_2_2_19_1","volume-title":"Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. In 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020","volume":"13","author":"Izumi Taisuke","year":"2020","unstructured":"Taisuke Izumi , Fran\u00e7ois Le Gall , and Fr\u00e9d\u00e9ric Magniez . 2020 . Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. In 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020 , March 10 --13 , 2020, Montpellier, France (LIPIcs, Vol. 154), Christophe Paul and Markus Bl\u00e4ser (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 23:1--23: 13 . https: \/\/doi.org\/10.4230\/LIPIcs.STACS.2020.23 10.4230\/LIPIcs.STACS.2020.23 Taisuke Izumi, Fran\u00e7ois Le Gall, and Fr\u00e9d\u00e9ric Magniez. 2020. Quantum Distributed Algorithm for Triangle Finding in the CONGEST Model. In 37th International Symposium on Theoretical Aspects of Computer Science, STACS 2020, March 10--13, 2020, Montpellier, France (LIPIcs, Vol. 154), Christophe Paul and Markus Bl\u00e4ser (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 23:1--23:13. https: \/\/doi.org\/10.4230\/LIPIcs.STACS.2020.23"},{"key":"e_1_3_2_2_20_1","volume-title":"47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbr\u00fccken, Germany (Virtual Conference) (LIPIcs","volume":"18","author":"Magniez Fr\u00e9d\u00e9ric","year":"2020","unstructured":"Fr\u00e9d\u00e9ric Magniez and Ashwin Nayak . 2020 . Quantum Distributed Complexity of Set Disjointness on a Line. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbr\u00fccken, Germany (Virtual Conference) (LIPIcs , Vol. 168), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 82:1--82: 18 . https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.82 10.4230\/LIPIcs.ICALP.2020.82 Fr\u00e9d\u00e9ric Magniez and Ashwin Nayak. 2020. Quantum Distributed Complexity of Set Disjointness on a Line. In 47th International Colloquium on Automata, Languages, and Programming, ICALP 2020, July 8--11, 2020, Saarbr\u00fccken, Germany (Virtual Conference) (LIPIcs, Vol. 168), Artur Czumaj, Anuj Dawar, and Emanuela Merelli (Eds.). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 82:1--82:18. https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.82"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_2_22_1","volume-title":"39th International Colloquium, ICALP 2012, Warwick, UK, July 9--13, 2012, Proceedings, Part II (Lecture Notes in Computer Science","volume":"672","author":"Peleg David","year":"2012","unstructured":"David Peleg , Liam Roditty , and Elad Tal . 2012 . Distributed Algorithms for Network Diameter and Girth. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9--13, 2012, Proceedings, Part II (Lecture Notes in Computer Science , Vol. 7392), Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, and Roger Wattenhofer (Eds.). Springer, 660-- 672 . https:\/\/doi.org\/10.1007\/978--3--642--31585--5_58 10.1007\/978--3--642--31585--5_58 David Peleg, Liam Roditty, and Elad Tal. 2012. Distributed Algorithms for Network Diameter and Girth. In Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9--13, 2012, Proceedings, Part II (Lecture Notes in Computer Science, Vol. 7392), Artur Czumaj, Kurt Mehlhorn, Andrew M. Pitts, and Roger Wattenhofer (Eds.). Springer, 660--672. https:\/\/doi.org\/10.1007\/978--3--642--31585--5_58"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2141938.2141939"}],"event":{"name":"PODC '22: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Salerno Italy","acronym":"PODC '22"},"container-title":["Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538441","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519270.3538441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:21Z","timestamp":1750191141000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519270.3538441"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,20]]},"references-count":24,"alternative-id":["10.1145\/3519270.3538441","10.1145\/3519270"],"URL":"https:\/\/doi.org\/10.1145\/3519270.3538441","relation":{},"subject":[],"published":{"date-parts":[[2022,7,20]]},"assertion":[{"value":"2022-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}