The following pages link to Mohsen Ghaffari (Q901871):
Displaying 50 items.
- Randomized broadcast in radio networks with collision detection (Q901873) (← links)
- How to discreetly spread a rumor in a crowd (Q1660945) (← links)
- Leader election using loneliness detection (Q1938387) (← links)
- Improved distributed \(\Delta\)-coloring (Q1981630) (← links)
- Improved distributed degree splitting and edge coloring (Q2189174) (← links)
- Near-Optimal Scheduling of Distributed Algorithms (Q2796236) (← links)
- Distributed House-Hunting in Ant Colonies (Q2796242) (← links)
- Near-Optimal Distributed Maximum Flow (Q2796244) (← links)
- Distributed Minimum Cut Approximation (Q2920962) (← links)
- Multi-message broadcast with abstract MAC layers and unreliable links (Q2943610) (← links)
- Distributed connectivity decomposition (Q2943618) (← links)
- Leader Election Using Loneliness Detection (Q3095332) (← links)
- Distributed Broadcast Revisited: Towards Universal Optimality (Q3449512) (← links)
- Near-Optimal Distributed Maximum Flow (Q4561245) (← links)
- Distributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut (Q4575592) (← links)
- An Improved Distributed Algorithm for Maximal Independent Set (Q4575597) (← links)
- Random Contractions and Sampling for Hypergraph and Hedge Connectivity (Q4575812) (← links)
- Distributed Degree Splitting, Edge Coloring, and Orientations (Q4575915) (← links)
- Leader Election in Unreliable Radio Networks. (Q4598281) (← links)
- Bounds on Contention Management in Radio Networks (Q4909414) (← links)
- Tight Bounds on Vertex Connectivity Under Sampling (Q4962652) (← links)
- On the complexity of local distributed graph problems (Q4978023) (← links)
- (Q5005128) (← links)
- Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
- (Q5090918) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- (Q5090922) (← links)
- (Q5090923) (← links)
- (Q5092346) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Polylogarithmic-time deterministic network decomposition and distributed derandomization (Q5144922) (← links)
- On the Complexity of Distributed Splitting Problems (Q5145221) (← links)
- On the Use of Randomness in Local Distributed Graph Algorithms (Q5145222) (← links)
- The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation (Q5145259) (← links)
- Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph (Q5145264) (← links)
- Faster Algorithms for Edge Connectivity via Random 2-Out Contractions (Q5146849) (← links)
- Near-Optimal Distributed Approximation of Minimum-Weight Connected Dominating Set (Q5167862) (← links)
- Randomized broadcast in radio networks with collision detection (Q5176111) (← links)
- Maximal independent sets in multichannel radio networks (Q5176112) (← links)
- The cost of radio network broadcast for different models of unreliable links (Q5176113) (← links)
- Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover (Q5197674) (← links)
- Nearly-Tight Analysis for 2-Choice and 3-Majority Consensus Dynamics (Q5197695) (← links)
- Congested Clique Algorithms for the Minimum Cut Problem (Q5197700) (← links)
- Improved Distributed Delta-Coloring (Q5197708) (← links)
- Deterministic distributed edge-coloring with fewer colors (Q5230307) (← links)
- Improved distributed algorithms for exact shortest paths (Q5230308) (← links)
- Distributed Maximal Independent Set using Small Messages (Q5236233) (← links)
- Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation (Q5236283) (← links)
- Optimal error rates for interactive coding I (Q5259615) (← links)
- MST in Log-Star Rounds of Congested Clique (Q5361911) (← links)
