{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:08Z","timestamp":1742913548256,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030549206"},{"type":"electronic","value":"9783030549213"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-54921-3_3","type":"book-chapter","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T11:04:28Z","timestamp":1596020668000},"page":"47-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["ANTS on a Plane"],"prefix":"10.1007","author":[{"given":"Abhinav","family":"Aggarwal","sequence":"first","affiliation":[]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"Barchyn, T.E., Hugenholtz, C.H., Fox, T.A.: Plume detection modeling of a drone-based natural gas leak detection system. Elem. Sci. Anthropocene 7(1) (2019)","DOI":"10.1525\/elementa.379"},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1093\/beheco\/arp041","volume":"20","author":"BD Beverly","year":"2009","unstructured":"Beverly, B.D., McLendon, H., Nacu, S., Holmes, S., Gordon, D.M.: How site fidelity leads to individual differences in the foraging activity of harvester ants. Behav. Ecol. 20(3), 633\u2013638 (2009)","journal-title":"Behav. Ecol."},{"issue":"6","key":"3_CR3","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":"3_CR4","doi-asserted-by":"crossref","unstructured":"Collet, S., Korman, A.: Intense competition can drive selfish explorers to optimize coverage. In: Symposium on Parallelism in Algorithms and Architectures (SPAA) (2018)","DOI":"10.1145\/3210377.3210405"},{"key":"3_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274","volume-title":"Concentration of Measure for the Analysis of Randomized Algorithms","author":"DP Dubhashi","year":"2009","unstructured":"Dubhashi, D.P., Panconesi, A.: Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge University Press, Cambridge (2009)"},{"key":"3_CR6","doi-asserted-by":"publisher","DOI":"10.1142\/3595","volume-title":"The Golden Ratio and Fibonacci Numbers","author":"RA Dunlap","year":"1997","unstructured":"Dunlap, R.A.: The Golden Ratio and Fibonacci Numbers. World Scientific, Singapore (1997)"},{"key":"3_CR7","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? Theoret. Comput. Sci. 608, 255\u2013267 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"3_CR8","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"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-33651-5_5","volume-title":"Distributed Computing","author":"O Feinerman","year":"2012","unstructured":"Feinerman, O., Korman, A.: Memory lower bounds for randomized collaborative search and implications for biology. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol. 7611, pp. 61\u201375. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33651-5_5"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/s00446-016-0285-8","volume":"30","author":"O Feinerman","year":"2017","unstructured":"Feinerman, O., Korman, A.: The ANTS problem. Distrib. Comput. 30(3), 149\u2013168 (2017)","journal-title":"Distrib. Comput."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Feinerman, O., Korman, A., Lotker, Z., Sereni, J.S.: Collaborative search on the plane without communication. In: Proceedings of the 2012 ACM Symposium on Principles of Distributed Computing (PODC), pp. 77\u201386. ACM (2012)","DOI":"10.1145\/2332432.2332444"},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"ML Fredman","year":"1987","unstructured":"Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. J. ACM (JACM) 34(3), 596\u2013615 (1987)","journal-title":"J. ACM (JACM)"},{"key":"3_CR13","volume-title":"Ants at Work: How an Insect Society is Organized","author":"DM Gordon","year":"1999","unstructured":"Gordon, D.M.: Ants at Work: How an Insect Society is Organized. Simon and Schuster, New York (1999)"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Hecker, J.P., Carmichael, J.C., Moses, M.E.: Exploiting clusters for complete resource collection in biologically-inspired robot swarms. In: International Conference on Intelligent Robots and Systems IROS, pp. 434\u2013440 (2015)","DOI":"10.1109\/IROS.2015.7353409"},{"issue":"8","key":"3_CR15","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1109\/TAC.1984.1103619","volume":"29","author":"A Itai","year":"1984","unstructured":"Itai, A., Rosberg, Z.: A golden ratio control policy for a multiple-access channel. IEEE Trans. Autom. Control 29(8), 712\u2013718 (1984)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1\u20134","key":"3_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10462-009-9127-4","volume":"31","author":"D Karaboga","year":"2009","unstructured":"Karaboga, D., Akay, B.: A survey: algorithms simulating bee swarm intelligence. Artif. Intell. Rev. 31(1\u20134), 61\u201385 (2009)","journal-title":"Artif. Intell. Rev."},{"key":"3_CR17","doi-asserted-by":"crossref","unstructured":"Kempe, D., Schulman, L.J., Tamuz, O.: Quasi-regular sequences and optimal schedules for security games. In: ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1625\u20131644. Society for Industrial and Applied Mathematics (2018)","DOI":"10.1137\/1.9781611975031.106"},{"key":"3_CR18","unstructured":"Khinchin, A.I.: Continued Fractions, vol. 525. P. Noordhoff (1963)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"King, V., Saia, J., Young, M.: Conflict on a communication channel. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 277\u2013286. ACM (2011)","DOI":"10.1145\/1993806.1993855"},{"key":"3_CR20","volume-title":"The Art of Computer Programming, Volume 3: Searching and Sorting","author":"DE Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 3: Searching and Sorting. Addison-Wisley, Reading (1973)"},{"key":"3_CR21","volume-title":"Advanced Engineering Mathematics","author":"E Kreyszig","year":"2008","unstructured":"Kreyszig, E.: Advanced Engineering Mathematics, 9th edn. Wiley, Hoboken (2008)","edition":"9"},{"issue":"6799","key":"3_CR22","doi-asserted-by":"publisher","first-page":"992","DOI":"10.1038\/35023164","volume":"406","author":"MJ Krieger","year":"2000","unstructured":"Krieger, M.J., Billeter, J.B., Keller, L.: Ant-like task allocation and recruitment in cooperative robots. Nature 406(6799), 992 (2000)","journal-title":"Nature"},{"key":"3_CR23","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"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Lynch, N., Newport, C., Radeva, T.: Trade-offs between selection complexity and performance when searching the plane without communication. In: Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing (PODC), pp. 252\u2013261. ACM (2014)","DOI":"10.1145\/2611462.2611463"},{"key":"3_CR25","unstructured":"Lenzen, C., Radeva, T.: The power of pheromones in ant foraging. In: Workshop on Biological Distributed Algorithms (BDA) (2013)"},{"key":"3_CR26","volume-title":"The Golden Ratio: The Story of Phi, the World\u2019s Most Astonishing Number","author":"M Livio","year":"2008","unstructured":"Livio, M.: The Golden Ratio: The Story of Phi, the World\u2019s Most Astonishing Number. Broadway Books, New York (2008)"},{"issue":"3","key":"3_CR27","first-page":"163","volume":"75","author":"M Naylor","year":"2002","unstructured":"Naylor, M.: Golden, $$\\sqrt{2}$$, and $$\\pi $$ flowers: a spiral story. Math. Mag. 75(3), 163\u2013172 (2002)","journal-title":"Math. Mag."},{"key":"3_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-540-30552-1_2","volume-title":"Swarm Robotics","author":"E \u015eahin","year":"2005","unstructured":"\u015eahin, E.: Swarm robotics: from sources of inspiration to domains of application. In: \u015eahin, E., Spears, W.M. (eds.) SR 2004. LNCS, vol. 3342, pp. 10\u201320. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30552-1_2"},{"key":"3_CR29","doi-asserted-by":"publisher","first-page":"187","DOI":"10.4064\/fm-46-2-187-189","volume":"46","author":"S \u015awierczkowski","year":"1958","unstructured":"\u015awierczkowski, S.: On successive settings of an arc on the circumference of a circle. Fundam. Math. 46, 187\u2013189 (1958)","journal-title":"Fundam. Math."},{"issue":"27","key":"3_CR30","doi-asserted-by":"publisher","first-page":"10881","DOI":"10.1073\/pnas.1309922110","volume":"110","author":"SCP Williams","year":"2013","unstructured":"Williams, S.C.P.: Studying volcanic eruptions with aerial drones. Proc. Natl. Acad. Sci. 110(27), 10881\u201310881 (2013)","journal-title":"Proc. Natl. Acad. Sci."},{"key":"3_CR31","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Probabilistic computations: toward a unified measure of complexity. In: Symposium on Foundations of Computer Science (FOCS), pp. 222\u2013227. IEEE (1977)","DOI":"10.1109\/SFCS.1977.24"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-54921-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T23:40:51Z","timestamp":1619221251000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-54921-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030549206","9783030549213"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-54921-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Paderborn","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2020.cs.uni-paderborn.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"41","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":"19","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":"0","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":"46% - 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":"11","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}