email: my-last-name at csail. mit .edu
phone: +1 617 253-5866
fax: +1 617 258-8682
I develop and analyze efficient algorithms for distributed networks.
In March 2019 I led a 1 week workshop on Blockchain/DLT at the Studienstiftung des deutschen Volkes (top 0.25% of German students in Computer Science, Math, and Physics). A second part of the workshop followed in August 2019.
With my co-authors Lilika Markatou and Magnus Halldorsson I received the best paper award at the 24th International Colloquium on Structural Information and Communication Complexity for our paper “Leader Election in SINR Model with Arbitrary Power Control”. The conference will take place June 19-22 2017 in Porquerolles, France.
April 2017: Plenary Talk at the General Assembly of the Academy of Science and Literatur | Mainz, Germany. November 2016: TED style event at German Consulate General in Boston, invited by German American Business Council, Boston, USA. September 2016: invited talk at the 5th Workshop on Advanced Distributed Graph Algorithms, also in Paris. February 2016: invited talk at the NEXUS workshop at Henri Poincare Institute (IHP) in Paris hosted by Cedric Villani (see video link below).
I am on the program committees of the 28th ACM Symposium on Parallelism in Algorithms and Architectures 2016 (SPAA) and of the 17th International Conference on Distributed Computing and Networking 2016 (ICDCN) and the 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2016).
A new course at MIT created together with Mohsen Ghaffari and Nancy Lynch. In this small course (1 lecture/week), we study the basic techniques for designing, analyzing, and proving the limitations of distributed graph algorithms. The course is technique-oriented and targets graduate students.
I am a member of the organizing committee. The 8th annual German American Conference at Harvard University will delve into the most pressing issues in the transatlantic relationship and take the pulse of this critical partnership. With 45 speakers and 900+ participants from many countries and prestigious universities, the German American Conference is the largest student-led conference of its kind in the United States. [Conference website]
Jukka Suomela animated the algorithm from our paper Optimal Distributed All Pairs Shortest Paths and Applications for his lecture. This algorithm computes shortest paths between all pairs of nodes in time O(n) in the CONGEST model, which we proved to be best possible.
MO-labs.com creates 3D-prints of the mathematical surfaces from our paper Illustrating the Classification of Real Cubic Surfaces. A great gift for anybody you like! [Buy at MO-labs]
I am on the program committee of the 41st International Conference on Current Trends
in Theory and Practice of Computer Science. [SOFSEM 2015 website]
I was selected to participate in the first Heidelberg Laureate Forum, in which about half of the living Abel, Fields and Turing laureates meet the next generation of promising researchers (200 selected world wide). I also had the pleasure to give an interview in advance. [Heidelberg Laureate Forum website] [Interview].
I was invited to deliver a keynote at the 9th annual Theory Day of the Icelandic Center of Excellence for Theoretical Computer Science.
Academic experience:
Jeet Mohapatra
Undergraduate Research Opportunities Program (UROP)
MIT - 2016
Evangelia Anna Markatou
Master's Thesis, and Undergraduate Advanced Project (UAP)
MIT - 2016
Nathan Pinsker
Undergraduate Research Opportunities Program (UROP)
MIT - 2014
Benjamin Dissler
Term Thesis
ETH Zurich - 2013
Sebastian Kohler
Master's Thesis
ETH Zurich - 2012
Alexandra Hochuli
Bachelor's Thesis
ETH Zurich - 2011
Christof Baumann
Master's Thesis
ETH Zurich - 2011
Silvio Frischknecht
Term Thesis
ETH Zurich - 2011
Daniel Schweizer
Bachelor's Thesis
ETH Zurich - 2011
+1 617 253-5866
Office 32-G678 32 - Vassar Street, Cambridge, MA 02139, USA