{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:34:29Z","timestamp":1725834869839},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319252575"},{"type":"electronic","value":"9783319252582"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25258-2_31","type":"book-chapter","created":{"date-parts":[[2015,10,19]],"date-time":"2015-10-19T03:10:18Z","timestamp":1445224218000},"page":"444-458","source":"Crossref","is-referenced-by-count":0,"title":["Coalescing Walks on Rotor-Router Systems"],"prefix":"10.1007","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicol\u00e1s","family":"Rivera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeharu","family":"Shiraga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,20]]},"reference":[{"key":"31_CR1","unstructured":"Aldous, D., Fill, J.A.: Reversible markov chains and random walks on graphs 2002. Unfinished monograph, recompiled (2014). \n                    \n                      http:\/\/www.stat.berkeley.edu\/~aldous\/RWG\/book.html"},{"issue":"2","key":"31_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0304-4149(91)90090-Y","volume":"38","author":"D.J. Aldous","year":"1991","unstructured":"Aldous, D.J.: Meeting times for independent markov chains. Stochastic Processes and their Applications\u00a038(2), 185\u2013193 (1991)","journal-title":"Stochastic Processes and their Applications"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Avin, C., Koucky, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. In: Proc. 20th Annual Symposium on Parallelism in Algorithms and Architectures, SPAA 2008, pp. 119\u2013128. ACM (2008)","DOI":"10.1145\/1378533.1378557"},{"key":"31_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-04355-0_44","volume-title":"Distributed Computing","author":"E. Bampas","year":"2009","unstructured":"Bampas, E., G\u0105sieniec, L., Hanusse, N., Ilcinkas, D., Klasing, R., Kosowski, A.: Euler tour lock-in problem in the rotor-router model. In: Keidar, I. (ed.) DISC 2009. LNCS, vol.\u00a05805, pp. 423\u2013435. Springer, Heidelberg (2009)"},{"key":"31_CR5","series-title":"LNCS","first-page":"345","volume-title":"OPODIS 2009","author":"E. Bampas","year":"2009","unstructured":"Bampas, E., Gasieniec, L., Klasing, R., Kosowski, A., Radzik, T.: Robustness of the rotor-router mechanism. In: Abdelzaher, T., Raynal, M., Santoro, N. (eds.) OPODIS 2009. LNCS, vol.\u00a05923, pp. 345\u2013358. Springer, Heidelberg (2009)"},{"issue":"2","key":"31_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.7155\/jgaa.00049","volume":"6","author":"S.N. Bhatt","year":"2002","unstructured":"Bhatt, S.N., Even, S., Greenberg, D.S., Tayar, R.: Traversing directed eulerian mazes. J. Graph Algorithms Appl.\u00a06(2), 157\u2013173 (2002)","journal-title":"J. Graph Algorithms Appl."},{"key":"31_CR7","unstructured":"Chalopin, J., Das, S., Gawrychowski, P., Kosowski, A., Labourel, A., Uznanski, P.: Lock-in problem for parallel rotor-router walks. CoRR, abs\/1407.3200 (2014)"},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"1748","DOI":"10.1137\/120900368","volume":"27","author":"C. Cooper","year":"2013","unstructured":"Cooper, C., Els\u00e4sser, R., Ono, H., Radzik, T.: Coalescing random walks and voting on connected graphs. SIAM J. Discrete Math.\u00a027(4), 1748\u20131758 (2013)","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"31_CR9","doi-asserted-by":"publisher","first-page":"1738","DOI":"10.1137\/080729542","volume":"23","author":"C. Cooper","year":"2009","unstructured":"Cooper, C., Frieze, A.M., Radzik, T.: Multiple random walks in random regular graphs. SIAM J. Discrete Math.\u00a023(4), 1738\u20131761 (2009)","journal-title":"SIAM J. Discrete Math."},{"key":"31_CR10","unstructured":"Dereniowski, D., Kosowski, A., Pajak, D., Uznanski, P.: Bounds on the cover time of parallel rotor walks. In: 31st International Symposium on Theoretical Aspects of Computer Science, STACS 2014, pp. 263\u2013275 (2014)"},{"key":"31_CR11","doi-asserted-by":"crossref","unstructured":"Efremenko, K., Reingold, O.: How well do random walks parallelize? In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 476\u2013489. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-03685-9_36"},{"issue":"24","key":"31_CR12","doi-asserted-by":"publisher","first-page":"2623","DOI":"10.1016\/j.tcs.2010.08.010","volume":"412","author":"R. Els\u00e4sser","year":"2011","unstructured":"Els\u00e4sser, R., Sauerwald, T.: Tight bounds for the cover time of multiple random walks. Theor. Comput. Sci.\u00a0412(24), 2623\u20132641 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self-stabilizing mutual exclusion. In: Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, PODC 1990, pp. 119\u2013131. ACM (1990)","DOI":"10.1145\/93385.93409"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/978-3-662-43951-7_46","volume-title":"Automata, Languages, and Programming","author":"A. Kosowski","year":"2014","unstructured":"Kosowski, A., Paj\u0105k, D.: Does adding more agents make a difference? A case study of cover time for the rotor-router. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014, Part II. LNCS, vol.\u00a08573, pp. 544\u2013555. Springer, Heidelberg (2014)"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz, L., Plummer, D.: Matching Theory. AMS Chelsea Publishing Series. American Mathematical Soc. (2009)","DOI":"10.1090\/chel\/367"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"2109","DOI":"10.1090\/S0002-9947-2011-05523-6","volume":"364","author":"R. Oliveira","year":"2012","unstructured":"Oliveira, R.: On the coalescence time of reversible random walks. Trans. Amer. Math. Soc.\u00a0364, 2109\u20132128 (2012)","journal-title":"Trans. Amer. Math. Soc."},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"5079","DOI":"10.1103\/PhysRevLett.77.5079","volume":"77","author":"V.B. Priezzhev","year":"1996","unstructured":"Priezzhev, V.B., Dhar, D., Dhar, A., Krishnamurthy, S.: Eulerian walkers as a model of self-organized criticality. Phys. Rev. Lett.\u00a077, 5079\u20135082 (1996)","journal-title":"Phys. Rev. Lett."},{"key":"31_CR18","unstructured":"Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Smell as a computational resource - A lesson we can learn from the ant. In: ISTCS, pp. 219\u2013230 (1996)"},{"issue":"5","key":"31_CR19","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1109\/70.795795","volume":"15","author":"I.A. Wagner","year":"1999","unstructured":"Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Distributed covering by ant-robots using evaporating traces. IEEE T. Robotics and Automation\u00a015(5), 918\u2013933 (1999)","journal-title":"IEEE T. Robotics and Automation"},{"issue":"3","key":"31_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00453-003-1030-9","volume":"37","author":"V. Yanovski","year":"2003","unstructured":"Yanovski, V., Wagner, I.A., Bruckstein, A.M.: A distributed ant algorithm for efficiently patrolling a network. Algorithmica\u00a037(3), 165\u2013186 (2003)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25258-2_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T03:41:50Z","timestamp":1559274110000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25258-2_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319252575","9783319252582"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25258-2_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}