Peter Kling
Peter Kling
About
Posts
Publications
Teaching
Contact
Light
Dark
Automatic
Tight Bounds for Coalescing-Branching Random Walks on Regular Graphs
Petra Berenbrink
,
George Giakkoupis
,
Peter Kling
January 2018
Cite
DOI
URL
Type
Conference paper
Publication
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018, New Orleans, LA, USA, January 7-10, 2018
Related
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time
Optimal time and space leader election in population protocols
Brief Announcement: Optimal Time and Space Leader Election in Population Protocols
Self-stabilizing Balls & Bins in Batches
Plurality Consensus via Shuffling: Lessons Learned from Load Balancing
Cite
×