Faculty
Dr. Sebastian Brandt is a tenure-track faculty member at the Helmholtz Center for Information Security (CISPA) in Saarbruecken, Germany. Prior to joining CISPA, he was a postdoc in the Discrete and Distributed Algorithms Group at ETH Zurich, led by Mohsen Ghaffari. He received his PhD from ETH in the beginning of 2018, under the supervision of Roger Wattenhofer.
DISC International Symposium on Distributed Computing (DISC)
Brief Announcement: Memory Efficient Massively Parallel Algorithms for LCL Problems on Trees.
ACM Symposium on Principles of Distributed Computing (PODC)
Locally Checkable Problems in Rooted Trees
ACM Symposium on Principles of Distributed Computing (PODC)
The Randomized Local Computation Complexity of the Lovász Local Lemma
ACM Symposium on Principles of Distributed Computing (PODC)
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
ACM Symposium on Parallelism in Algorithms and Architectures (SPAA)
Efficient Load-Balancing through Distributed Token Dropping
IEEE Symposium on Foundations of Computer Science (FOCS)
Distributed Lower Bounds for Ruling Sets
ACM Symposium on Principles of Distributed Computing (PODC)
Truly Tight-in-Δ Bounds for Bipartite Maximal Matching and Variants
ACM Symposium on Principles of Distributed Computing (PODC)
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
ACM Symposium on Principles of Distributed Computing (PODC)
How much does randomness help with locally checkable problems?
ACM Symposium on Principles of Distributed Computing (PODC)
Brief Announcement: Classification of Distributed Binary Labeling Problems