Pages that link to "Item:Q5901676"

The following pages link to LATIN 2004: Theoretical Informatics (Q5901676):

Displaying 19 items.

• Gathering fat mobile robots with slim omnidirectional cameras (Q300242) (← links)
• Gathering asynchronous oblivious agents with local vision in regular bipartite graphs (Q392198) (← links)
• Self-stabilizing gathering with strong multiplicity detection (Q418745) (← links)
• Gathering of asynchronous robots with limited visibility (Q557818) (← links)
• Getting close without touching: near-gathering for autonomous mobile robots (Q748118) (← links)
• Non-uniform circle formation algorithm for oblivious mobile robots with convergence toward uniformity (Q924138) (← links)
• Remembering without memory: tree exploration by asynchronous oblivious robots (Q962164) (← links)
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring (Q986558) (← links)
• Gathering few fat mobile robots in the plane (Q1004312) (← links)
• Distributed algorithms for partitioning a swarm of autonomous mobile robots (Q1008735) (← links)
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms (Q1699417) (← links)
• Gathering identical autonomous systems on a circle using stigmergy (Q1938388) (← links)
• The topology of look-compute-move robot wait-free algorithms with hard termination (Q2002056) (← links)
• Rendezvous in planar environments with obstacles and unknown initial distance (Q2321296) (← links)
• Impossibility of gathering by a set of autonomous mobile robots (Q2382675) (← links)
• Gathering asynchronous oblivious mobile robots in a ring (Q2474070) (← links)
• Gathering problems for autonomous mobile robots with lights (Q2680865) (← links)
• (Q2762510) (← links)
• Structural Information and Communication Complexity (Q5710088) (← links)