21 citations · 75 across the 21 of their papers we have counts for
10 papers · 1 filter
Routing Schemes for Hybrid Communication Networks
Sam Coy, Artur Czumaj, Christian Scheideler +2
We consider the problem of computing routing schemes in the model of distributed computing where nodes have access to two fundamentally different communication mo…
Near-Shortest Path Routing in Hybrid Communication Networks
Sam Coy, Artur Czumaj, Michael Feldmann +5
Hybrid networks, i.e., networks that leverage different means of communication, become ever more widespread. To allow theoretical study of such networks, [Augustine et al., SODA'20…
On Truly Parallel Time in Population Protocols
Artur Czumaj, Andrzej Lingas
The {\em parallel time} of a population protocol is defined as the average number of required interactions that an agent in the protocol participates, i.e., the quotient between th…
Detecting cliques in CONGEST networks
Artur Czumaj, Christian Konrad
The problem of detecting network structures plays a central role in distributed computing. One of the fundamental problems studied in this area is to determine whether for a given…
Randomized Communication Without Network Knowledge
Artur Czumaj, Peter Davies
Radio networks are a long-studied model for distributed system of devices which communicate wirelessly. When these devices are mobile or have limited capabilities, the system is of…
Deterministic Blind Radio Networks
Artur Czumaj, Peter Davies
Ad-hoc radio networks and multiple access channels are classical and well-studied models of distributed systems, with a large body of literature on deterministic algorithms for fun…
Exploiting Spontaneous Transmissions for Broadcasting and Leader Election in Radio Networks
Artur Czumaj, Peter Davies
We study two fundamental communication primitives: broadcasting and leader election in the classical model of multi-hop radio networks with unknown topology and without collision d…
Deterministic Communication in Radio Networks
Artur Czumaj, Peter Davies
In this paper we improve the deterministic complexity of two fundamental communication primitives in the classical model of ad-hoc radio networks with unknown topology: broadcastin…
Leader Election in Multi-Hop Radio Networks
Artur Czumaj, Peter Davies
In this paper we present a framework for leader election in multi-hop radio networks which yield randomized leader election algorithms taking in expec…
Communicating with Beeps
Artur Czumaj, Peter Davies
The \emph{beep model} is a very weak communications model in which devices in a network can communicate only via beeps and silence. As a result of its weak assumptions, it has broa…