Till Knollmann
Orcid: 0000-0003-2014-4696
According to our database1,
Till Knollmann
authored at least 19 papers
between 2017 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
2017
2018
2019
2020
2021
2022
2023
0
1
2
3
4
5
6
7
8
1
1
4
2
1
2
2
3
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2023
Gathering a Euclidean closed chain of robots in linear time and improved algorithms for chain-formation.
Theor. Comput. Sci., 2023
2022
Inf. Comput., 2022
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022
A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility.
Proceedings of the 26th International Conference on Principles of Distributed Systems, 2022
Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022
2021
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2021
Proceedings of the Algorithms for Sensor Systems, 2021
2020
Gathering in Linear Time: A Closed Chain of Disoriented & Luminous Robots with Limited Visibility.
CoRR, 2020
Brief Announcement: Gathering in Linear Time: A Closed Chain of Disoriented and Luminous Robots with Limited Visibility.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020
A Discrete and Continuous Study of the Max-Chain-Formation Problem: Slow Down to Speed up.
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
Proceedings of the SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, 2020
2018
A Peer-to-Peer Based Cloud Storage Supporting Orthogonal Range Queries of Arbitrary Dimension.
Proceedings of the Algorithmic Aspects of Cloud Computing - 4th International Symposium, 2018
2017
Proceedings of the Structural Information and Communication Complexity, 2017