{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:29:36Z","timestamp":1761611376638,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,7,21]],"date-time":"2015-07-21T00:00:00Z","timestamp":1437436800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF CISE","award":["AF:Small: Distributed Algorithms for Near-Planar Networks"],"award-info":[{"award-number":["AF:Small: Distributed Algorithms for Near-Planar Networks"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,7,21]]},"DOI":"10.1145\/2767386.2767435","type":"proceedings-article","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T13:28:49Z","timestamp":1437139729000},"page":"413-419","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Distributed Resource Discovery in Sub-Logarithmic Time"],"prefix":"10.1145","author":[{"given":"Bernhard","family":"Haeupler","sequence":"first","affiliation":[{"name":"CMU, Pittsburgh, PA, USA"}]},{"given":"Dahlia","family":"Malkhi","sequence":"additional","affiliation":[{"name":"VMware Research, Palo Alto, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2015,7,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2005.09.015"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-41527-2_15"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214064"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806745"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_7_1","first-page":"57","volume-title":"28th International Symposium on Theoretical Aspects of Computer Science (STACS)","author":"Giakkoupis G.","year":"2011","unstructured":"G. Giakkoupis . Tight bounds for rumor spreading in graphs of a given conductance . In 28th International Symposium on Theoretical Aspects of Computer Science (STACS) , pages 57 -- 68 , Dagstuhl, Germany , 2011 . Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik. G. Giakkoupis. Tight bounds for rumor spreading in graphs of a given conductance. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS), pages 57--68, Dagstuhl, Germany, 2011. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627868"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611489"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312031"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/301308.301362"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796561"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.11.027"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.11.006"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/829526.831147"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.02.005"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1084-8"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/355459"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(82)90008-6"}],"event":{"name":"PODC '15: 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":"Donostia-San Sebasti\u00e1n Spain","acronym":"PODC '15"},"container-title":["Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767435","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2767386.2767435","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:07:06Z","timestamp":1750223226000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2767386.2767435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,21]]},"references-count":18,"alternative-id":["10.1145\/2767386.2767435","10.1145\/2767386"],"URL":"https:\/\/doi.org\/10.1145\/2767386.2767435","relation":{},"subject":[],"published":{"date-parts":[[2015,7,21]]},"assertion":[{"value":"2015-07-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}