1 citations · 1 across the 1 of their papers we have counts for
4 papers
Distributed Maximum Matching Verification in CONGEST
Mohamad Ahmadi, Fabian Kuhn
We study the maximum cardinality matching problem in a standard distributed setting, where the nodes of a given -node network graph communicate over the edges …
The Communication Cost of Information Spreading in Dynamic Networks
Mohamad Ahmadi, Fabian Kuhn, Shay Kutten +2
This paper investigates the message complexity of distributed information spreading (a.k.a gossip or token dissemination) in adversarial dynamic networks, where the goal is to spre…
Multi-Message Broadcast in Dynamic Radio Networks
Mohamad Ahmadi, Fabian Kuhn
We continue the recent line of research studying information dissemination problems in adversarial dynamic radio networks. We give two generic algorithms which allow to transform g…
The Cost of Global Broadcast in Dynamic Radio Networks
Mohamad Ahmadi, Abdolhamid Ghodselahi, Fabian Kuhn +1
We study the single-message broadcast problem in dynamic radio networks. We show that the time complexity of the problem depends on the amount of stability and connectivity of the…