ANTS on a Plane

DOI10.1007/978-3-030-54921-3_3OpenAlexW3046506618MaRDI QIDQ5100945

Abhinav Aggarwal, Jared Saia

Publication date: 1 September 2022

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-54921-3_3

zbMATH Keywords

reliabilitycomputational geometrygolden rationatural algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How many ants does it take to find the food?
• The ANTS problem
• Collaborative search on the plane without communication
• Conflict on a communication channel
• Trade-offs between selection complexity and performance when searching the plane without communication
• On successive settings of an arc on the circumference of a circle
• A golden ratio control policy for a multiple-access channel
• Memory Lower Bounds for Randomized Collaborative Search and Implications for Biology
• Solving the ANTS Problem with Asynchronous Finite State Machines
• Fibonacci heaps and their uses in improved network optimization algorithms
• How Many Ants Does It Take to Find the Food?
• Concentration of Measure for the Analysis of Randomized Algorithms

This page was built for publication: ANTS on a Plane