{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:24:52Z","timestamp":1743049492037,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910808"},{"type":"electronic","value":"9783030910815"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91081-5_7","type":"book-chapter","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T21:03:40Z","timestamp":1636405420000},"page":"90-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How Do Mobile Agents Benefit from\u00a0Randomness?"],"prefix":"10.1007","author":[{"given":"Pierre","family":"Fraigniaud","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,9]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Avin, C., Cohen, A., Fraigniaud, P., Lotker, Z., Peleg, D.: Preferential attachment as a unique equilibrium. In: 27th ACM Conference on World Wide Web (WWW), pp. 559\u2013568 (2018)","DOI":"10.1145\/3178876.3186122"},{"issue":"6","key":"7_CR2","doi-asserted-by":"publisher","first-page":"e1006195","DOI":"10.1371\/journal.pcbi.1006195","volume":"14","author":"L Boczkowski","year":"2018","unstructured":"Boczkowski, L., Natale, E., Feinerman, O., Korman, A.: Limits on reliable information flows through stochastic populations. PLoS Comput. Biol. 14(6), e1006195 (2018)","journal-title":"PLoS Comput. Biol."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-70575-8_12","volume-title":"Automata, Languages and Programming","author":"A Chaintreau","year":"2008","unstructured":"Chaintreau, A., Fraigniaud, P., Lebhar, E.: Networks become navigable as nodes move and forget. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 133\u2013144. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_12"},{"issue":"3","key":"7_CR4","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1137\/0209048","volume":"9","author":"SA Cook","year":"1980","unstructured":"Cook, S.A., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM J. Comput. 9(3), 636\u2013652 (1980)","journal-title":"SIAM J. Comput."},{"key":"7_CR5","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.tcs.2015.05.054","volume":"608","author":"Y Emek","year":"2015","unstructured":"Emek, Y., Langner, T., Stolz, D., Uitto, J., Wattenhofer, R.: How many ants does it take to find the food? Theor. Comput. Sci. 608, 255\u2013267 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-662-43951-7_40","volume-title":"Automata, Languages, and Programming","author":"Y Emek","year":"2014","unstructured":"Emek, Y., Langner, T., Uitto, J., Wattenhofer, R.: Solving the ANTS problem with asynchronous finite state machines. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8573, pp. 471\u2013482. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43951-7_40"},{"issue":"3","key":"7_CR7","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00446-016-0285-8","volume":"30","author":"O Feinerman","year":"2016","unstructured":"Feinerman, O., Korman, A.: The ANTS problem. Distrib. Comput. 30(3), 149\u2013168 (2016). https:\/\/doi.org\/10.1007\/s00446-016-0285-8","journal-title":"Distrib. Comput."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Gelblum, A., Fonio, E., Rodeh, Y., Korman, A., Feinerman, O.: Ant collective cognition allows for efficient navigation through disordered environments. eLife 9(e55195) (2020)","DOI":"10.7554\/eLife.55195"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Musco, C., Radeva, T., Lynch, N.A.: Distributed house-hunting in ant colonies. In: 34th ACM Symposium on Principles of Distributed Computing (PODC), pp. 57\u201366 (2015)","DOI":"10.1145\/2767386.2767426"},{"key":"7_CR10","unstructured":"Guinard, B., Korman, A.: Tight bounds for the cover times of random walks with heterogeneous step lengths. In: 37th International Symposium on Theoretical Aspects of Computer Science (STACS), pp. 28:1\u201328:14 (2020)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/978-3-662-45174-8_3","volume-title":"Distributed Computing","author":"T Langner","year":"2014","unstructured":"Langner, T., Uitto, J., Stolz, D., Wattenhofer, R.: Fault-tolerant ANTS. In: Kuhn, F. (ed.) DISC 2014. LNCS, vol. 8784, pp. 31\u201345. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-45174-8_3"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s00446-016-0283-x","volume":"30","author":"C Lenzen","year":"2016","unstructured":"Lenzen, C., Lynch, N., Newport, C., Radeva, T.: Searching without communicating: tradeoffs between performance and selection complexity. Distrib. Comput. 30(3), 169\u2013191 (2016). https:\/\/doi.org\/10.1007\/s00446-016-0283-x","journal-title":"Distrib. Comput."},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Musco, C., Su, H., Lynch, N.A.: Ant-inspired density estimation via random walks. In: 35th ACM Symposium on Principles of Distributed Computing (PODC), pp. 469\u2013478 (2016)","DOI":"10.1145\/2933057.2933106"},{"issue":"12","key":"7_CR14","doi-asserted-by":"publisher","first-page":"e1005904","DOI":"10.1371\/journal.pcbi.1005904","volume":"13","author":"T Radeva","year":"2017","unstructured":"Radeva, T., Dornhaus, A.R., Lynch, N.A., Nagpal, R., Su, H.: Costs of task allocation with local feedback: effects of colony size and extra workers in social insects and other multi-agent systems. PLoS Comput. Biol. 13(12), e1005904 (2017)","journal-title":"PLoS Comput. Biol."},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"bio030106","DOI":"10.1242\/bio.030106","volume":"7","author":"AM Reynolds","year":"2018","unstructured":"Reynolds, A.M.: Current status and future directions of L\u00e9vy walk research. Biol. Open 7(1), bio030106 (2018)","journal-title":"Biol. Open"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91081-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T15:39:34Z","timestamp":1710257974000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91081-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910808","9783030910815"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91081-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"9 November 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cse.chalmers.se\/~elad\/SSS2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"56","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}