{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:12Z","timestamp":1750306692213,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,21]],"date-time":"2014-06-21T00:00:00Z","timestamp":1403308800000},"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":[[2014,6,21]]},"DOI":"10.1145\/2612669.2612693","type":"proceedings-article","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T14:23:03Z","timestamp":1404224583000},"page":"267-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Ephemeral networks with random availability of links"],"prefix":"10.1145","author":[{"given":"Eleni C.","family":"Akrida","sequence":"first","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]},{"given":"Leszek","family":"Gasieniec","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]},{"given":"George B.","family":"Mertzios","sequence":"additional","affiliation":[{"name":"Durham University, UK, Durham, United Kingdom"}]},{"given":"Paul G.","family":"Spirakis","sequence":"additional","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2014,6,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70575-8_11"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400773"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"2001","unstructured":"B. Bollob\u00e1s . Random Graphs , 2 nd Edition. Cambridge University Press , 2001 . B. Bollob\u00e1s. Random Graphs, 2nd Edition. Cambridge University Press, 2001.","edition":"2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103001728"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1080\/17445760.2012.668546"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/090756053"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/41840.41841"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2627817.2627869"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1148109.1148135"},{"key":"e_1_3_2_1_12_1","first-page":"218","volume-title":"Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Els\u00e4sser R.","year":"2008","unstructured":"R. Els\u00e4sser and T. Sauerwald . The power of memory in randomized broadcasting . In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 218 -- 227 , 2008 . R. Els\u00e4sser and T. Sauerwald. The power of memory in randomized broadcasting. In Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 218--227, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs, i","volume":"6","author":"Erd\u00f6s P.","year":"1959","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi . On random graphs, i . Publicationes Mathematicae Debrecen , 6 : 290 -- 297 , 1959 . P. Erd\u00f6s and A. R\u00e9nyi. On random graphs, i. Publicationes Mathematicae Debrecen, 6:290--297, 1959.","journal-title":"Publicationes Mathematicae Debrecen"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(98)00037-6"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"e_1_3_2_1_16_1","first-page":"210","volume-title":"Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Gavoille C.","year":"2001","unstructured":"C. Gavoille , D. Peleg , S. Perennes , and R. Raz . Distance labeling in graphs . In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) , pages 210 -- 219 , 2001 . C. Gavoille, D. Peleg, S. Perennes, and R. Raz. Distance labeling in graphs. In Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 210--219, 2001."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796561"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703433912"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/335305.335364"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806760"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39212-2_57"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2011.02.003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.2200\/S00328ED1V01Y201101DCT006"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35476-2_19"},{"key":"e_1_3_2_1_25_1","series-title":"Algorithms and Combinatorics","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph colouring and the probabilistic method","author":"Molloy M.","year":"2002","unstructured":"M. Molloy and B. Reed . Graph colouring and the probabilistic method , volume 23 of Algorithms and Combinatorics . Springer , 2002 . M. Molloy and B. Reed. Graph colouring and the probabilistic method, volume 23 of Algorithms and Combinatorics. Springer, 2002."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080810.1080828"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90040-X"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/646516.696162"}],"event":{"name":"SPAA '14: 26th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Prague Czech Republic","acronym":"SPAA '14"},"container-title":["Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612693","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2612669.2612693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:34Z","timestamp":1750230094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2612669.2612693"}},"subtitle":["diameter and connectivity"],"short-title":[],"issued":{"date-parts":[[2014,6,21]]},"references-count":28,"alternative-id":["10.1145\/2612669.2612693","10.1145\/2612669"],"URL":"https:\/\/doi.org\/10.1145\/2612669.2612693","relation":{},"subject":[],"published":{"date-parts":[[2014,6,21]]},"assertion":[{"value":"2014-06-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}