| 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) 121, 10, 2018 | 46 | 2018 |
| Simple and Efficient Leader Election P Berenbrink, D Kaaser, P Kling, L Otterbach 1st Symposium on Simplicity in Algorithms (SOSA 2018), 2018 | 41 | 2018 |
| Weighted straight skeletons in the plane T Biedl, M Held, S Huber, D Kaaser, P Palfrader Computational Geometry 48 (2), 120-133, 2015 | 41 | 2015 |
| Transforming rectangular and polar iris images to enable cancelable biometrics P Färberböck, J Hämmerle-Uhl, D Kaaser, E Pschernig, A Uhl International Conference Image Analysis and Recognition, 276-286, 2010 | 40 | 2010 |
| 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 | 38* | 2021 |
| On Counting the Population Size P Berenbrink, D Kaaser, T Radzik Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing …, 2019 | 23 | 2019 |
| A simple algorithm for computing positively weighted straight skeletons of monotone polygons T Biedl, M Held, S Huber, D Kaaser, P Palfrader Information Processing Letters 115 (2), 243-247, 2015 | 22 | 2015 |
| Tight & Simple Load Balancing P Berenbrink, T Friedetzky, D Kaaser, P Kling 2019 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2019 | 19 | 2019 |
| Quantitative group testing in the sublinear regime: Information-theoretic and algorithmic bounds O Gebhard, M Hahn-Klimroth, D Kaaser, P Loick arXiv preprint arXiv:1905.01458, 2019 | 19 | 2019 |
| 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 | 17 | 2019 |
| Brief Announcement: Rapid Asynchronous Plurality Consensus R Elsässer, T Friedetzky, D Kaaser, F Mallmann-Trenn, H Trinker Proceedings of the ACM Symposium on Principles of Distributed Computing, 363-365, 2017 | 17 | 2017 |
| Efficient k-Party Voting with Two Choices R Elsässer, T Friedetzky, D Kaaser, F Mallmann-Trenn, H Trinker ArXiv e-prints, 2016 | 16 | 2016 |
| Simulating Population Protocols in Sub-Constant Time per Interaction P Berenbrink, D Hammer, D Kaaser, U Meyer, M Penschuck, H Tran 28th Annual European Symposium on Algorithms (ESA 2020), 2020 | 14 | 2020 |
| On the Voting Time of the Deterministic Majority Process D Kaaser, F Mallmann-Trenn, E Natale 41st International Symposium on Mathematical Foundations of Computer Science …, 2016 | 13* | 2016 |
| Asynchronous Opinion Dynamics in Social Networks P Berenbrink, M Hoefer, D Kaaser, P Lenzner, M Rau, D Schmand AAMAS '22: Proceedings of the 21st International Conference on Autonomous …, 2022 | 12 | 2022 |
| Fast Consensus via the Unconstrained Undecided State Dynamics G Bankhamer, P Berenbrink, F Biermeier, R Elsässer, H Hosseinpour, ... Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2022 | 11 | 2022 |
| Rapid asynchronous plurality consensus R Elsässer, T Friedetzky, D Kaaser, F Mallmann-Trenn, H Trinker arXiv preprint arXiv:1602.04667, 2016 | 10 | 2016 |
| On the parallel reconstruction from pooled data O Gebhard, M Hahn-Klimroth, D Kaaser, P Loick 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2022 | 9 | 2022 |
| Loosely-stabilizing phase clocks and the adaptive majority problem P Berenbrink, F Biermeier, C Hahn, D Kaaser arXiv preprint arXiv:2106.13002, 2021 | 8* | 2021 |
| Positive aging admits fast asynchronous plurality consensus G Bankhamer, R Elsässer, D Kaaser, M Krnc Proceedings of the 39th Symposium on Principles of Distributed Computing …, 2020 | 7* | 2020 |
Peter KlingUniversity of HamburgVerified email at uni-hamburg.de
