Sotabase

Career

· Associate Professor, MIT2022–
· Professor, ETH Zurich2016–2022
· PhD in Electrical Engineering and Computer Science, MIT2016–
· MSc in Electrical Engineering and Computer Science, MIT2013–
· BSc in Electrical Engineering and Computer Science, Sharif University of Technology2010–

Publications (290)

An Improved Distributed Algorithm for Maximal Independent Set
ACM-SIAM Symposium on Discrete Algorithms · 2015
228
cited
Polylogarithmic-time deterministic network decomposition and distributed derandomization
Symposium on the Theory of Computing · 2019
212
cited
On the complexity of local distributed graph problems
Symposium on the Theory of Computing · 2016
150
cited
On Derandomizing Local Distributed Algorithms
IEEE Annual Symposium on Foundations of Computer Science · 2017
142
cited
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing · 2018
137
cited
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
ACM-SIAM Symposium on Discrete Algorithms · 2018
107
cited
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
ACM-SIAM Symposium on Discrete Algorithms · 2016
105
cited
Distributed Degree Splitting, Edge Coloring, and Orientations
ACM-SIAM Symposium on Discrete Algorithms · 2016
100
cited
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing · 2018
94
cited
Distributed Minimum Cut Approximation
International Symposium on Distributed Computing · 2013
91
cited
MST in Log-Star Rounds of Congested Clique
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing · 2016
90
cited
Improved Deterministic Network Decomposition
ACM-SIAM Symposium on Discrete Algorithms · 2020
86
cited
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching
IEEE Annual Symposium on Foundations of Computer Science · 2017
85
cited
Sublogarithmic Distributed Algorithms for Lovász Local lemma, and the Complexity Hierarchy
International Symposium on Distributed Computing · 2017
81
cited
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding
IEEE Annual Symposium on Foundations of Computer Science · 2013
80
cited
Optimal error rates for interactive coding I: adaptivity and other settings
Symposium on the Theory of Computing · 2013
74
cited
Near Optimal Leader Election in Multi-Hop Radio Networks
ACM-SIAM Symposium on Discrete Algorithms · 2012
70
cited
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition
IEEE Annual Symposium on Foundations of Computer Science · 2020
69
cited
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds
IEEE Annual Symposium on Foundations of Computer Science · 2019
68
cited
A Polylogarithmic Gossip Algorithm for Plurality Consensus
ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing · 2016
62
cited
Sotabase
Mohsen Ghaffari | Researcher Profile | Sotabase | Sotabase