Peter Kling
Peter Kling
About
Posts
Publications
Teaching
Contact
Light
Dark
Automatic
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed
Peter Kling
,
Friedhelm Meyer Auf Der Heide
January 2011
Cite
DOI
URL
Type
Conference paper
Publication
SPAA 2011: Proceedings of the 23rd Annual ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, USA, June 4-6, 2011 (Co-located with FCRC 2011)
Related
A Continuous, Local Strategy for Constructing a Short Chain of Mobile Robots
Collisionless Gathering of Robots with an Extent
An Experimental Comparison of Load Balancing Strategies in a Web Computing Environment
A New Approach for Analyzing Convergence Algorithms for Mobile Robots
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
Cite
×