{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:49Z","timestamp":1759639069598,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_46","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T08:37:49Z","timestamp":1402475869000},"page":"544-555","source":"Crossref","is-referenced-by-count":9,"title":["Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Kosowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dominik","family":"Paj\u0105k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"46_CR1","doi-asserted-by":"crossref","unstructured":"Akbari, H., Berenbrink, P.: Parallel rotor walks on finite graphs and applications in discrete load balancing. In: SPAA, pp. 186\u2013195 (2013)","DOI":"10.1145\/2486159.2486178"},{"key":"46_CR2","unstructured":"Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs (2001), http:\/\/stat-www.berkeley.edu\/users\/aldous\/RWG\/book.html"},{"issue":"4","key":"46_CR3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1017\/S0963548311000125","volume":"20","author":"N. Alon","year":"2011","unstructured":"Alon, N., Avin, C., Kouck\u00fd, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. Combinatorics, Probability & Computing\u00a020(4), 481\u2013502 (2011)","journal-title":"Combinatorics, Probability & Computing"},{"key":"46_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":"46_CR5","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Cooper, C., Friedetzky, T., Friedrich, T., Sauerwald, T.: Randomized diffusion for indivisible loads. In: Randall, D. (ed.) SODA, pp. 429\u2013439. SIAM (2011)","DOI":"10.1137\/1.9781611973082.34"},{"issue":"8","key":"46_CR6","doi-asserted-by":"publisher","first-page":"2072","DOI":"10.1016\/j.ejc.2007.04.018","volume":"28","author":"J.N. Cooper","year":"2007","unstructured":"Cooper, J.N., Doerr, B., Spencer, J.H., Tardos, G.: Deterministic random walks on the integers. Eur. J. Comb.\u00a028(8), 2072\u20132090 (2007)","journal-title":"Eur. J. Comb."},{"key":"46_CR7","unstructured":"Dereniowski, D., Kosowski, A., Pajak, D., Uznanski, P.: Bounds on the cover time of parallel rotor walks. In: Mayr, E.W., Portier, N. (eds.) STACS. LIPIcs, vol.\u00a025, pp. 263\u2013275. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2014)"},{"issue":"1-2","key":"46_CR8","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1017\/S0963548308009589","volume":"18","author":"B. Doerr","year":"2009","unstructured":"Doerr, B., Friedrich, T.: Deterministic random walks on the two-dimensional grid. Combinatorics, Probability, and Computing\u00a018(1-2), 123\u2013144 (2009)","journal-title":"Combinatorics, Probability, and Computing"},{"key":"46_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-03685-9_36","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Efremenko","year":"2009","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)"},{"key":"46_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/978-3-642-02927-1_35","volume-title":"Automata, Languages and Programming","author":"R. Els\u00e4sser","year":"2009","unstructured":"Els\u00e4sser, R., Sauerwald, T.: Tight bounds for the cover time of multiple random walks. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 415\u2013426. Springer, Heidelberg (2009)"},{"issue":"24","key":"46_CR11","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."},{"issue":"4","key":"46_CR12","doi-asserted-by":"publisher","first-page":"747","DOI":"10.1137\/100799216","volume":"41","author":"T. Friedrich","year":"2012","unstructured":"Friedrich, T., Gairing, M., Sauerwald, T.: Quasirandom load balancing. SIAM J. Comput.\u00a041(4), 747\u2013771 (2012)","journal-title":"SIAM J. Comput."},{"key":"46_CR13","doi-asserted-by":"crossref","unstructured":"Kijima, S., Koga, K., Makino, K.: Deterministic random walks on finite graphs. In: Martinez, C., Hwang, H.-K. (eds.) ANALCO, pp. 18\u201327. SIAM (2012)","DOI":"10.1137\/1.9781611973020.3"},{"key":"46_CR14","doi-asserted-by":"crossref","unstructured":"Klasing, R., Kosowski, A., Pajak, D., Sauerwald, T.: The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks. In: PODC, pp. 365\u2013374 (2013)","DOI":"10.1145\/2484239.2484260"},{"key":"46_CR15","unstructured":"Levin, D.A., Peres, Y., Wilmer, E.L.: Markov chains and mixing times. American Mathematical Society (2006)"},{"issue":"25","key":"46_CR16","doi-asserted-by":"publisher","first-page":"5079","DOI":"10.1103\/PhysRevLett.77.5079","volume":"77","author":"V. Priezzhev","year":"1996","unstructured":"Priezzhev, V., Dhar, D., Dhar, A., Krishnamurthy, S.: Eulerian walkers as a model of self-organized criticality. Phys. Rev. Lett.\u00a077(25), 5079\u20135082 (1996)","journal-title":"Phys. Rev. Lett."},{"key":"46_CR17","doi-asserted-by":"crossref","unstructured":"Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of markov chains and the analysis of iterative load balancing schemes. In: FOCS, pp. 694\u2013705. IEEE Computer Society (1998)","DOI":"10.1109\/SFCS.1998.743520"},{"key":"46_CR18","unstructured":"Uznanski, P.: Personal communication (2014)"},{"issue":"3","key":"46_CR19","doi-asserted-by":"crossref","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","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T09:23:34Z","timestamp":1746264214000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}