{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T05:40:45Z","timestamp":1787204445135,"version":"build-2736575974"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T00:00:00Z","timestamp":1515024000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Science and Engineering Research Board, Department of Science and Technology, Government of India","award":["EMR\/2016\/003016"],"award-info":[{"award-number":["EMR\/2016\/003016"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,1,4]]},"DOI":"10.1145\/3154273.3154293","type":"proceedings-article","created":{"date-parts":[[2018,1,12]],"date-time":"2018-01-12T13:49:57Z","timestamp":1515764997000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":53,"title":["Dispersion of Mobile Robots"],"prefix":"10.1145","author":[{"given":"John","family":"Augustine","sequence":"first","affiliation":[{"name":"Department of Computer Science & Engineering, Indian Institute of Technology Madras, Chennai, Tamil Nadu"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"suffix":"Jr.","given":"William K.","family":"Moses","sequence":"additional","affiliation":[{"name":"Department of Computer Science & Engineering, Indian Institute of Technology Madras, Chennai, Tamil Nadu"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154273.3154294"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921659.1921663"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3154273.3154293"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008295"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2014.04.027"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.05.005"},{"key":"e_1_3_2_1_7_1","unstructured":"Hans Leo Bodlaender and Jan van Leeuwen. 1986. Distribution of Records on a Ring of Processors. Department of Computer Science University of Utrecht.  Hans Leo Bodlaender and Jan van Leeuwen. 1986. Distribution of Records on a Ring of Processors. Department of Computer Science University of Utrecht."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2121170"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICARCV.2014.7064607"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1383369.1383373"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90021-X"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2014.12.005"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/545381.545459"},{"key":"e_1_3_2_1_14_1","unstructured":"Yann Disser Frank Mousset Andreas Noever Nemanja \u0160kori\u0107 and Angelika Steger. 2016. A general lower bound for collaborative tree exploration. arXiv preprint arXiv:1610.01753 (2016).  Yann Disser Frank Mousset Andreas Noever Nemanja \u0160kori\u0107 and Angelika Steger. 2016. A general lower bound for collaborative tree exploration. arXiv preprint arXiv:1610.01753 (2016)."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11821069_29"},{"key":"e_1_3_2_1_16_1","volume-title":"International Colloquium on Structural Information and Communication Complexity","author":"Dynia Miroslaw"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.11.023"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.v48:3"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-012-9571-y"},{"key":"e_1_3_2_1_20_1","unstructured":"Artur Menc Dominik Pajak and Przemyslaw Uznanski. 2015. On the power of one bit: How to explore a graph when you cannot backtrack? arXiv preprint (2015).  Artur Menc Dominik Pajak and Przemyslaw Uznanski. 2015. On the power of one bit: How to explore a graph when you cannot backtrack? arXiv preprint (2015)."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"crossref","unstructured":"S Muthukrishnan Bhaskar Ghosh and Martin H Schultz. 1998. First-and second-order diffusive methods for rapid coarse distributed load balancing. Theory of computing systems 31 4 (1998) 331--354.  S Muthukrishnan Bhaskar Ghosh and Martin H Schultz. 1998. First-and second-order diffusive methods for rapid coarse distributed load balancing. Theory of computing systems 31 4 (1998) 331--354.","DOI":"10.1007\/s002240000092"},{"key":"e_1_3_2_1_22_1","volume-title":"International Colloquium on Structural Information and Communication Complexity","author":"Ortolf Christian"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(89)90006-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2012.86"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2933057.2933093"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/181014.181361"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E98.A.2117"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90021-E"}],"event":{"name":"ICDCN '18: 19th International Conference on Distributed Computing and Networking","location":"Varanasi India","acronym":"ICDCN '18","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing","SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 19th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154293","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3154273.3154293","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:20Z","timestamp":1750212680000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3154273.3154293"}},"subtitle":["A Study of Memory-Time Trade-offs"],"short-title":[],"issued":{"date-parts":[[2018,1,4]]},"references-count":28,"alternative-id":["10.1145\/3154273.3154293","10.1145\/3154273"],"URL":"https:\/\/doi.org\/10.1145\/3154273.3154293","relation":{},"subject":[],"published":{"date-parts":[[2018,1,4]]},"assertion":[{"value":"2018-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}