{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:43:39Z","timestamp":1725543819998},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354741"},{"type":"electronic","value":"9783540354758"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_5","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T14:45:59Z","timestamp":1151073959000},"page":"44-58","source":"Crossref","is-referenced-by-count":24,"title":["How to Meet in Anonymous Network"],"prefix":"10.1007","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Malinowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"901","DOI":"10.1007\/3-540-45465-9_77","volume-title":"Automata, Languages and Programming","author":"M. Adler","year":"2002","unstructured":"Adler, M., R\u00e4cke, H., Sivadasan, N., Sohler, C., V\u00f6cking, B.: Randomized pursuit-evasion in graphs. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol.\u00a02380, pp. 901\u2013912. Springer, Heidelberg (2002)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp, R.M., Lipton, R.J., Lov\u00e1sz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proc. 20th Annual Symposium on Foundations of Computer Science (FOCS 1979), pp. 218\u2013223 (1979)","DOI":"10.1109\/SFCS.1979.34"},{"key":"5_CR3","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1137\/S0363012993249195","volume":"33","author":"S. Alpern","year":"1995","unstructured":"Alpern, S.: The rendezvous search problem. SIAM J. on Control and Optimization\u00a033, 673\u2013683 (1995)","journal-title":"SIAM J. on Control and Optimization"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1002\/nav.10011","volume":"49","author":"S. Alpern","year":"2002","unstructured":"Alpern, S.: Rendezvous search on labelled networks. Naval Research Logistics\u00a049, 256\u2013274 (2002)","journal-title":"Naval Research Logistics"},{"key":"5_CR5","volume-title":"Int. Series in Operations research and Management Science","author":"S. Alpern","year":"2002","unstructured":"Alpern, S., Gal, S.: The theory of search games and rendezvous. In: Int. Series in Operations research and Management Science, Kluwer Academic Publisher, Dordrecht (2002)"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1239\/jap\/1032374243","volume":"36","author":"J. Alpern","year":"1999","unstructured":"Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. Journal of Applied Probability\u00a036, 223\u2013231 (1999)","journal-title":"Journal of Applied Probability"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"839","DOI":"10.2307\/3214827","volume":"28","author":"E. Anderson","year":"1990","unstructured":"Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability\u00a028, 839\u2013851 (1990)","journal-title":"Journal of Applied Probability"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. 14th Annual ACM Symp. on Computational Geometry (1998)","DOI":"10.1145\/276884.276925"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1287\/opre.49.1.107.11191","volume":"49","author":"E. Anderson","year":"2001","unstructured":"Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Oper. Research\u00a049, 107\u2013118 (2001)","journal-title":"Oper. Research"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"1880","DOI":"10.1137\/S0363012996314130","volume":"36","author":"V. Baston","year":"1998","unstructured":"Baston, V., Gal, S.: Rendezvous on the line when the players\u2019 initial distance is given by an unknown probability distribution. SIAM J. on Control and Optimization\u00a036, 1880\u20131889 (1998)","journal-title":"SIAM J. on Control and Optimization"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1002\/nav.1044","volume":"48","author":"V. Baston","year":"2001","unstructured":"Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Reaserch Logistics\u00a048, 722\u2013731 (2001)","journal-title":"Naval Reaserch Logistics"},{"issue":"5","key":"5_CR12","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1016\/S0020-0190(99)00017-4","volume":"69","author":"N.H. Bshouty","year":"1999","unstructured":"Bshouty, N.H., Higham, L., Warpechowska-Gruca, J.: Meeting times of random walks on graphs. Information Processing Letters\u00a069(5), 259\u2013265 (1999)","journal-title":"Information Processing Letters"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/3-540-45061-0_90","volume-title":"Automata, Languages and Programming","author":"M. Cielibak","year":"2003","unstructured":"Cielibak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the robots gathering problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1181\u20131196. Springer, Heidelberg (2003)"},{"issue":"5","key":"5_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-6774(87)90018-6","volume":"8","author":"S.A. Cook","year":"1987","unstructured":"Cook, S.A., McKenzie, P.: Problems complete for deterministic logarithmic space. Journal of Algorithms\u00a08(5), 385\u2013394 (1987)","journal-title":"Journal of Algorithms"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Doyle, P., Raghavan, P., Snir, M.: Random walks on weighted graphs, and applications to on-line algorithms. In: Proc. 22nd Annual ACM Symp. on Theory of Computing (STOC 1990), pp. 369\u2013378 (1990)","DOI":"10.1145\/100216.100266"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1137\/0406029","volume":"6","author":"D. Coppersmith","year":"1993","unstructured":"Coppersmith, D., Tetali, P., Winkler, P.: Collisions among random walks on a graph. SIAM J. on Discrete Math.\u00a06, 363\u2013374 (1993)","journal-title":"SIAM J. on Discrete Math."},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/11549345_24","volume-title":"Mathematical Foundations of Computer Science 2005","author":"G. Marco De","year":"2005","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous\u00a0deterministic\u00a0rendezvous in\u00a0graphs. In: Jedrzejowicz, J., Szepietowski, A. (eds.) MFCS 2005. LNCS, vol.\u00a03618, pp. 271\u2013282. Springer, Heidelberg (2005)"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-540-39658-1_19","volume-title":"Algorithms - ESA 2003","author":"A. Dessmark","year":"2003","unstructured":"Dessmark, A., Fraigniaud, P., Pelc, A.: Deterministic rendezvous in graphs. In: Di Battista, G., Zwick, U. (eds.) ESA 2003. LNCS, vol.\u00a02832, pp. 184\u2013195. Springer, Heidelberg (2003)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/3-540-44693-1_22","volume-title":"STACS 2001","author":"P. Flocchini","year":"2001","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 247\u2013258. Springer, Heidelberg (2001)"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1287\/opre.47.6.974","volume":"47","author":"S. Gal","year":"1999","unstructured":"Gal, S.: endezvous search on the line. Operations Research\u00a047, 974\u2013976 (1999)","journal-title":"Operations Research"},{"key":"5_CR21","doi-asserted-by":"crossref","unstructured":"Israeli, A., Jalfon, M.: Token management schemes and random walks yield self stabilizing mutual exclusion. In: Proc. 9th ACM Symp. on Principles of Distributed Computing (PODC 1990), pp. 119\u2013131 (1990)","DOI":"10.1145\/93385.93409"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-540-30551-4_56","volume-title":"Algorithms and Computation","author":"D. Kowalski","year":"2004","unstructured":"Kowalski, D., Pelc, A.: Polynomial deterministic rendezvous in arbitrary graphs. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol.\u00a03341, pp. 644\u2013656. Springer, Heidelberg (2004)"},{"key":"5_CR23","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Mobile agent rendezvous in a ring. In: Proc. 23rd Int. Conference on Distributed Computing Systems (ICDCS 2003), pp. 592\u2013599 (2003)","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"1650","DOI":"10.1137\/S036301299427816X","volume":"34","author":"W. Lim","year":"1996","unstructured":"Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. on Control and Optimization\u00a034, 1650\u20131665 (1996)","journal-title":"SIAM J. on Control and Optimization"},{"key":"5_CR25","unstructured":"Mayer, A.J., Ostrovsky, R., Yung, M.: Self-stabilizing algorithms for synchronous unidirectional rings. In: Proc. 7th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1996), pp. 564\u2013573 (1996)"},{"key":"5_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"Motwani","year":"1995","unstructured":"Motwani, Raghawan: Randomized Algorithms. Cambridge University Press, Cambridge (1995)"},{"key":"5_CR27","volume-title":"The strategy of conflict","author":"T. Schelling","year":"1960","unstructured":"Schelling, T.: The strategy of conflict. Oxford University Press, Oxford (1960)"},{"key":"5_CR28","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1057\/jors.1992.89","volume":"43","author":"L. Thomas","year":"1992","unstructured":"Thomas, L.: Finding your kids when they are lost. Journal on Operational Res. Soc.\u00a043, 637\u2013639 (1992)","journal-title":"Journal on Operational Res. Soc."},{"key":"5_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/3-540-61440-0_163","volume-title":"Automata, Languages and Programming","author":"X. Yu","year":"1996","unstructured":"Yu, X., Yung, M.: Agent rendezvous: a dynamic symmetry-breaking problem. In: Meyer auf der Heide, F., Monien, B. (eds.) ICALP 1996. LNCS, vol.\u00a01099, pp. 610\u2013621. Springer, Heidelberg (1996)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:16Z","timestamp":1619507836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/11780823_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}