34 citations · 45 across the 12 of their papers we have counts for
16 papers
Search and evacuation with a near majority of faulty agents
J. Czyzowicz, R. Killick, E. Kranakis +1
There are unit speed mobile agents placed at the origin of the infinite line. In as little time as possible, the agents must find and evacuate from an exit placed at an i…
Selective Population Protocols
Adam Gańczorz, Leszek Gąsieniec, Tomasz Jurdziński +2
The model of population protocols provides a universal platform to study distributed processes driven by pairwise interactions of anonymous agents. While population protocols prese…
Deterministic non-adaptive contention resolution on a shared channel
Gianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak
In a multiple access channel, autonomous stations are able to transmit and listen to a shared device. A fundamental problem, called \textit{contention resolution}, is to allow any…
Time and Energy Efficient Contention Resolution in Asynchronous Shared Channels
Gianluca De Marco, Dariusz R. Kowalski, Grzegorz Stachowiak
A number of stations, independently activated over time, is able to communicate by transmitting and listening to a shared channel in discrete time slots, and a message is successfu…
New Clocks, Optimal Line Formation and Self-Replication Population Protocols
Leszek Gasieniec, Paul Spirakis, Grzegorz Stachowiak
In this paper we consider a variant of population protocols in which agents are allowed to be connected by edges, known as the constructors model. During an interaction between two…
A time and space optimal stable population protocol solving exact majority
David Doty, Mahsa Eftekhari, Leszek Gąsieniec +3
We study population protocols, a model of distributed computing appropriate for modeling well-mixed chemical reaction networks and other physical systems where agents exchange info…