Linked e-resources
Details
Table of Contents
A Topological Perspective on Distributed Network Algorithms
On Sense of Direction and Mobile Agents
Locality of not-so-weak coloring
Near-gathering of energy-constrained mobile agents
Optimal Multi Broadcast with Beeps using Group Testing
Tracking Routes in Communication Networks
Positional Encoding by Robots with Non-Rigid Movements
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots
Asynchronous Rendezvous with Different Maps
Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
Evacuating Two Robots from a Disk: A Second Cut
Distributed pattern formation in a ring
On Distributed Merlin-Arthur Decision Protocols
Anonymous Read/Write Memory: Leader Election and Desanonymization
Faster Construction of Overlay Networks
Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects
Making Randomized Algorithms Self-Stabilizing
How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning
Self-Adjusting Line Networks
Mutual Visibility for Asynchronous Robots
Infinite Grid Exploration by Disoriented Robots
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds
A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time
Visiting Infinitely Often the Unit Interval while Minimizin g the Idle-time of High Priority Points.
On Sense of Direction and Mobile Agents
Locality of not-so-weak coloring
Near-gathering of energy-constrained mobile agents
Optimal Multi Broadcast with Beeps using Group Testing
Tracking Routes in Communication Networks
Positional Encoding by Robots with Non-Rigid Movements
Arbitrary Pattern Formation by Asynchronous Opaque Robots with Lights
Breaking the Linear-Memory Barrier in MPC: Fast MIS on Trees with Strongly Sublinear Memory
Collaborative Delivery on a Fixed Path with Homogeneous Energy-Constrained Robots
Asynchronous Rendezvous with Different Maps
Gathering Synchronous Robots in Graphs: from general properties to dense and symmetric topologies
Time-Energy Tradeoffs for Evacuation by Two Robots in the Wireless Model
Evacuating Two Robots from a Disk: A Second Cut
Distributed pattern formation in a ring
On Distributed Merlin-Arthur Decision Protocols
Anonymous Read/Write Memory: Leader Election and Desanonymization
Faster Construction of Overlay Networks
Partial gathering of mobile agents without identifiers or global knowledge in asynchronous unidirectional rings
Set Agreement Power is not a Precise Characterization for Oblivious Deterministic Anonymous Objects
Making Randomized Algorithms Self-Stabilizing
How to Color a French Flag{Biologically Inspired Algorithms for Scale-Invariant Patterning
Self-Adjusting Line Networks
Mutual Visibility for Asynchronous Robots
Infinite Grid Exploration by Disoriented Robots
A Bounding Box Overlay for Competitive Routing in Hybrid Communication Networks
Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds
A strongly-stabilizing protocol for spanning tree construction against a mobile Byzantine fault
Average-based Population Protocols : Explicit and Tight Bounds of the Convergence Time
Visiting Infinitely Often the Unit Interval while Minimizin g the Idle-time of High Priority Points.