Peter Kling
Peter Kling
About
Posts
Publications
Teaching
Contact
Light
Dark
Automatic
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up
Jannik Castenow
,
Peter Kling
,
Till Knollmann
,
Friedhelm Meyer auf der Heide
January 2020
Cite
DOI
URL
Type
Conference paper
Publication
SPAA ‘20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020
Related
A Discrete and Continuous Study of the Max-Chain-Formation Problem
A Discrete and Continuous Study of the Max-Chain-Formation Problem - Slow down to Speed Up
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility
A discrete and continuous study of the Max-Chain-Formation problem
Cite
×