MFCS 2016 in Krakow, Poland
From August 22 to August 26, I attended the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS) in Krakow, Poland, where I presented our paper on the deterministic majority process.
From August 22 to August 26, I attended the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS) in Krakow, Poland, where I presented our paper on the deterministic majority process.
Our paper On the Voting Time of the Deterministic Majority Process has been accepted for presentation at the 41st International Symposium on Mathematical Foundations of Computer Science (MFCS), which will take place in Kraków, Poland in August 2016.
From March 1st to 10th, I visited our colleagues at the Simon Fraser University in Burnaby, BC, Canada. I would particularly like to thank Petra Berenbrink for the invitation!
From January 21st to 25th we will travel to Paris to work with our colleagues on our current research topic, distributed voting in large networks.
Last week Emanuele Natale from Sapienza University of Rome visited the Efficient Algorithms Group at the University of Salzburg to finish the project we startet when we met at the summer school in Vancouver in summer 2014.