Mohsen Ghaffari

ORCID

Publication Activity (10 Years)

Years Active: 2009-2022
Publications (10 Years): 112

Top Venues

MIT, USA (PHD)

Education History

MIT, USA

PHD

Publications

Mohsen Ghaffari, Fabian Kuhn
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. FOCS (2022)
Mohsen Ghaffari, Bernhard Haeupler
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. PODC (2021)
Mohsen Ghaffari
Network Decomposition and Distributed Derandomization. ICDCN (2021)
Mohsen Ghaffari, Bernhard Haeupler
A Time-Optimal Randomized Parallel Algorithm for MIS. SODA (2021)
Mansoor Davoodi, Mohsen Ghaffari
Shortest path problem on uncertain networks: An efficient two phases approach. Comput. Ind. Eng. 157 (2021)
Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Hop-constrained oblivious routing. STOC (2021)
Yi-Jun Chang, Mohsen Ghaffari
Strong-Diameter Network Decomposition. PODC (2021)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus
Improved distributed Δ-coloring. Distributed Comput. 34 (4) (2021)
Yi-Jun Chang, Mohsen Ghaffari
Strong-Diameter Network Decomposition. CoRR (2021)
Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA (2021)
Mohsen Ghaffari, Christoph Grunau, Václav Rozhon
Improved Deterministic Network Decomposition. SODA (2021)
Mohsen Ghaffari, Krzysztof Nowicki
Massively Parallel Algorithms for Minimum Cut. PODC (2020)
Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari
Massively Parallel Algorithms for Distance Approximation and Spanners. CoRR (2020)
Mohsen Ghaffari, Fabian Kuhn
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. CoRR (2020)
Mohsen Ghaffari, Ce Jin, Daan Nilis
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. SPAA (2020)
Mohsen Ghaffari, Christoph Grunau, Ce Jin
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. DISC (2020)
Václav Rozhon, Mohsen Ghaffari
Polylogarithmic-time deterministic network decomposition and distributed derandomization. STOC (2020)
Mohsen Ghaffari, Christoph Grunau, Václav Rozhon
Improved Deterministic Network Decomposition. CoRR (2020)
Mohsen Ghaffari
Network Decomposition and Distributed Derandomization (Invited Paper). SIROCCO (2020)
Mohsen Ghaffari, Ce Jin, Daan Nilis
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. CoRR (2020)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto
Improved distributed degree splitting and edge coloring. Distributed Comput. 33 (3-4) (2020)
Mohsen Ghaffari, Christoph Grunau, Ce Jin
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. CoRR (2020)
Mohsen Ghaffari, Bernhard Haeupler
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. CoRR (2020)
Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic
Hop-Constrained Oblivious Routing. CoRR (2020)
Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. SODA (2020)
Michal Dory, Mohsen Ghaffari
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. CoRR (2019)
Mohsen Ghaffari, Jara Uitto
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. SODA (2019)
Mohsen Ghaffari, David Wajc
Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. SOSA (2019)
Mohsen Ghaffari, Fabian Kuhn, Jara Uitto
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. FOCS (2019)
John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Fabian Kuhn, Jason Li
Distributed Computation in Node-Capacitated Networks. SPAA (2019)
Mohsen Ghaffari, Fabian Kuhn
On the Use of Randomness in Local Distributed Graph Algorithms. CoRR (2019)
Mohsen Ghaffari, Ali Sayyadi
Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication. ICALP (2019)
Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
On the Complexity of Distributed Splitting Problems. PODC (2019)
Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen
Distributed Algorithms for Low Stretch Spanning Trees. DISC (2019)
Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
On the Complexity of Distributed Splitting Problems. CoRR (2019)
Václav Rozhon, Mohsen Ghaffari
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization. CoRR (2019)
Michal Dory, Mohsen Ghaffari
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. PODC (2019)
Mohsen Ghaffari, Julian Portmann
Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. CoRR (2019)
Mohsen Ghaffari, Fabian Kuhn
On the Use of Randomness in Local Distributed Graph Algorithms. PODC (2019)
Mohsen Ghaffari, Silvio Lattanzi, Slobodan Mitrovic
Improved Parallel Algorithms for Density-Based Network Clustering. ICML (2019)
Mohsen Ghaffari, Julian Portmann
Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. DISC (2019)
Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. CoRR (2019)
Yi-Jun Chang, Manuela Fischer, Mohsen Ghaffari, Jara Uitto, Yufan Zheng
The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation. PODC (2019)
Mohsen Ghaffari
Distributed Maximal Independent Set using Small Messages. SODA (2019)
Mohsen Ghaffari, Fabian Kuhn
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set. DISC (2018)
Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir
Near-Optimal Distributed Maximum Flow. SIAM J. Comput. 47 (6) (2018)
Mohsen Ghaffari, Jara Uitto
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. CoRR (2018)
Mohsen Ghaffari, Jason Li
Improved distributed algorithms for exact shortest paths. STOC (2018)
Mohsen Ghaffari, David G. Harris, Fabian Kuhn
On Derandomizing Local Distributed Algorithms. FOCS (2018)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus
Improved Distributed Δ-Coloring. CoRR (2018)
Mohsen Ghaffari, Jason Li
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. CoRR (2018)
Mohsen Ghaffari
Session details: Session 2B: Routing and Leader Election. PODC (2018)
Manuela Fischer, Mohsen Ghaffari, Jara Uitto
Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation. CoRR (2018)
Mohsen Ghaffari, Fabian Kuhn
Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. DISC (2018)
Mohsen Ghaffari, Krzysztof Nowicki
Congested Clique Algorithms for the Minimum Cut Problem. PODC (2018)
John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, Christian Scheideler
Distributed Computation in the Node-Congested Clique. CoRR (2018)
Manuela Fischer, Mohsen Ghaffari
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. CoRR (2018)
Manuela Fischer, Mohsen Ghaffari
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. DISC (2018)
Guy Even, Mohsen Ghaffari, Moti Medina
Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. DISC (2018)
Andrea E. F. Clementi, Mohsen Ghaffari, Luciano Gualà, Emanuele Natale, Francesco Pasquale, Giacomo Scornavacca
A Tight Analysis of the Parallel Undecided-State Dynamics with Two Colors. MFCS (2018)
Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrovic, Ronitt Rubinfeld
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. CoRR (2018)
Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. PODC (2018)
Mohsen Ghaffari, Johannes Lengler
Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics. PODC (2018)
Mohsen Ghaffari, Jason Li
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. DISC (2018)
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
Deterministic distributed edge-coloring with fewer colors. STOC (2018)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus
Improved Distributed Delta-Coloring. PODC (2018)
Manuela Fischer, Mohsen Ghaffari
Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. DISC (2017)
Mohsen Ghaffari, Jason Li
Improved Distributed Algorithms for Exact Shortest Paths. CoRR (2017)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto
Improved Distributed Degree Splitting and Edge Coloring. CoRR (2017)
Mohsen Ghaffari, Christiana Lymouri
Simple and Near-Optimal Distributed Coloring for Sparse Graphs. DISC (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman
Distributed Approximation of Maximum Independent Set and Maximum Matching. CoRR (2017)
Mohsen Ghaffari, Merav Parter
Near-Optimal Distributed DFS in Planar Graphs. DISC (2017)
Mohsen Ghaffari, Fabian Kuhn, Hsin-Hao Su
Distributed MST and Routing in Almost Mixing Time. PODC (2017)
Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. FOCS (2017)
Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn
Tight Bounds on Vertex Connectivity Under Sampling. ACM Trans. Algorithms 13 (2) (2017)
Mohsen Ghaffari
Space-Optimal Semi-Streaming for (2+ε)-Approximate Matching. CoRR (2017)
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto
Deterministic Distributed Edge-Coloring with Fewer Colors. CoRR (2017)
Manuela Fischer, Mohsen Ghaffari
Sublogarithmic Distributed Algorithms for Lovász Local lemma, and the Complexity Hierarchy. CoRR (2017)
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus
On the complexity of local distributed graph problems. STOC (2017)
Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto
Improved Distributed Degree Splitting and Edge Coloring. DISC (2017)
Mohsen Ghaffari, David G. Harris, Fabian Kuhn
On Derandomizing Local Distributed Algorithms. CoRR (2017)
Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC (2017)
Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. CoRR (2017)
Manuela Fischer, Mohsen Ghaffari
Deterministic Distributed Matching: Simpler, Faster, Better. CoRR (2017)
Mohsen Ghaffari, Hsin-Hao Su
Distributed Degree Splitting, Edge Coloring, and Orientations. SODA (2017)
Mohsen Ghaffari
Distributed MIS via All-to-All Communication. PODC (2017)
Mohsen Ghaffari, Johannes Lengler
Tight Analysis for the 3-Majority Consensus Dynamics. CoRR (2017)
Mohsen Ghaffari, David R. Karger, Debmalya Panigrahi
Random Contractions and Sampling for Hypergraph and Hedge Connectivity. SODA (2017)
Mohsen Ghaffari, Christiana Lymouri
Simple and Near-Optimal Distributed Coloring for Sparse Graphs. CoRR (2017)
Mohsen Ghaffari, Bernhard Haeupler
Distributed Algorithms for Planar Networks I: Planar Embedding. PODC (2016)
Mohsen Ghaffari, Calvin C. Newport
Leader Election in Unreliable Radio Networks. ICALP (2016)
Mohsen Ghaffari
An Improved Distributed Algorithm for Maximal Independent Set. SODA (2016)
Mohsen Ghaffari, Hsin-Hao Su
Distributed Degree Splitting, Edge Coloring, and Orientations. CoRR (2016)
Mohsen Ghaffari, Bernhard Haeupler
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. SODA (2016)
Mohsen Ghaffari, Fabian Kuhn, Yannic Maus
On the Complexity of Local Distributed Graph Problems. CoRR (2016)
Mohsen Ghaffari, Calvin Newport
How to Discreetly Spread a Rumor in a Crowd. CoRR (2016)
Mohsen Ghaffari, Merav Parter
Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures. SPAA (2016)
Mohsen Ghaffari, Merav Parter
A Polylogarithmic Gossip Algorithm for Plurality Consensus. PODC (2016)
Mohsen Ghaffari, Calvin C. Newport
How to Discreetly Spread a Rumor in a Crowd. DISC (2016)
Mohsen Ghaffari, Merav Parter
MST in Log-Star Rounds of Congested Clique. PODC (2016)

Mohsen Ghaffari.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mohsen Ghaffari