default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMohsen Ghaffari 0001
Person information
- affiliation: MIT, Cambridge, MA, USA
- affiliation (former): ETH Zurich, Switzerland
- affiliation (PhD): MIT, Cambridge, MA, USA
- affiliation (former): Sharif University of Technology, Iran
Other persons with the same name
- Mohsen Ghaffari 0002
![[0000-0002-1939-9053]](https://dblp.org/img/orcid-mark.12x12.png "0000-0002-1939-9053")
— IT University of Copenhagen, Denmark (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[c112]Bernhard Haeupler, Jonas Hübotter, Mohsen Ghaffari:
A Cut-Matching Game for Constant-Hop Expanders. SODA 2025: 1651-1678- 2024
- [j12]Michal Dory, Mohsen Ghaffari, Saeed Ilchi:
Near-optimal distributed dominating set in bounded arboricity graphs. Distributed Comput. 37(4): 387-398 (2024) - [j11]Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Decentralized Low-Stretch Trees via Low Diameter Graph Decompositions. SIAM J. Comput. 53(2): 247-286 (2024) - [c111]Mohsen Ghaffari, Christoph Grunau:
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS. FOCS 2024: 2148-2179 - [c110]Mohsen Ghaffari, Anton Trygub:
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP. PODC 2024: 401-411 - [c109]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. SODA 2024: 4083-4123 - [c108]Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. SPAA 2024: 331-343 - [c107]Mohsen Ghaffari, Anton Trygub:
Parallel Dynamic Maximal Matching. SPAA 2024: 427-437 - [c106]Mohsen Ghaffari, Christoph Grunau:
Dynamic O(Arboricity) Coloring in Polylogarithmic Worst-Case Time. STOC 2024: 1184-1191 - [c105]Mohsen Ghaffari, Brandon Wang:
Lenzen's Distributed Routing Generalized: A Full Characterization of Constant-Time Routability. STOC 2024: 1877-1888 - [c104]Mohsen Ghaffari, Christoph Grunau:
Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. STOC 2024: 1889-1900 - [i78]Shashwat Chandra, Yi-Jun Chang, Michal Dory, Mohsen Ghaffari, Dean Leitersdorf:
Fast Broadcast in Highly Connected Networks. CoRR abs/2404.12930 (2024) - [i77]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Augusto Modanese, Dennis Olivetti, Mikaël Rabie, Jukka Suomela, Jara Uitto:
Shared Randomness Helps with Local Distributed Problems. CoRR abs/2407.05445 (2024) - [i76]Mohsen Ghaffari, Anton Trygub:
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP. CoRR abs/2409.15470 (2024) - [i75]Mohsen Ghaffari, Anton Trygub:
Parallel Dynamic Maximal Matching. CoRR abs/2409.15476 (2024) - [i74]Mohsen Ghaffari, Christoph Grunau:
Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS. CoRR abs/2410.19516 (2024) - [i73]Mohsen Ghaffari, Christoph Grunau:
Dynamic O(arboricity) coloring in polylogarithmic worst-case time. CoRR abs/2410.19536 (2024) - 2023
- [j10]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
Node and edge averaged complexities of local graph problems. Distributed Comput. 36(4): 451-473 (2023) - [c103]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. FOCS 2023: 1551-1562 - [c102]Mohsen Ghaffari, Julian Portmann:
Distributed MIS with Low Energy and Time Complexities. PODC 2023: 146-156 - [c101]Mohsen Ghaffari, Anton Trygub:
A Near-Optimal Deterministic Distributed Synchronizer. PODC 2023: 180-189 - [c100]Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. SODA 2023: 2532-2566 - [c99]Michal Dory, Mohsen Ghaffari:
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. SODA 2023: 4296-4334 - [c98]Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon:
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. SODA 2023: 4409-4447 - [c97]Mohsen Ghaffari, Christoph Grunau, Jiahao Qu:
Nearly Work-Efficient Parallel DFS in Undirected Graphs. SPAA 2023: 273-283 - [c96]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. SPAA 2023: 455-465 - [c95]Mohsen Ghaffari, Christoph Grunau:
Faster Deterministic Distributed MIS and Approximate Matching. STOC 2023: 1777-1790 - [i72]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
A Distributed Palette Sparsification Theorem. CoRR abs/2301.06457 (2023) - [i71]Mohsen Ghaffari, Christoph Grunau:
Faster Deterministic Distributed MIS and Approximate Matching. CoRR abs/2303.16043 (2023) - [i70]Mohsen Ghaffari, Christoph Grunau, Jiahao Qu:
Nearly Work-Efficient Parallel DFS in Undirected Graphs. CoRR abs/2304.09774 (2023) - [i69]Maxime Flin, Mohsen Ghaffari, Magnús M. Halldórsson, Fabian Kuhn, Alexandre Nolin:
Coloring Fast with Broadcasts. CoRR abs/2304.09844 (2023) - [i68]Mohsen Ghaffari, Julian Portmann:
Average Awake Complexity of MIS and Matching. CoRR abs/2305.06120 (2023) - [i67]Mohsen Ghaffari, Anton Trygub:
A Near-Optimal Deterministic Distributed Synchronizer. CoRR abs/2305.06452 (2023) - [i66]Mohsen Ghaffari, Julian Portmann:
Distributed MIS with Low Energy and Time Complexities. CoRR abs/2305.11639 (2023) - [i65]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Work-Efficient Parallel Derandomization I: Chernoff-like Concentrations via Pairwise Independence. CoRR abs/2311.13764 (2023) - [i64]Mohsen Ghaffari, Christoph Grunau:
Work-Efficient Parallel Derandomization II: Optimal Concentrations via Bootstrapping. CoRR abs/2311.13771 (2023) - 2022
- [c94]Mohsen Ghaffari:
Local Computation of Maximal Independent Set. FOCS 2022: 438-449 - [c93]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
Node and Edge Averaged Complexities of Local Graph Problems. PODC 2022: 4-14 - [c92]Mohsen Ghaffari, Goran Zuzic:
Universally-Optimal Distributed Exact Min-Cut. PODC 2022: 281-291 - [c91]Michal Dory, Mohsen Ghaffari, Saeed Ilchi:
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. PODC 2022: 292-300 - [c90]Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. SPAA 2022: 1-10 - [c89]Mohsen Ghaffari, Christoph Grunau, Slobodan Mitrovic:
Massively Parallel Algorithms for b-Matching. SPAA 2022: 35-44 - [c88]Mohsen Ghaffari, Julian Portmann:
Average Awake Complexity of MIS and Matching. SPAA 2022: 45-55 - [c87]Bernhard Haeupler, Harald Räcke, Mohsen Ghaffari:
Hop-constrained expander decompositions, oblivious routing, and distributed universal optimality. STOC 2022: 1325-1338 - [i63]Marcel Bezdrighin, Michael Elkin, Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Deterministic Distributed Sparse and Ultra-Sparse Spanners and Connectivity Certificates. CoRR abs/2204.14086 (2022) - [i62]Mohsen Ghaffari, Goran Zuzic:
Universally-Optimal Distributed Exact Min-Cut. CoRR abs/2205.14967 (2022) - [i61]Michal Dory, Mohsen Ghaffari, Saeed Ilchi:
Near-Optimal Distributed Dominating Set in Bounded Arboricity Graphs. CoRR abs/2206.05174 (2022) - [i60]Alkida Balliu, Mohsen Ghaffari, Fabian Kuhn, Dennis Olivetti:
Node and Edge Averaged Complexities of Local Graph Problems. CoRR abs/2208.08213 (2022) - [i59]Salwa Faour, Mohsen Ghaffari, Christoph Grunau, Fabian Kuhn, Václav Rozhon:
Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond. CoRR abs/2209.11651 (2022) - [i58]Mohsen Ghaffari, Christoph Grunau, Bernhard Haeupler, Saeed Ilchi, Václav Rozhon:
Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization. CoRR abs/2209.11669 (2022) - [i57]Mohsen Ghaffari:
Local Computation of Maximal Independent Set. CoRR abs/2210.01104 (2022) - [i56]Michal Dory, Mohsen Ghaffari:
A Nearly Time-Optimal Distributed Approximation of Minimum Cost k-Edge-Connected Spanning Subgraph. CoRR abs/2211.04994 (2022) - [i55]Mohsen Ghaffari, Christoph Grunau, Slobodan Mitrovic:
Massively Parallel Algorithms for b-Matching. CoRR abs/2211.07796 (2022) - [i54]Bernhard Haeupler, Jonas Hübotter, Mohsen Ghaffari:
A Cut-Matching Game for Constant-Hop Expanders. CoRR abs/2211.11726 (2022) - 2021
- [j9]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved distributed Δ-coloring. Distributed Comput. 34(4): 239-258 (2021) - [c86]Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. FOCS 2021: 1009-1020 - [c85]Mohsen Ghaffari:
Network Decomposition and Distributed Derandomization. ICDCN 2021: 1 - [c84]Mohsen Ghaffari, Bernhard Haeupler:
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. PODC 2021: 213-221 - [c83]Yi-Jun Chang, Mohsen Ghaffari:
Strong-Diameter Network Decomposition. PODC 2021: 273-281 - [c82]Mohsen Ghaffari, Bernhard Haeupler:
A Time-Optimal Randomized Parallel Algorithm for MIS. SODA 2021: 2892-2903 - [c81]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Improved Deterministic Network Decomposition. SODA 2021: 2904-2923 - [c80]Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari:
Massively Parallel Algorithms for Distance Approximation and Spanners. SPAA 2021: 118-128 - [c79]Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic:
Hop-constrained oblivious routing. STOC 2021: 1208-1220 - [i53]Yi-Jun Chang, Mohsen Ghaffari:
Strong-Diameter Network Decomposition. CoRR abs/2102.09820 (2021) - 2020
- [j8]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved distributed degree splitting and edge coloring. Distributed Comput. 33(3-4): 293-310 (2020) - [c78]Mohsen Ghaffari, Krzysztof Nowicki:
Massively Parallel Algorithms for Minimum Cut. PODC 2020: 119-128 - [c77]Mohsen Ghaffari:
Network Decomposition and Distributed Derandomization (Invited Paper). SIROCCO 2020: 3-18 - [c76]Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup:
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. SODA 2020: 1260-1279 - [c75]Mohsen Ghaffari, Ce Jin, Daan Nilis:
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. SPAA 2020: 259-268 - [c74]Václav Rozhon, Mohsen Ghaffari:
Polylogarithmic-time deterministic network decomposition and distributed derandomization. STOC 2020: 350-363 - [c73]Mohsen Ghaffari, Christoph Grunau, Ce Jin:
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. DISC 2020: 34:1-34:18 - [i52]Mohsen Ghaffari, Christoph Grunau, Ce Jin:
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond. CoRR abs/2002.09610 (2020) - [i51]Amartya Shankha Biswas, Michal Dory, Mohsen Ghaffari, Slobodan Mitrovic, Yasamin Nazari:
Massively Parallel Algorithms for Distance Approximation and Spanners. CoRR abs/2003.01254 (2020) - [i50]Mohsen Ghaffari, Ce Jin, Daan Nilis:
A Massively Parallel Algorithm for Minimum Weight Vertex Cover. CoRR abs/2005.10566 (2020) - [i49]Mohsen Ghaffari, Christoph Grunau, Václav Rozhon:
Improved Deterministic Network Decomposition. CoRR abs/2007.08253 (2020) - [i48]Mohsen Ghaffari, Bernhard Haeupler:
Low-Congestion Shortcuts for Graphs Excluding Dense Minors. CoRR abs/2008.03091 (2020) - [i47]Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition. CoRR abs/2011.04511 (2020) - [i46]Mohsen Ghaffari, Bernhard Haeupler, Goran Zuzic:
Hop-Constrained Oblivious Routing. CoRR abs/2011.10446 (2020)
2010 – 2019
- 2019
- [c72]Mohsen Ghaffari, Fabian Kuhn, Jara Uitto:
Conditional Hardness Results for Massively Parallel Computation from Distributed Lower Bounds. FOCS 2019: 1650-1663 - [c71]Mohsen Ghaffari, Ali Sayyadi:
Distributed Arboricity-Dependent Graph Coloring via All-to-All Communication. ICALP 2019: 142:1-142:14 - [c70]Mohsen Ghaffari, Silvio Lattanzi, Slobodan Mitrovic:
Improved Parallel Algorithms for Density-Based Network Clustering. ICML 2019: 2201-2210 - [c69]Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
On the Complexity of Distributed Splitting Problems. PODC 2019: 280-289 - [c68]Mohsen Ghaffari, Fabian Kuhn:
On the Use of Randomness in Local Distributed Graph Algorithms. PODC 2019: 290-299 - [c67]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: 471-480 - [c66]Michal Dory, Mohsen Ghaffari:
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. PODC 2019: 521-530 - [c65]Mohsen Ghaffari, David Wajc:
Simplified and Space-Optimal Semi-Streaming (2+epsilon)-Approximate Matching. SOSA 2019: 13:1-13:8 - [c64]Mohsen Ghaffari:
Distributed Maximal Independent Set using Small Messages. SODA 2019: 805-820 - [c63]Mohsen Ghaffari, Jara Uitto:
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. SODA 2019: 1636-1653 - [c62]John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Christian Scheideler, Fabian Kuhn, Jason Li:
Distributed Computation in Node-Capacitated Networks. SPAA 2019: 69-79 - [c61]Ruben Becker, Yuval Emek, Mohsen Ghaffari, Christoph Lenzen:
Distributed Algorithms for Low Stretch Spanning Trees. DISC 2019: 4:1-4:14 - [c60]Mohsen Ghaffari, Julian Portmann:
Improved Network Decompositions Using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. DISC 2019: 18:1-18:16 - [e1]Mohsen Ghaffari, Mikhail Nesterenko, Sébastien Tixeuil, Sara Tucci, Yukiko Yamauchi:
Stabilization, Safety, and Security of Distributed Systems - 21st International Symposium, SSS 2019, Pisa, Italy, October 22-25, 2019, Proceedings. Lecture Notes in Computer Science 11914, Springer 2019, ISBN 978-3-030-34991-2 [contents] - [i45]Michal Dory, Mohsen Ghaffari:
Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph. CoRR abs/1905.10833 (2019) - [i44]Philipp Bamberger, Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
On the Complexity of Distributed Splitting Problems. CoRR abs/1905.11573 (2019) - [i43]Mohsen Ghaffari, Fabian Kuhn:
On the Use of Randomness in Local Distributed Graph Algorithms. CoRR abs/1906.00482 (2019) - [i42]Václav Rozhon, Mohsen Ghaffari:
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization. CoRR abs/1907.10937 (2019) - [i41]Mohsen Ghaffari, Julian Portmann:
Improved Network Decompositions using Small Messages with Applications on MIS, Neighborhood Covers, and Beyond. CoRR abs/1908.03500 (2019) - [i40]Mohsen Ghaffari, Krzysztof Nowicki, Mikkel Thorup:
Faster Algorithms for Edge Connectivity via Random 2-Out Contractions. CoRR abs/1909.00844 (2019) - 2018
- [j7]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow. SIAM J. Comput. 47(6): 2078-2117 (2018) - [c59]Mohsen Ghaffari, David G. Harris, Fabian Kuhn:
On Derandomizing Local Distributed Algorithms. FOCS 2018: 662-673 - [c58]Andrea 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: 28:1-28:15 - [c57]Mohsen Ghaffari:
Session details: Session 2B: Routing and Leader Election. PODC 2018 - [c56]Mohsen Ghaffari, Themis Gouleakis, Christian Konrad, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. PODC 2018: 129-138 - [c55]Mohsen Ghaffari, Johannes Lengler:
Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics. PODC 2018: 305-313 - [c54]Mohsen Ghaffari, Krzysztof Nowicki:
Congested Clique Algorithms for the Minimum Cut Problem. PODC 2018: 357-366 - [c53]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved Distributed Delta-Coloring. PODC 2018: 427-436 - [c52]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
Deterministic distributed edge-coloring with fewer colors. STOC 2018: 418-430 - [c51]Mohsen Ghaffari, Jason Li:
Improved distributed algorithms for exact shortest paths. STOC 2018: 431-444 - [c50]Guy Even, Mohsen Ghaffari, Moti Medina:
Distributed Set Cover Approximation: Primal-Dual with Optimal Locality. DISC 2018: 22:1-22:14 - [c49]Manuela Fischer, Mohsen Ghaffari:
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. DISC 2018: 26:1-26:11 - [c48]Mohsen Ghaffari, Fabian Kuhn:
Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set. DISC 2018: 29:1-29:17 - [c47]Mohsen Ghaffari, Fabian Kuhn:
Distributed MST and Broadcast with Fewer Messages, and Faster Gossiping. DISC 2018: 30:1-30:12 - [c46]Mohsen Ghaffari, Jason Li:
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. DISC 2018: 31:1-31:16 - [i39]Manuela Fischer, Mohsen Ghaffari:
A Simple Parallel and Distributed Sampling Technique: Local Glauber Dynamics. CoRR abs/1802.06676 (2018) - [i38]Mohsen Ghaffari, Themis Gouleakis, Slobodan Mitrovic, Ronitt Rubinfeld:
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover. CoRR abs/1802.08237 (2018) - [i37]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus:
Improved Distributed Δ-Coloring. CoRR abs/1803.03248 (2018) - [i36]Mohsen Ghaffari, Jason Li:
New Distributed Algorithms in Almost Mixing Time via Transformations from Parallel Algorithms. CoRR abs/1805.04764 (2018) - [i35]John Augustine, Mohsen Ghaffari, Robert Gmyr, Kristian Hinnenthal, Fabian Kuhn, Jason Li, Christian Scheideler:
Distributed Computation in the Node-Congested Clique. CoRR abs/1805.07294 (2018) - [i34]Mohsen Ghaffari, Jara Uitto:
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation. CoRR abs/1807.06251 (2018) - [i33]Manuela Fischer, Mohsen Ghaffari, Jara Uitto:
Simple Graph Coloring Algorithms for Congested Clique and Massively Parallel Computation. CoRR abs/1808.08419 (2018) - 2017
- [b1]Mohsen Ghaffari:
Improved Distributed Algorithms for Fundamental Graph Problems. MIT, USA, 2017 - [j6]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Sampling. ACM Trans. Algorithms 13(2): 19:1-19:26 (2017) - [c45]Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. FOCS 2017: 180-191 - [c44]Mohsen Ghaffari, Fabian Kuhn, Hsin-Hao Su:
Distributed MST and Routing in Almost Mixing Time. PODC 2017: 131-140 - [c43]Mohsen Ghaffari:
Distributed MIS via All-to-All Communication. PODC 2017: 141-149 - [c42]Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. PODC 2017: 165-174 - [c41]Mohsen Ghaffari, David R. Karger, Debmalya Panigrahi:
Random Contractions and Sampling for Hypergraph and Hedge Connectivity. SODA 2017: 1101-1114 - [c40]Mohsen Ghaffari, Hsin-Hao Su:
Distributed Degree Splitting, Edge Coloring, and Orientations. SODA 2017: 2505-2523 - [c39]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus:
On the complexity of local distributed graph problems. STOC 2017: 784-797 - [c38]Manuela Fischer, Mohsen Ghaffari:
Sublogarithmic Distributed Algorithms for Lovász Local Lemma, and the Complexity Hierarchy. DISC 2017: 18:1-18:16 - [c37]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. DISC 2017: 19:1-19:15 - [c36]Mohsen Ghaffari, Christiana Lymouri:
Simple and Near-Optimal Distributed Coloring for Sparse Graphs. DISC 2017: 20:1-20:14 - [c35]Mohsen Ghaffari, Merav Parter:
Near-Optimal Distributed DFS in Planar Graphs. DISC 2017: 21:1-21:16 - [i32]Mohsen Ghaffari:
Space-Optimal Semi-Streaming for (2+ε)-Approximate Matching. CoRR abs/1701.03730 (2017) - [i31]Manuela Fischer, Mohsen Ghaffari:
Deterministic Distributed Matching: Simpler, Faster, Better. CoRR abs/1703.00900 (2017) - [i30]Manuela Fischer, Mohsen Ghaffari, Fabian Kuhn:
Deterministic Distributed Edge-Coloring via Hypergraph Maximal Matching. CoRR abs/1704.02767 (2017) - [i29]Manuela Fischer, Mohsen Ghaffari:
Sublogarithmic Distributed Algorithms for Lovász Local lemma, and the Complexity Hierarchy. CoRR abs/1705.04840 (2017) - [i28]Mohsen Ghaffari, Johannes Lengler:
Tight Analysis for the 3-Majority Consensus Dynamics. CoRR abs/1705.05583 (2017) - [i27]Mohsen Ghaffari, Juho Hirvonen, Fabian Kuhn, Yannic Maus, Jukka Suomela, Jara Uitto:
Improved Distributed Degree Splitting and Edge Coloring. CoRR abs/1706.04746 (2017) - [i26]Reuven Bar-Yehuda, Keren Censor-Hillel, Mohsen Ghaffari, Gregory Schwartzman:
Distributed Approximation of Maximum Independent Set and Maximum Matching. CoRR abs/1708.00276 (2017) - [i25]Mohsen Ghaffari, Christiana Lymouri:
Simple and Near-Optimal Distributed Coloring for Sparse Graphs. CoRR abs/1708.06275 (2017) - [i24]Mohsen Ghaffari, David G. Harris, Fabian Kuhn:
On Derandomizing Local Distributed Algorithms. CoRR abs/1711.02194 (2017) - [i23]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus, Jara Uitto:
Deterministic Distributed Edge-Coloring with Fewer Colors. CoRR abs/1711.05469 (2017) - [i22]Mohsen Ghaffari, Jason Li:
Improved Distributed Algorithms for Exact Shortest Paths. CoRR abs/1712.09121 (2017) - 2016
- [j5]Mohsen Ghaffari, Bernhard Haeupler:
Near-Optimal BFS-Tree Construction in Radio Networks. IEEE Commun. Lett. 20(6): 1172-1174 (2016) - [c34]Mohsen Ghaffari, Calvin C. Newport:
Leader Election in Unreliable Radio Networks. ICALP 2016: 138:1-138:14 - [c33]Mohsen Ghaffari, Merav Parter:
MST in Log-Star Rounds of Congested Clique. PODC 2016: 19-28 - [c32]Mohsen Ghaffari, Bernhard Haeupler:
Distributed Algorithms for Planar Networks I: Planar Embedding. PODC 2016: 29-38 - [c31]Mohsen Ghaffari, Merav Parter:
A Polylogarithmic Gossip Algorithm for Plurality Consensus. PODC 2016: 117-126 - [c30]Mohsen Ghaffari, Bernhard Haeupler:
Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut. SODA 2016: 202-219 - [c29]Mohsen Ghaffari:
An Improved Distributed Algorithm for Maximal Independent Set. SODA 2016: 270-277 - [c28]Mohsen Ghaffari, Merav Parter:
Near-Optimal Distributed Algorithms for Fault-Tolerant Tree Structures. SPAA 2016: 387-396 - [c27]Mohsen Ghaffari, Calvin C. Newport:
How to Discreetly Spread a Rumor in a Crowd. DISC 2016: 357-370 - [i21]Mohsen Ghaffari, Calvin Newport:
How to Discreetly Spread a Rumor in a Crowd. CoRR abs/1607.05697 (2016) - [i20]Mohsen Ghaffari, Hsin-Hao Su:
Distributed Degree Splitting, Edge Coloring, and Orientations. CoRR abs/1608.03220 (2016) - [i19]Mohsen Ghaffari, Fabian Kuhn, Yannic Maus:
On the Complexity of Local Distributed Graph Problems. CoRR abs/1611.02663 (2016) - 2015
- [j4]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Randomized broadcast in radio networks with collision detection. Distributed Comput. 28(6): 407-422 (2015) - [j3]Mohsen Ghaffari, Behnoosh Hariri, Shervin Shirmohammadi, Dewan Tanvir Ahmed:
A Dynamic Networking Substrate for Distributed MMOGs. IEEE Trans. Emerg. Top. Comput. 3(2): 289-302 (2015) - [c26]Mohsen Ghaffari:
Distributed Broadcast Revisited: Towards Universal Optimality. ICALP (2) 2015: 638-649 - [c25]Mohsen Ghaffari:
Near-Optimal Scheduling of Distributed Algorithms. PODC 2015: 3-12 - [c24]Mohsen Ghaffari, Cameron Musco, Tsvetomira Radeva, Nancy A. Lynch:
Distributed House-Hunting in Ant Colonies. PODC 2015: 57-66 - [c23]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow: Extended Abstract. PODC 2015: 81-90 - [c22]Mohsen Ghaffari, Rajan Udwani:
Brief Announcement: Distributed Single-Source Reachability. PODC 2015: 163-165 - [c21]Keren Censor-Hillel, Mohsen Ghaffari, George Giakkoupis, Bernhard Haeupler, Fabian Kuhn:
Tight Bounds on Vertex Connectivity Under Vertex Sampling. SODA 2015: 2006-2018 - [i18]Mohsen Ghaffari, Cameron Musco, Tsvetomira Radeva, Nancy A. Lynch:
Distributed House-Hunting in Ant Colonies. CoRR abs/1505.03799 (2015) - [i17]Mohsen Ghaffari:
Towards an Optimal Distributed Algorithm for Maximal Independent Set. CoRR abs/1506.05093 (2015) - [i16]Mohsen Ghaffari, Andreas Karrenbauer, Fabian Kuhn, Christoph Lenzen, Boaz Patt-Shamir:
Near-Optimal Distributed Maximum Flow. CoRR abs/1508.04747 (2015) - 2014
- [c20]Mohsen Ghaffari, Bernhard Haeupler:
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. FOCS 2014: 394-403 - [c19]Mohsen Ghaffari:
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set. ICALP (2) 2014: 483-494 - [c18]Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit:
On the Importance of Registers for Computability. OPODIS 2014: 171-185 - [c17]Mohsen Ghaffari, Erez Kantor, Nancy A. Lynch, Calvin C. Newport:
Multi-message broadcast with abstract MAC layers and unreliable links. PODC 2014: 56-65 - [c16]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
Distributed connectivity decomposition. PODC 2014: 156-165 - [c15]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
A New Perspective on Vertex Connectivity. SODA 2014: 546-561 - [c14]Noga Alon, Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Broadcast Throughput in Radio Networks: Routing vs. Network Coding. SODA 2014: 1831-1843 - [c13]Mohsen Ghaffari, Bernhard Haeupler, Madhu Sudan:
Optimal error rates for interactive coding I: adaptivity and other settings. STOC 2014: 794-803 - [c12]Mohsen Ghaffari, Christoph Lenzen:
Near-Optimal Distributed Tree Embedding. DISC 2014: 197-211 - [i15]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Randomized Broadcast in Radio Networks with Collision Detection. CoRR abs/1404.0780 (2014) - [i14]Mohsen Ghaffari, Bernhard Haeupler:
Fast Structuring of Radio Networks for Multi-Message Communications. CoRR abs/1404.2387 (2014) - [i13]Mohsen Ghaffari:
Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set. CoRR abs/1404.7559 (2014) - [i12]Mohsen Ghaffari, Erez Kantor, Nancy A. Lynch, Calvin C. Newport:
Multi-Message Broadcast with Abstract MAC Layers and Unreliable Links. CoRR abs/1405.1671 (2014) - [i11]Rati Gelashvili, Mohsen Ghaffari, Jerry Li, Nir Shavit:
On the Importance of Registers for Computability. CoRR abs/1411.0168 (2014) - 2013
- [c11]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
Randomized broadcast in radio networks with collision detection. PODC 2013: 325-334 - [c10]Sebastian Daum, Mohsen Ghaffari, Seth Gilbert, Fabian Kuhn, Calvin C. Newport:
Maximal independent sets in multichannel radio networks. PODC 2013: 335-344 - [c9]Mohsen Ghaffari, Nancy A. Lynch, Calvin C. Newport:
The cost of radio network broadcast for different models of unreliable links. PODC 2013: 345-354 - [c8]Mohsen Ghaffari, Bernhard Haeupler:
Near Optimal Leader Election in Multi-Hop Radio Networks. SODA 2013: 748-766 - [c7]Mohsen Ghaffari, Fabian Kuhn:
Distributed Minimum Cut Approximation. DISC 2013: 1-15 - [c6]Mohsen Ghaffari, Bernhard Haeupler:
Fast Structuring of Radio Networks Large for Multi-message Communications. DISC 2013: 492-506 - [i10]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
A Bound on the Throughput of Radio Networks. CoRR abs/1302.0264 (2013) - [i9]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
A New Perspective on Vertex Connectivity. CoRR abs/1304.4553 (2013) - [i8]Mohsen Ghaffari, Fabian Kuhn:
Distributed Minimum Cut Approximation. CoRR abs/1305.5520 (2013) - [i7]Keren Censor-Hillel, Mohsen Ghaffari, Fabian Kuhn:
Distributed Connectivity Decomposition. CoRR abs/1311.5317 (2013) - [i6]Mohsen Ghaffari, Bernhard Haeupler:
Optimal Error Rates for Interactive Coding II: Efficiency and List Decoding. CoRR abs/1312.1763 (2013) - [i5]Mohsen Ghaffari, Bernhard Haeupler, Madhu Sudan:
Optimal Error Rates for Interactive Coding I: Adaptivity and Other Settings. CoRR abs/1312.1764 (2013) - 2012
- [j2]Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry:
Leader election using loneliness detection. Distributed Comput. 25(6): 427-450 (2012) - [c5]Mohsen Ghaffari, Seth Gilbert, Calvin C. Newport, Henry Tan:
Optimal Broadcast in Shared Spectrum Radio Networks. OPODIS 2012: 181-195 - [c4]Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport:
Bounds on Contention Management in Radio Networks. DISC 2012: 223-237 - [i4]Mohsen Ghaffari, Bernhard Haeupler, Majid Khabbazian:
The Complexity of Multi-Message Broadcast in Radio Networks with Known Topology. CoRR abs/1205.7014 (2012) - [i3]Mohsen Ghaffari, Bernhard Haeupler, Nancy A. Lynch, Calvin C. Newport:
Bounds on Contention Management in Radio Networks. CoRR abs/1206.0154 (2012) - [i2]Mohsen Ghaffari, Bernhard Haeupler:
Near Optimal Leader Election in Multi-Hop Radio Networks. CoRR abs/1210.8439 (2012) - 2011
- [c3]Mohsen Ghaffari, Nancy A. Lynch, Srikanth Sastry:
Leader Election Using Loneliness Detection. DISC 2011: 268-282 - 2010
- [j1]Mohsen Ghaffari, Behnoosh Hariri, Shervin Shirmohammadi:
On the necessity of using Delaunay Triangulation substrate in greedy routing based networks. IEEE Commun. Lett. 14(3): 266-268 (2010)
2000 – 2009
- 2009
- [c2]Mohsen Ghaffari, Behnoosh Hariri, Shervin Shirmohammadi:
A delaunay triangulation architecture supporting churn and user mobility in MMVEs. NOSSDAV 2009: 61-66 - [c1]Mohsen Ghaffari, Farid Ashtiani:
A new routing algorithm for sparse vehicular ad-hoc networks with moving destinations. WCNC 2009: 2750-2755 - [i1]Mohsen Ghaffari, Behnoosh Hariri, Shervin Shirmohammadi:
On the Necessary and Sufficient Condition of Greedy Routing Supporting Geographical Data Networks. CoRR abs/0903.5208 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:19 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
