Follow
Peter Kling
Title
Cited by
Cited by
Year
Collisionless gathering of robots with an extent
A Cord-Landwehr, B Degener, M Fischer, M Hüllmann, B Kempkes, ...
SOFSEM 2011: Theory and Practice of Computer Science: 37th Conference on …, 2011
552011
A new approach for analyzing convergence algorithms for mobile robots
A Cord-Landwehr, B Degener, M Fischer, M Hüllmann, B Kempkes, ...
Automata, Languages and Programming: 38th International Colloquium, ICALP …, 2011
522011
Simple and efficient leader election
P Berenbrink, D Kaaser, P Kling, L Otterbach
1st Symposium on Simplicity in Algorithms (SOSA 2018), 2018
412018
Optimal time and space leader election in population protocols
P Berenbrink, G Giakkoupis, P Kling
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
402020
A population protocol for exact majority with stabilization time and asymptotically optimal number of states
P Berenbrink, R Elsässer, T Friedetzky, D Kaaser, P Kling, T Radzik
arXiv preprint arXiv:1805.05157, 2018
372018
Efficient plurality consensus, or: The benefits of cleaning up from time to time
P Berenbrink, T Friedetzky, G Giakkoupis, P Kling
43rd International Colloquium on Automata, Languages and Programming (ICALP …, 2016
372016
Ignore or comply? on breaking symmetry in consensus
P Berenbrink, A Clementi, R Elsässer, P Kling, F Mallmann-Trenn, ...
Proceedings of the ACM Symposium on Principles of Distributed Computing, 335-344, 2017
352017
Towards the price of leasing online
S Abshoff, P Kling, C Markarian, F Meyer Auf Der Heide, P Pietrzyk
Journal of Combinatorial Optimization 32, 1197-1216, 2016
272016
On-the-fly computing: A novel paradigm for individualized it services
M Happe, FM auf der Heide, P Kling, M Platzner, C Plessl
16th IEEE International Symposium on Object/component/service-oriented Real …, 2013
262013
Convergence of local communication chain strategies via linear transformations: or how to trade locality for speed
P Kling, F Meyer auf der Heide
Proceedings of the twenty-third annual ACM symposium on Parallelism in …, 2011
252011
Optimal and competitive runtime bounds for continuous, local gathering of mobile robots
B Kempkes, P Kling, F Meyer auf der Heide
Proceedings of the twenty-fourth annual ACM symposium on Parallelism in …, 2012
242012
Time-space trade-offs in population protocols for the majority problem
P Berenbrink, R Elsässer, T Friedetzky, D Kaaser, P Kling, T Radzik
Distributed Computing 34, 91-111, 2021
232021
An algorithm for online facility leasing
P Kling, F Meyer auf der Heide, P Pietrzyk
Structural Information and Communication Complexity: 19th International …, 2012
222012
A continuous, local strategy for constructing a short chain of mobile robots
B Degener, B Kempkes, P Kling, F Meyer Auf der Heide
Structural Information and Communication Complexity: 17th International …, 2010
212010
Linear and competitive strategies for continuous robot formation problems
B Degener, B Kempkes, P Kling, FMAD Heide
ACM Transactions on Parallel Computing (TOPC) 2 (1), 1-18, 2015
182015
Tight & simple load balancing
P Berenbrink, T Friedetzky, D Kaaser, P Kling
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019
172019
Self-stabilizing balls & bins in batches: The power of leaky bins
P Berenbrink, T Friedetzky, P Kling, F Mallmann-Trenn, L Nagel, ...
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing …, 2016
162016
A Population Protocol for Exact Majority with O (log5/3 n) Stabilization Time and Theta (log n) States}}
U Schmid, J Widder
32nd International Symposium on Distributed Computing (DISC 2018) 121, 10, 2018
142018
Scheduling shared continuous resources on many-cores
A Brinkmann, P Kling, F Meyer auf der Heide, L Nagel, S Riechers, T Süß
Proceedings of the 26th ACM symposium on Parallelism in algorithms and …, 2014
132014
Efficient computation of optimal energy and fractional weighted flow trade-off schedules
A Antoniadis, N Barcelo, M Consuegra, P Kling, M Nugent, K Pruhs, ...
Algorithmica 79, 568-597, 2017
122017
The system can't perform the operation now. Try again later.
Articles 1–20