{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T22:26:48Z","timestamp":1747866408040},"reference-count":30,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Inf. & Syst."],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1587\/transinf.2021edp7104","type":"journal-article","created":{"date-parts":[[2022,2,28]],"date-time":"2022-02-28T22:24:56Z","timestamp":1646087096000},"page":"597-610","source":"Crossref","is-referenced-by-count":1,"title":["Fast Neighborhood Rendezvous"],"prefix":"10.1587","volume":"E105.D","author":[{"given":"Ryota","family":"EGUCHI","sequence":"first","affiliation":[{"name":"Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Naoki","family":"KITAMURA","sequence":"additional","affiliation":[{"name":"Nagoya Institute of Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taisuke","family":"IZUMI","sequence":"additional","affiliation":[{"name":"Osaka University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","doi-asserted-by":"crossref","unstructured":"[1] R. Eguchi, N. Kitamura, and T. Izumi, \u201cFast neighborhood rendezvous,\u201d 2020 IEEE 40th International Conference on Distributed Computing Systems (ICDCS), pp.168-178, 2020. 10.1109\/icdcs47774.2020.00030","DOI":"10.1109\/ICDCS47774.2020.00030"},{"key":"2","doi-asserted-by":"crossref","unstructured":"[2] E. Kranakis, N. Santoro, C. Sawchuk, and D. Krizanc, \u201cMobile agent rendezvous in a ring,\u201d Proceedings 23rd International Conference on Distributed Computing Systems, 2003, pp.592-599, IEEE, 2003. 10.1109\/icdcs.2003.1203510","DOI":"10.1109\/ICDCS.2003.1203510"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[3] P. Flocchini, E. Kranakis, D. Krizanc, N. Santoro, and C. Sawchuk, \u201cMultiple mobile agent rendezvous in a ring,\u201d Latin American Symposium on Theoretical Informatics, pp.599-608, Springer, 2004. 10.1007\/978-3-540-24698-5_62","DOI":"10.1007\/978-3-540-24698-5_62"},{"key":"4","doi-asserted-by":"publisher","unstructured":"[5] E.J. Anderson and R.R. Weber, \u201cThe rendezvous problem on discrete locations,\u201d Journal of Applied Probability, vol.27, no.4, pp.839-851, 1990. 10.2307\/3214827","DOI":"10.2307\/3214827"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[6] D. Peleg, \u201cDistributed computing: A locality-sensitive approach,\u201d Society for Industrial and Applied Mathematics, 2000. 10.1137\/1.9780898719772","DOI":"10.1137\/1.9780898719772"},{"key":"6","doi-asserted-by":"crossref","unstructured":"[7] A. Collins, J. Czyzowicz, L. G\u0105sieniec, A. Kosowski, and R. Martin, \u201cSynchronous rendezvous for location-aware agents,\u201d International Symposium on Distributed Computing, pp.447-459, Springer, 2011. 10.1007\/978-3-642-24100-0_42","DOI":"10.1007\/978-3-642-24100-0_42"},{"key":"7","doi-asserted-by":"publisher","unstructured":"[8] S. Das, D. Dereniowski, A. Kosowski, and P. Uzna\u0144ski, \u201cRendezvous of distance-aware mobile agents in unknown graphs,\u201d International Colloquium on Structural Information and Communication Complexity, pp.295-310, Springer, 2014. 10.1007\/978-3-319-09620-9_23","DOI":"10.1007\/978-3-319-09620-9_23"},{"key":"8","doi-asserted-by":"publisher","unstructured":"[9] A. Miller and A. Pelc, \u201cTradeoffs between cost and information for rendezvous and treasure hunt,\u201d Journal of Parallel and Distributed Computing, vol.83, pp.159-167, 2015. 10.1016\/j.jpdc.2015.06.004","DOI":"10.1016\/j.jpdc.2015.06.004"},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] D. Dereniowski and A. Pelc, \u201cDrawing maps with advice,\u201d Journal of Parallel and Distributed Computing, vol.72, no.2, pp.132-143, 2012. 10.1016\/j.jpdc.2011.10.004","DOI":"10.1016\/j.jpdc.2011.10.004"},{"key":"10","doi-asserted-by":"publisher","unstructured":"[11] A. Miller and A. Pelc, \u201cFast rendezvous with advice,\u201d Theoretical Computer Science, vol.608, pp.190-198, 2015. 10.1016\/j.tcs.2015.09.025","DOI":"10.1016\/j.tcs.2015.09.025"},{"key":"11","doi-asserted-by":"publisher","unstructured":"[12] D. Baba, T. Izumi, F. Ooshita, H. Kakugawa, and T. Masuzawa, \u201cLinear time and space gathering of anonymous mobile agents in asynchronous trees,\u201d Theoretical Computer Science, vol.478, pp.118-126, 2013. 10.1016\/j.tcs.2013.01.022","DOI":"10.1016\/j.tcs.2013.01.022"},{"key":"12","doi-asserted-by":"crossref","unstructured":"[13] J. Czyzowicz, A. Kosowski, and A. Pelc, \u201cTime versus space trade-offs for rendezvous in trees,\u201d Distributed Computing, vol.27, no.2, pp.95-109, 2014. 10.1007\/s00446-013-0201-4","DOI":"10.1007\/s00446-013-0201-4"},{"key":"13","doi-asserted-by":"publisher","unstructured":"[15] G. De Marco, L. Gargano, E. Kranakis, D. Krizanc, A. Pelc, and U. Vaccaro, \u201cAsynchronous deterministic rendezvous in graphs,\u201d Theoretical Computer Science, vol.355, no.3, pp.315-326, 2006. 10.1016\/j.tcs.2005.12.016","DOI":"10.1016\/j.tcs.2005.12.016"},{"key":"14","doi-asserted-by":"publisher","unstructured":"[16] J. Czyzowicz, A. Pelc, and A. Labourel, \u201cHow to meet asynchronously (almost) everywhere,\u201d ACM Transactions on Algorithms (TALG), vol.8, no.4, pp.1-14, 2012. 10.1145\/2344422.2344427","DOI":"10.1145\/2344422.2344427"},{"key":"15","doi-asserted-by":"crossref","unstructured":"[17] J. Czyzowicz, A. Kosowski, and A. Pelc, \u201cHow to meet when you forget: log-space rendezvous in arbitrary graphs,\u201d Distributed Computing, vol.25, no.2, pp.165-178, 2012. 10.1007\/s00446-011-0141-9","DOI":"10.1007\/s00446-011-0141-9"},{"key":"16","doi-asserted-by":"publisher","unstructured":"[18] S. Bouchard, Y. Dieudonn\u00e9, A. Pelc, and F. Petit, \u201cOn deterministic rendezvous at a node of agents with arbitrary velocities,\u201d Information Processing Letters, vol.133, pp.39-43, 2018. 10.1016\/j.ipl.2018.01.003","DOI":"10.1016\/j.ipl.2018.01.003"},{"key":"17","doi-asserted-by":"publisher","unstructured":"[19] A. Miller and A. Pelc, \u201cTime versus cost tradeoffs for deterministic rendezvous in networks,\u201d Distributed Computing, vol.29, no.1, pp.51-64, 2016. 10.1007\/s00446-015-0253-8","DOI":"10.1007\/s00446-015-0253-8"},{"key":"18","doi-asserted-by":"crossref","unstructured":"[20] P. Tetali and P. Winkler, \u201cOn a random walk problem arising in self-stabilizing token management,\u201d Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, PODC '91, New York, NY, USA, pp.273-280, ACM, 1991. 10.1145\/112600.112623","DOI":"10.1145\/112600.112623"},{"key":"19","doi-asserted-by":"publisher","unstructured":"[21] N.H. Bshouty, L. Higham, and J. Warpechowska-Gruca, \u201cMeeting times of random walks on graphs,\u201d Information Processing Letters, vol.69, no.5, pp.259-265, 1999. 10.1016\/s0020-0190(99)00017-4","DOI":"10.1016\/S0020-0190(99)00017-4"},{"key":"20","doi-asserted-by":"publisher","unstructured":"[22] S. Alpern, \u201cRendezvous search on labeled networks,\u201d Naval Research Logistics (NRL), vol.49, no.3, pp.256-274, 2002. 10.1002\/nav.10011","DOI":"10.1002\/nav.10011"},{"key":"21","doi-asserted-by":"crossref","unstructured":"[23] S. Abbas, M. Mosbah, and A. Zemmari, \u201cA probabilistic model for distributed merging of mobile agents,\u201d 2nd international workshop on verification and evaluation of computer and communication systems (VeCOS '08), 2008. 10.14236\/ewic\/vecos2008.16","DOI":"10.14236\/ewic\/VECOS2008.16"},{"key":"22","doi-asserted-by":"crossref","unstructured":"[24] X. Yu and M. Yung, \u201cAgent rendezvous: A dynamic symmetry-breaking problem,\u201d International Colloquium on Automata, Languages, and Programming, pp.610-621, Springer, 1996. 10.1007\/3-540-61440-0_163","DOI":"10.1007\/3-540-61440-0_163"},{"key":"23","doi-asserted-by":"publisher","unstructured":"[25] V. Dani, T.P. Hayes, C. Moore, and A. Russell, \u201cCodes, lower bounds, and phase transitions in the symmetric rendezvous problem,\u201d Random Structures & Algorithms, vol.49, no.4, pp.742-765, 2016. 10.1002\/rsa.20691","DOI":"10.1002\/rsa.20691"},{"key":"24","doi-asserted-by":"publisher","unstructured":"[26] R. Weber, \u201cOptimal symmetric rendezvous search on three locations,\u201d Mathematics of Operations Research, vol.37, no.1, pp.111-122, 2012. 10.1287\/moor.1110.0528","DOI":"10.1287\/moor.1110.0528"},{"key":"25","unstructured":"[27] S. Alpern and S. Gal, The theory of search games and rendezvous, International Series in Operations Research & Management Science, vol.55, Springer Science & Business Media, 2006."},{"key":"26","doi-asserted-by":"crossref","unstructured":"[28] S. Alpern, R. Fokkink, L. Gasieniec, R. Lindelauf, and V. Subrahmanian, \u201cSearch theory,\u201d Springer, 2013. 10.1007\/978-1-4614-6825-7","DOI":"10.1007\/978-1-4614-6825-7"},{"key":"27","doi-asserted-by":"crossref","unstructured":"[29] E. Kranakis, D. Krizanc, and S. Rajsbaum, \u201cMobile agent rendezvous: A survey,\u201d International Colloquium on Structural Information and Communication Complexity, pp.1-9, Springer, 2006. 10.1007\/11780823_1","DOI":"10.1007\/11780823_1"},{"key":"28","doi-asserted-by":"crossref","unstructured":"[30] A. Pelc, \u201cDeterministic rendezvous in networks: A comprehensive survey,\u201d Networks, vol.59, no.3, pp.331-347, 2012. 10.1002\/net.21453","DOI":"10.1002\/net.21453"},{"key":"29","doi-asserted-by":"publisher","unstructured":"[31] S. Alpern, \u201cRendezvous search: A personal perspective,\u201d Operations Research, vol.50, no.5, pp.772-795, 2002. 10.1287\/opre.50.5.772.363","DOI":"10.1287\/opre.50.5.772.363"},{"key":"30","doi-asserted-by":"crossref","unstructured":"[32] S. Das, \u201cGraph Explorations with Mobile Agents,\u201d Distributed Computing by Mobile Entities, Lecture Notes in Computer Science, pp.403-422, Springer International Publishing, Cham, 2019. 10.1007\/978-3-030-11072-7_16","DOI":"10.1007\/978-3-030-11072-7_16"}],"container-title":["IEICE Transactions on Information and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/3\/E105.D_2021EDP7104\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T14:07:08Z","timestamp":1726754828000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transinf\/E105.D\/3\/E105.D_2021EDP7104\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022]]}},"URL":"https:\/\/doi.org\/10.1587\/transinf.2021edp7104","relation":{},"ISSN":["0916-8532","1745-1361"],"issn-type":[{"type":"print","value":"0916-8532"},{"type":"electronic","value":"1745-1361"}],"subject":[],"published":{"date-parts":[[2022,3,1]]},"article-number":"2021EDP7104"}}