{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:31:44Z","timestamp":1770834704832,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,6,14]],"date-time":"2008-06-14T00:00:00Z","timestamp":1213401600000},"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":[[2008,6,14]]},"DOI":"10.1145\/1378533.1378557","type":"proceedings-article","created":{"date-parts":[[2008,6,17]],"date-time":"2008-06-17T13:49:02Z","timestamp":1213710542000},"page":"119-128","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":67,"title":["Many random walks are faster than one"],"prefix":"10.1145","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}]},{"given":"Chen","family":"Avin","sequence":"additional","affiliation":[{"name":"Ben Gurion University of the Negev, Beer-Sheva, Israel"}]},{"given":"Michal","family":"Koucky","sequence":"additional","affiliation":[{"name":"Czech Academy of Sciences, Prague, Czech Rep"}]},{"given":"Gady","family":"Kozma","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Rehovot, Israel"}]},{"given":"Zvi","family":"Lotker","sequence":"additional","affiliation":[{"name":"Ben Gurion University of the Negev, Beer-Sheva, Israel"}]},{"given":"Mark R.","family":"Tuttle","sequence":"additional","affiliation":[{"name":"Intel, Hudson, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"In Proc. of 1st Workshop on Information Theory and its Application","author":"Alanyali M.","year":"2006","unstructured":"Alanyali , M. , Saligrama , V. , and Sava , O . A random-walk model for distributed computation in energy-limited network . In In Proc. of 1st Workshop on Information Theory and its Application ( San Diego , 2006 ).]] Alanyali, M., Saligrama, V., and Sava, O. A random-walk model for distributed computation in energy-limited network. In In Proc. of 1st Workshop on Information Theory and its Application (San Diego, 2006).]]"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535260"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01048272"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01047002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1979.34"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579166"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/333979.333984"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984663"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_55"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132905.1132932"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1471"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/570738.570742"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01048273"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73059"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73062"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/644108.644134"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/829526.831134"},{"key":"e_1_3_2_1_18_1","first-page":"4","article-title":"A tight lower bound on the cover time for random walks on graphs","volume":"6","author":"Feige U","year":"1995","unstructured":"Feige , U . A tight lower bound on the cover time for random walks on graphs . Random Structures and Algorithms 6 , 4 ( 1995 ), 433--438.]] Feige, U. A tight lower bound on the cover time for random walks on graphs. Random Structures and Algorithms 6, 4 (1995), 433--438.]]","journal-title":"Random Structures and Algorithms"},{"key":"e_1_3_2_1_19_1","first-page":"1","article-title":"A tight upper bound on the cover time for random walks on graphs","volume":"6","author":"Feige U","year":"1995","unstructured":"Feige , U . A tight upper bound on the cover time for random walks on graphs . Random Structures and Algorithms 6 , 1 ( 1995 ), 51--54.]] Feige, U. A tight upper bound on the cover time for random walks on graphs. Random Structures and Algorithms 6, 1 (1995), 51--54.]]","journal-title":"Random Structures and Algorithms"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480194264988"},{"key":"e_1_3_2_1_21_1","volume-title":"in Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM).","author":"Gkantsidis C.","unstructured":"Gkantsidis , C. , Mihail , M. , and Saberi , A . Random walks in peer-to-peer networks . In in Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). to appear (2004).]] Gkantsidis, C., Mihail, M., and Saberi, A. Random walks in peer-to-peer networks. In in Proc. 23 Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). to appear (2004).]]"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1996.0078"},{"key":"e_1_3_2_1_23_1","first-page":"482","volume-title":"Approximations for NP-hard Problems, Dorit Hochbaum ed","author":"Jerrum M.","year":"1997","unstructured":"Jerrum , M. , and Sinclair , A . The markov chain monte carlo method: An approach to approximate counting and integration . In Approximations for NP-hard Problems, Dorit Hochbaum ed . PWS Publishing , Boston, MA , 1997 , pp. 482 -- 520 .]] Jerrum, M., and Sinclair, A. The markov chain monte carlo method: An approach to approximate counting and integration. In Approximations for NP-hard Problems, Dorit Hochbaum ed. PWS Publishing, Boston, MA, 1997, pp. 482--520.]]"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548398003538"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v5-1022"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979325247X"},{"key":"e_1_3_2_1_27_1","series-title":"Bolyai Soc","first-page":"353","volume-title":"Combinatorics, Paul Erd\u00f6s is eighty","author":"Lov\u00e1sz L.","year":"1993","unstructured":"Lov\u00e1sz , L. Random walks on graphs: A survey . In Combinatorics, Paul Erd\u00f6s is eighty , Vol. 2 (Keszthely, 1993 ), vol. 2 of Bolyai Soc . Math. Stud. J\u00e1nos Bolyai Math. Soc., Budapest , 1996, pp. 353 -- 397 .]] Lov\u00e1sz, L. Random walks on graphs: A survey. In Combinatorics, Paul Erd\u00f6s is eighty, Vol. 2 (Keszthely, 1993), vol. 2 of Bolyai Soc. Math. Stud. J\u00e1nos Bolyai Math. Soc., Budapest, 1996, pp. 353--397.]]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1176991894"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267822"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2003.08.001"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/570738.570741"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.5555\/646975.711410"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01048276"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/100216.100249"}],"event":{"name":"SPAA08: 20th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Munich Germany","acronym":"SPAA08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378557","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1378533.1378557","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T14:57:53Z","timestamp":1750258673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1378533.1378557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,6,14]]},"references-count":34,"alternative-id":["10.1145\/1378533.1378557","10.1145\/1378533"],"URL":"https:\/\/doi.org\/10.1145\/1378533.1378557","relation":{},"subject":[],"published":{"date-parts":[[2008,6,14]]},"assertion":[{"value":"2008-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}