{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:17Z","timestamp":1759638617645,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":47,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"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":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055449","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"743-756","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":28,"title":["A time- and message-optimal distributed algorithm for minimum spanning trees"],"prefix":"10.1145","author":[{"given":"Gopal","family":"Pandurangan","sequence":"first","affiliation":[{"name":"University of Houston, USA"}]},{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[{"name":"Royal Holloway University of London, UK"}]},{"given":"Michele","family":"Scquizzato","sequence":"additional","affiliation":[{"name":"University of Houston, USA"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Hagit Attiya and Jennifer Welch. 1998.  Hagit Attiya and Jennifer Welch. 1998."},{"volume-title":"Fundamentals, Simulations and Advanced Topics","author":"Computing Distributed","key":"e_1_3_2_1_2_1","unstructured":"Distributed Computing : Fundamentals, Simulations and Advanced Topics . McGraw-Hill, Inc. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, Inc."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28421"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77618"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89571"},{"key":"e_1_3_2_1_6_1","unstructured":"Francis Y. L. Chin and H. F. Ting. 1985.  Francis Y. L. Chin and H. F. Ting. 1985."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/11085178X"},{"key":"e_1_3_2_1_8_1","unstructured":"Atish Das Sarma Danupon Nanongkai Gopal Pandurangan and Prasad Tetali. 2013.  Atish Das Sarma Danupon Nanongkai Gopal Pandurangan and Prasad Tetali. 2013."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2432622.2432624"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2006.07.002"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Michael Elkin. 2006.  Michael Elkin. 2006.","DOI":"10.12968\/sece.2006.6.655"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704441058"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611488"},{"key":"e_1_3_2_1_14_1","unstructured":"Michalis Faloutsos and Mart Molle. 2004.  Michalis Faloutsos and Mart Molle. 2004."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-004-0107-2"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/323596.323612"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/357195.357200"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794261118"},{"key":"e_1_3_2_1_19_1","unstructured":"James W. Hegeman Gopal Pandurangan Sriram V. Pemmaraju Vivek B. Sardeshmukh and Michele Scquizzato. 2015.  James W. Hegeman Gopal Pandurangan Sriram V. Pemmaraju Vivek B. Sardeshmukh and Michele Scquizzato. 2015."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767434"},{"key":"e_1_3_2_1_21_1","unstructured":"Monika Henzinger Sebastian Krinninger and Danupon Nanongkai. 2016.  Monika Henzinger Sebastian Krinninger and Danupon Nanongkai. 2016."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897638"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0047-8"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767405"},{"key":"e_1_3_2_1_25_1","unstructured":"Hartmut Klauck Danupon Nanongkai Gopal Pandurangan and Peter Robinson. 2015.  Hartmut Klauck Danupon Nanongkai Gopal Pandurangan and Peter Robinson. 2015."},{"volume-title":"Computation of Large-Scale Graph Problems. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 391\u2013410","author":"Distributed","key":"e_1_3_2_1_26_1","unstructured":"Distributed Computation of Large-Scale Graph Problems. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 391\u2013410 . Distributed Computation of Large-Scale Graph Problems. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). 391\u2013410."},{"key":"e_1_3_2_1_27_1","unstructured":"Liah Kor Amos Korman and David Peleg. 2013.  Liah Kor Amos Korman and David Peleg. 2013."},{"key":"e_1_3_2_1_28_1","volume-title":"Theory Comput. Syst. 53, 2","author":"Distributed Minimum-Weight Spanning Tight Bounds","year":"2013","unstructured":"Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification . Theory Comput. Syst. 53, 2 ( 2013 ), 318\u2013340. Tight Bounds for Distributed Minimum-Weight Spanning Tree Verification. Theory Comput. Syst. 53, 2 (2013), 318\u2013340."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45174-8_32"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699440"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0929"},{"key":"e_1_3_2_1_32_1","unstructured":"Christoph Lenzen. 2016.  Christoph Lenzen. 2016."},{"key":"e_1_3_2_1_33_1","unstructured":"Lecture notes on Theory of Distributed Systems. https:\/\/www.mpiinf.mpg.de\/fileadmin\/inf\/d1\/teaching\/winter15\/tods\/ToDS.pdf.  Lecture notes on Theory of Distributed Systems. https:\/\/www.mpiinf.mpg.de\/fileadmin\/inf\/d1\/teaching\/winter15\/tods\/ToDS.pdf."},{"key":"e_1_3_2_1_34_1","unstructured":"Nancy Lynch. 1996.  Nancy Lynch. 1996."},{"key":"e_1_3_2_1_35_1","unstructured":"Distributed Algorithms. Morgan Kaufmann Publishers.  Distributed Algorithms. Morgan Kaufmann Publishers."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591850"},{"key":"e_1_3_2_1_37_1","volume-title":"Atish Das Sarma, and Gopal Pandurangan","author":"Nanongkai Danupon","year":"2011","unstructured":"Danupon Nanongkai , Atish Das Sarma, and Gopal Pandurangan . 2011 . Danupon Nanongkai, Atish Das Sarma, and Gopal Pandurangan. 2011."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993853"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48314-6_6"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/646252.686015"},{"key":"e_1_3_2_1_41_1","unstructured":"David Peleg. 2000.  David Peleg. 2000."},{"key":"e_1_3_2_1_42_1","volume-title":"Society for Industrial and Applied Mathematics. STOC\u201917","author":"Computing Distributed","year":"2017","unstructured":"Distributed Computing : A Locality-Sensitive Approach . Society for Industrial and Applied Mathematics. STOC\u201917 , June 2017 , Montreal, Canada G. Pandurangan et al. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics. STOC\u201917, June 2017, Montreal, Canada G. Pandurangan et al."},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539700369740"},{"key":"e_1_3_2_1_44_1","unstructured":"Robert E. Tarjan. 1983.  Robert E. Tarjan. 1983."},{"key":"e_1_3_2_1_45_1","unstructured":"Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics.   Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics."},{"key":"e_1_3_2_1_46_1","unstructured":"Gerard Tel. 1994.  Gerard Tel. 1994."},{"key":"e_1_3_2_1_47_1","unstructured":"Introduction to Distributed Algorithms. Cambridge University Press.  Introduction to Distributed Algorithms. Cambridge University Press."}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:23:27Z","timestamp":1750220607000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":47,"alternative-id":["10.1145\/3055399.3055449","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055449","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}