Michael Elkin is a Professor in the Department of Computer Science at Ben-Gurion University of the Negev, Israel. His research focuses on Theoretical Computer Science, Discrete Mathematics, and Algorithms, with specializations in graph algorithms, distributed computing, and metric embeddings. He has held editorial roles, including Associate Editor of the Journal of Computer and System Sciences, and has contributed to numerous program committees for top conferences like FOCS and SODA. Elkin's research interests include low-distortion embeddings, streaming and dynamic graph algorithms, and approximation algorithms. His work bridges distributed and centralized algorithm design, with applications in network optimization and computational geometry. Recent trends in his publications emphasize efficient spanner constructions, symmetry-breaking in distributed systems, and algorithmic approaches to graph coloring and metric spaces. Elkin has advised multiple PhD and Master’s students, including Leonid Barenboim (winner of the 2015 Distributed Computing Doctoral Dissertation Award) and Shay Solomon. He has been awarded Best Paper and Best Student Paper awards at PODC conferences for groundbreaking contributions to distributed algorithms. Additionally, he leads a postdoctoral research group focusing on graph algorithms and metric embeddings, collaborating with Eden Chlamtac and Ofer Neiman. Teaching highlights include courses on Distributed Algorithms, Design of Algorithms, and Metric Graph Algorithms. His academic service includes organizing academic programs and mentoring early-career researchers in theoretical computer science.
