{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T05:38:13Z","timestamp":1791092293075,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642108761","type":"print"},{"value":"9783642108778","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10877-8_27","type":"book-chapter","created":{"date-parts":[[2009,12,2]],"date-time":"2009-12-02T02:11:04Z","timestamp":1259719864000},"page":"345-358","source":"Crossref","is-referenced-by-count":5,"title":["Robustness of the Rotor-router Mechanism"],"prefix":"10.1007","author":[{"given":"Evangelos","family":"Bampas","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ralf","family":"Klasing","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Kosowski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tomasz","family":"Radzik","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"27_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.2001.3081","volume":"176","author":"M.A. Bender","year":"2002","unstructured":"Bender, M.A., Fern\u00e1ndez, A., Ron, D., Sahai, A., Vadhan, S.P.: The power of a pebble: Exploring and mapping directed graphs. Inf. Comput.\u00a0176(1), 1\u201321 (2002)","journal-title":"Inf. Comput."},{"issue":"2","key":"27_CR2","doi-asserted-by":"crossref","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":"27_CR3","first-page":"203","volume":"28","author":"N.G. Bruijn de","year":"1951","unstructured":"de Bruijn, N.G., Aardenne-Ehrenfest, T.: Circuits and trees in oriented linear graphs. Simon Stevin (Bull. Belgian Math. Soc.)\u00a028, 203\u2013217 (1951)","journal-title":"Simon Stevin (Bull. Belgian Math. Soc.)"},{"key":"27_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/978-3-642-02930-1_34","volume-title":"ICALP 2009","author":"C. Cooper","year":"2009","unstructured":"Cooper, C., Ilcinkas, D., Klasing, R., Kosowski, A.: Derandomizing random walks in undirected graphs using locally fair exploration strategies. In: Albers, S., et al. (eds.) ICALP 2009. LNCS, vol.\u00a05556, pp. 411\u2013422. Springer, Heidelberg (2009)"},{"issue":"6","key":"27_CR5","doi-asserted-by":"publisher","first-page":"815","DOI":"10.1017\/S0963548306007565","volume":"15","author":"J.N. Cooper","year":"2006","unstructured":"Cooper, J.N., Spencer, J.: Simulating a random walk with constant error. Combinatorics, Probability & Computing\u00a015(6), 815\u2013822 (2006)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"3","key":"27_CR6","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1002\/(SICI)1097-0118(199911)32:3<265::AID-JGT6>3.0.CO;2-8","volume":"32","author":"X. Deng","year":"1999","unstructured":"Deng, X., Papadimitriou, C.H.: Exploring an unknown graph. Journal of Graph Theory\u00a032(3), 265\u2013297 (1999)","journal-title":"Journal of Graph Theory"},{"issue":"1-2","key":"27_CR7","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 & Computing\u00a018(1-2), 123\u2013144 (2009)","journal-title":"Combinatorics, Probability & Computing"},{"issue":"2-3","key":"27_CR8","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.tcs.2005.07.014","volume":"345","author":"P. Fraigniaud","year":"2005","unstructured":"Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science\u00a0345(2-3), 331\u2013344 (2005)","journal-title":"Theoretical Computer Science"},{"key":"27_CR9","unstructured":"G\u0105sieniec, L., Pelc, A., Radzik, T., Zhang, X.: Tree exploration with logarithmic memory. In: Proceedings 19th ACM-SIAM Symposium on Discrete Algorithms, SODA 2007, pp. 585\u2013594 (2007)"},{"key":"27_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-540-92248-3_2","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"L. G\u0105sieniec","year":"2008","unstructured":"G\u0105sieniec, L., Radzik, T.: Memory efficient anonymous graph exploration. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 14\u201329. Springer, Heidelberg (2008)"},{"issue":"25","key":"27_CR11","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":"27_CR12","doi-asserted-by":"crossref","unstructured":"Reingold, O.: Undirected connectivity in log-space. J. ACM\u00a055(4) (2008)","DOI":"10.1145\/1391289.1391291"},{"issue":"4","key":"27_CR13","doi-asserted-by":"publisher","first-page":"233","DOI":"10.2307\/2302716","volume":"48","author":"W.T. Tutte","year":"1941","unstructured":"Tutte, W.T., Smith, C.A.B.: On unicursal paths in a network of degree 4. The American Mathematical Monthly\u00a048(4), 233\u2013237 (1941)","journal-title":"The American Mathematical Monthly"},{"key":"27_CR14","unstructured":"Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Smell as a computational resource - a lesson we can learn from the ant. In: Proc. 4th Israel Symposium on Theory of Computing and Systems, ISTCS 1996, pp. 219\u2013230 (1996)"},{"key":"27_CR15","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 Transactions on Robotics and Automation\u00a015, 918\u2013933 (1999)","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"3","key":"27_CR16","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","Principles of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10877-8_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T12:55:41Z","timestamp":1558270541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10877-8_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642108761","9783642108778"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10877-8_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}