Pages that link to "Item:Q5315244"

The following pages link to Structural Information and Communication Complexity (Q5315244):

Displaying 17 items.

• Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
• Energy-efficient strategies for building short chains of mobile robots locally (Q392202) (← links)
• Gathering of asynchronous robots with limited visibility (Q557818) (← links)
• Optimal dispersion on an anonymous ring in the presence of weak Byzantine robots (Q820545) (← links)
• Optimal strategies for maintaining a chain of relays between an explorer and a base camp (Q838151) (← links)
• Optimal Byzantine-resilient convergence in uni-dimensional robot networks (Q986551) (← links)
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
• Distributed algorithms for partitioning a swarm of autonomous mobile robots (Q1008735) (← links)
• How many oblivious robots can explore a line (Q1944194) (← links)
• ``Robot cloud'' gradient climbing with point measurements (Q2253201) (← links)
• Gathering anonymous, oblivious robots on a grid (Q2310768) (← links)
• Impossibility of gathering by a set of autonomous mobile robots (Q2382675) (← links)
• Computing without communicating: ring exploration by asynchronous oblivious robots (Q2392925) (← links)
• Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots (Q3012964) (← links)
• Gathering Anonymous, Oblivious Robots on a Grid (Q5056061) (← links)
• Synchronous gathering without multiplicity detection: a certified algorithm (Q5920218) (← links)