Folgen
Peter Kling
Titel
Zitiert von
Zitiert von
Jahr
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
562011
A new approach for analyzing convergence algorithms for mobile robots
A Cord-Landwehr, B Degener, M Fischer, M Hüllmann, B Kempkes, ...
International Colloquium on Automata, Languages, and Programming, 650-661, 2011
532011
A Population Protocol for Exact Majority with O (log5/3 n) Stabilization Time and Theta (log n) States
P Berenbrink, R Elsässer, T Friedetzky, D Kaaser, P Kling, T Radzik
32nd International Symposium on Distributed Computing (DISC 2018), 2018
452018
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
432020
Simple and efficient leader election
P Berenbrink, D Kaaser, P Kling, L Otterbach
1st Symposium on Simplicity in Algorithms (SOSA 2018), 2018
402018
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
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
352016
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
332016
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
292013
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
272011
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
252021
An algorithm for online facility leasing
P Kling, F Meyer auf der Heide, P Pietrzyk
International Colloquium on Structural Information and Communication …, 2012
252012
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
252012
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
242016
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
212015
A continuous, local strategy for constructing a short chain of mobile robots
B Degener, B Kempkes, P Kling, F Meyer Auf der Heide
International Colloquium on Structural Information and Communication …, 2010
212010
Tight & simple load balancing
P Berenbrink, T Friedetzky, D Kaaser, P Kling
2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019
182019
Towards efficient reconstruction of attacker lateral movement
F Wilkens, S Haas, D Kaaser, P Kling, M Fischer
Proceedings of the 14th International Conference on Availability …, 2019
172019
Continuous protocols for swarm robotics
P Kling, F Meyer auf der Heide
Distributed Computing by Mobile Entities: Current Research in Moving and …, 2019
152019
Sharing is caring: Multiprocessor scheduling with a sharable resource
P Kling, A Mäcker, S Riechers, A Skopalik
Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and …, 2017
152017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20