| 2008 |
|---|
| 64 | EE | Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Lingas,
Martin Wahlen:
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.
DISC 2008: 274-288 |
| 63 | EE | Chryssis Georgiou,
Seth Gilbert,
Rachid Guerraoui,
Dariusz R. Kowalski:
On the complexity of asynchronous gossip.
PODC 2008: 135-144 |
| 62 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
Asynchronous exclusive selection.
PODC 2008: 375-384 |
| 61 | EE | David Ilcinkas,
Dariusz R. Kowalski,
Andrzej Pelc:
Fast Radio Broadcasting with Advice.
SIROCCO 2008: 291-305 |
| 60 | EE | Dariusz R. Kowalski,
Alexander A. Shvartsman:
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors.
ACM Transactions on Algorithms 4(3): (2008) |
| 59 | EE | Leszek Gasieniec,
Erez Kantor,
Dariusz R. Kowalski,
David Peleg,
Chang Su:
Time efficient k-shot broadcasting in known topology radio networks.
Distributed Computing 21(2): 117-127 (2008) |
| 58 | EE | Bogdan S. Chlebus,
Leszek Gasieniec,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
A robust randomized algorithm to perform independent tasks.
J. Discrete Algorithms 6(4): 651-665 (2008) |
| 57 | EE | Dariusz R. Kowalski,
Adam Malinowski:
How to meet in anonymous network.
Theor. Comput. Sci. 399(1-2): 141-156 (2008) |
| 2007 |
|---|
| 56 | EE | Leszek Gasieniec,
Erez Kantor,
Dariusz R. Kowalski,
David Peleg,
Chang Su:
Energy and Time Efficient Broadcasting in Known Topology Radio Networks.
DISC 2007: 253-267 |
| 55 | EE | Seth Gilbert,
Rachid Guerraoui,
Dariusz R. Kowalski:
On the Message Complexity of Indulgent Consensus.
DISC 2007: 283-297 |
| 54 | EE | Dariusz R. Kowalski,
Michal Strojnowski:
On the Communication Surplus Incurred by Faulty Processors.
DISC 2007: 328-342 |
| 53 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Mariusz A. Rokicki:
Stability of the Multiple-Access Channel Under Maximum Broadcast Loads.
SSS 2007: 124-138 |
| 52 | EE | Jurek Czyzowicz,
Dariusz R. Kowalski,
Euripides Markou,
Andrzej Pelc:
Searching for a Black Hole in Synchronous Tree Networks.
Combinatorics, Probability & Computing 16(4): 595-619 (2007) |
| 51 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Optimal Deterministic Broadcasting in Known Topology Radio Networks.
Distributed Computing 19(3): 185-195 (2007) |
| 50 | EE | Marek Chrobak,
Leszek Gasieniec,
Dariusz R. Kowalski:
The Wake-Up Problem in MultiHop Radio Networks.
SIAM J. Comput. 36(5): 1453-1471 (2007) |
| 2006 |
|---|
| 49 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
Time and Communication Efficient Consensus for Crash Failures.
DISC 2006: 314-328 |
| 48 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Tomasz Radzik:
On Many-to-Many Communication in Packet Radio Networks.
OPODIS 2006: 260-274 |
| 47 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Mariusz A. Rokicki:
Adversarial queuing on the multiple-access channel.
PODC 2006: 92-101 |
| 46 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Mariusz A. Rokicki:
Average-Time Complexity of Gossiping in Radio Networks.
SIROCCO 2006: 253-267 |
| 45 | EE | Dariusz R. Kowalski,
Adam Malinowski:
How to Meet in Anonymous Network.
SIROCCO 2006: 44-58 |
| 44 | EE | Anders Dessmark,
Pierre Fraigniaud,
Dariusz R. Kowalski,
Andrzej Pelc:
Deterministic Rendezvous in Graphs.
Algorithmica 46(1): 69-96 (2006) |
| 43 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Andrzej Lingas:
Performing work in broadcast networks.
Distributed Computing 18(6): 435-451 (2006) |
| 42 | EE | Jurek Czyzowicz,
Dariusz R. Kowalski,
Euripides Markou,
Andrzej Pelc:
Complexity of Searching for a Black Hole.
Fundam. Inform. 71(2-3): 229-242 (2006) |
| 41 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
Robust gossiping with an application to consensus.
J. Comput. Syst. Sci. 72(8): 1262-1281 (2006) |
| 40 | EE | Alexander Kesselman,
Dariusz R. Kowalski:
Fast distributed algorithm for convergecast in ad hoc geometric radio networks.
J. Parallel Distrib. Comput. 66(4): 578-585 (2006) |
| 39 | EE | Pierre Fraigniaud,
Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Pelc:
Collective tree exploration.
Networks 48(3): 166-177 (2006) |
| 2005 |
|---|
| 38 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
Almost Optimal Explicit Selectors.
FCT 2005: 270-280 |
| 37 | EE | Bogdan S. Chlebus,
Leszek Gasieniec,
Dariusz R. Kowalski,
Tomasz Radzik:
On the Wake-Up Problem in Radio Networks.
ICALP 2005: 347-359 |
| 36 | EE | Dariusz R. Kowalski,
Peter M. Musial,
Alexander A. Shvartsman:
Explicit Combinatorial Structures for Cooperative Distributed Algorithms.
ICDCS 2005: 49-58 |
| 35 | EE | Kishori M. Konwar,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
Node Discovery in Networks.
OPODIS 2005: 206-220 |
| 34 | EE | Dariusz R. Kowalski:
On selection problem in radio networks.
PODC 2005: 158-166 |
| 33 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
Cooperative asynchronous update of shared memory.
STOC 2005: 733-739 |
| 32 | EE | Alexander Kesselman,
Dariusz R. Kowalski:
Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks.
WONS 2005: 119-124 |
| 31 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Broadcasting in undirected ad hoc radio networks.
Distributed Computing 18(1): 43-57 (2005) |
| 30 | EE | Dariusz R. Kowalski,
Alexander A. Shvartsman:
Performing work with asynchronous processors: Message-delay-sensitive bounds.
Inf. Comput. 203(2): 181-210 (2005) |
| 29 | EE | Alexander Kesselman,
Dariusz R. Kowalski,
Michael Segal:
Energy efficient communication in ad hoc networks from user's and designer's perspective.
Mobile Computing and Communications Review 9(1): 15-26 (2005) |
| 28 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism.
Theor. Comput. Sci. 333(3): 355-371 (2005) |
| 27 | EE | Chryssis Georgiou,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
Efficient gossip and robust distributed computation.
Theor. Comput. Sci. 347(1-2): 130-166 (2005) |
| 2004 |
|---|
| 26 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks.
APPROX-RANDOM 2004: 171-182 |
| 25 | EE | Kishori M. Konwar,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
The Join Problem in Dynamic Network Algorithms.
DSN 2004: 315-324 |
| 24 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Polynomial Deterministic Rendezvous in Arbitrary Graphs.
ISAAC 2004: 644-656 |
| 23 | EE | Pierre Fraigniaud,
Leszek Gasieniec,
Dariusz R. Kowalski,
Andrzej Pelc:
Collective Tree Exploration.
LATIN 2004: 141-151 |
| 22 | EE | Jurek Czyzowicz,
Dariusz R. Kowalski,
Euripides Markou,
Andrzej Pelc:
Searching for a Black Hole in Tree Networks.
OPODIS 2004: 67-80 |
| 21 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
A better wake-up in radio networks.
PODC 2004: 266-274 |
| 20 | EE | Marek Chrobak,
Leszek Gasieniec,
Dariusz R. Kowalski:
The wake-up problem in multi-hop radio networks.
SODA 2004: 992-1000 |
| 19 | EE | Dariusz R. Kowalski,
Alexander A. Shvartsman:
Writing-all deterministically and optimally using a non-trivial number of asynchronous processors.
SPAA 2004: 311-320 |
| 18 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
Collective asynchronous reading with polylogarithmic worst-case overhead.
STOC 2004: 321-330 |
| 17 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
Randomization helps to perform independent tasks reliably.
Random Struct. Algorithms 24(1): 11-41 (2004) |
| 16 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge.
SIAM J. Comput. 33(4): 870-891 (2004) |
| 15 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Faster Deterministic Broadcasting in Ad Hoc Radio Networks.
SIAM J. Discrete Math. 18(2): 332-346 (2004) |
| 2003 |
|---|
| 14 | EE | Chryssis Georgiou,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
Efficient Gossip and Robust Distributed Computation.
DISC 2003: 224-238 |
| 13 | EE | Dariusz R. Kowalski,
Mariam Momenzadeh,
Alexander A. Shvartsman:
Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems.
OPODIS 2003: 210-222 |
| 12 | EE | Dariusz R. Kowalski,
Alexander A. Shvartsman:
Performing work with asynchronous processors: message-delay-sensitive bounds.
PODC 2003: 265-274 |
| 11 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Broadcasting in undirected ad hoc radio networks.
PODC 2003: 73-82 |
| 10 | | Dariusz R. Kowalski,
Andrzej Pelc:
Time of Radio Broadcasting.
SIROCCO 2003: 195-210 |
| 9 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Faster Deterministic Broadcasting in Ad Hoc Radio Networks.
STACS 2003: 109-120 |
| 8 | EE | Bogdan S. Chlebus,
Karol Golab,
Dariusz R. Kowalski:
Broadcasting Spanning Forests on a Multiple-Access Channel.
Theory Comput. Syst. 36(6): 711-733 (2003) |
| 2002 |
|---|
| 7 | EE | Bogdan S. Chlebus,
Leszek Gasieniec,
Dariusz R. Kowalski,
Alexander A. Shvartsman:
Bounding Work and Communication in Robust Cooperative Computation.
DISC 2002: 295-310 |
| 6 | EE | Dariusz R. Kowalski,
Andrzej Pelc:
Deterministic Broadcasting Time in Radio Networks of Unknown Topology.
FOCS 2002: 63-72 |
| 5 | | Bogdan S. Chlebus,
Karol Golab,
Dariusz R. Kowalski:
Finding Spanning Forests by Broadcasting.
SIROCCO 2002: 41-56 |
| 4 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
Gossiping to reach consensus.
SPAA 2002: 220-229 |
| 2001 |
|---|
| 3 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski,
Andrzej Lingas:
The do-all problem in broadcast networks.
PODC 2001: 117-127 |
| 2 | EE | Bogdan S. Chlebus,
Stefan Dobrev,
Dariusz R. Kowalski,
Grzegorz Malewicz,
Alexander A. Shvartsman,
Imrich Vrto:
Towards practical deteministic write-all algorithms.
SPAA 2001: 271-280 |
| 1999 |
|---|
| 1 | EE | Bogdan S. Chlebus,
Dariusz R. Kowalski:
Randomization Helps to Perform Tasks on Processors Prone to Failures.
DISC 1999: 284-296 |
