Research
I work at the University of Hamburg in the research group of Petra Berenbrink. We are interested in efficient randomized algorithms to solve various communication tasks in distributed systems. For my PhD studies, I worked under supervision of Robert Elsässer at the Department of Computer Sciences at the University of Salzburg.
Publications
2018
Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Peter
Kling, and Tomasz Radzik
A population protocol for exact majority with O(log 5/3 n) stabilization time and Θ(log n) states
In
Proceedings of the 32nd International Symposium on
Distributed Computing (DISC), 2018
Petra Berenbrink, Dominik Kaaser, Peter Kling, and Lena Otterbach
Simple and Efficient Leader Election
In
Proceedings of the 1st Symposium on Simplicity in
Algorithms (SOSA, at SODA'18), 2018
2017
Robert Elsässer, Tom Friedetzky, Dominik Kaaser, Frederik Mallmann-Trenn, and
Horst Trinker
Brief Announcement: Rapid Asynchronous Plurality Consensus
In
Proceedings of the ACM Symposium on Principles of Distributed
Computing (PODC), 2017
2016
Dominik Kaaser, Frederik Mallmann-Trenn, and Emanuele Natale
On the Voting Time of the Deterministic Majority Process
In
Proceedings of the 41st International Symposium on
Mathematical Foundations of Computer Science (MFCS), 2016
Dominik S. Kaaser
Efficient Randomized Algorithms for Information Dissemination,
Distributed Voting, and Plurality Consensus
PhD thesis, University of Salzburg, 2016
2015
Hoda Akbari, Petra Berenbrink, Robert Elsässer, and Dominik Kaaser
Discrete Load Balancing in Heterogeneous Networks with a
Focus on Second-Order Diffusion
In
Proceedings of the 35th IEEE International Conference on
Distributed Computing Systems (ICDCS), pages 497–506, 2015
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader
Weighted Straight Skeletons in the Plane
Computational Geometry: Theory and Applications,
48(2):120–133, 2015
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader
A Simple Algorithm for Computing Positively Weighted
Straight Skeletons of Monotone Polygons
Information Processing Letters, 115(2):243–247, 2015
Robert Elsässer and Dominik Kaaser
On the Influence of Graph Density on Randomized
Gossiping
In
Proceedings of the 29th IEEE International Parallel &
Distributed Processing Symposium (IPDPS), pages 521–531, 2015
Dominik Kaaser, Frederik Mallmann-Trenn, and Emanuele Natale
Brief Announcement: On the Voting Time of the
Deterministic Majority Process
In
Proceedings of the 29th International Symposium on
Distributed Computing (DISC), 2015
2014
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader
Straight Skeletons of Monotone Polygons
In
Proceedings of the 30th European Workshop on Computational
Geometry (EuroCG), 2014
Martin Held and Dominik Kaaser
C2 Approximation of Planar Curvilinear Profiles by Cubic
B-Splines
Computer-Aided Design and Applications, 11(2):206–219, 2014
2013
Therese Biedl, Martin Held, Stefan Huber, Dominik Kaaser, and Peter Palfrader
Weighted Straight Skeletons in the Plane
In
Proceedings of the 25th Canadian Conference on Computational
Geometry (CCCG), pages 13–18, 2013
Martin Held and Dominik Kaaser
Curvature-Continuous Approximation of Planar Curvilinear
Profiles
In
Proceedings of the Computer Aided Design Conference, pages
88–89, 2013
2012
Dominik S. Kaaser
G2-Continuous Approximation of Open and Closed Curves
Master's thesis, University of Salzburg, 2012
2010
Peter Färberböck, Jutta Hämmerle-Uhl, Dominik Kaaser, Elias Pschernig, and
Andreas Uhl
Transforming Rectangular and Polar Iris Images to Enable
Cancelable Biometrics
In
Image Analysis and Recognition, pages 276–286.
Springer-Verlag, 2010