Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Dariusz R. Kowalski
Darek Kowalski
Author information
- University of Liverpool
2010 – today
- 2013
[j35]Chryssis Georgiou, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski: Asynchronous gossip. J. ACM 60(2): 11 (2013)- [j34]Gianluca De Marco, Dariusz R. Kowalski: Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non-adaptiveness. Random Struct. Algorithms 42(1): 97-109 (2013)
- [c71]Dariusz R. Kowalski, Christopher Thraves Caro: Estimating Time Complexity of Rumor Spreading in Ad-Hoc Networks. ADHOC-NOW 2013: 245-256
- [i6]Tomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak: Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks. CoRR abs/1302.4059 (2013)
- 2012
- [j33]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Adversarial Queuing on the Multiple Access Channel. ACM Transactions on Algorithms 8(1): 5 (2012)
- [c70]Dariusz R. Kowalski, Zeev Nutov, Michael Segal: Scheduling of Vehicles in Transportation Networks. Nets4Cars/Nets4Trains 2012: 124-136
- [c69]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc: Electing a Leader in Multi-hop Radio Networks. OPODIS 2012: 106-120
- [c68]Tomasz Jurdzinski, Dariusz R. Kowalski: On the Complexity of Distributed Broadcasting and MDS Construction in Radio Networks. OPODIS 2012: 209-223
- [c67]
- [c66]Tomasz Jurdzinski, Dariusz R. Kowalski: Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks. DISC 2012: 106-120
- [c65]Marcin Bienkowski, Tomasz Jurdzinski, Miroslaw Korzeniowski, Dariusz R. Kowalski: Distributed Online and Stochastic Queuing on a Multiple Access Channel. DISC 2012: 121-135
- [e2]Darek Kowalski, Alessandro Panconesi (Eds.): ACM Symposium on Principles of Distributed Computing, PODC '12, Funchal, Madeira, Portugal, July 16-18, 2012. ACM 2012, ISBN 978-1-4503-1450-3
- [i5]Tomasz Jurdzinski, Dariusz R. Kowalski: Distributed backbone structure for deterministic algorithms in the SINR model of wireless networks. CoRR abs/1207.0602 (2012)
- [i4]Tomasz Jurdzinski, Dariusz R. Kowalski, Tomasz Maciejewski, Grzegorz Stachowiak: Distributed Broadcasting in Wireless Networks under the SINR Model. CoRR abs/1207.6732 (2012)
- [i3]Tomasz Jurdzinski, Dariusz R. Kowalski, Grzegorz Stachowiak: Distributed Deterministic Broadcasting in Wireless Networks under the SINR Model. CoRR abs/1210.1804 (2012)
- 2011
- [j32]Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski: Meeting the deadline: on the complexity of fault-tolerant continuous gossip. Distributed Computing 24(5): 223-244 (2011)
- [j31]Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc: Consensus and Mutual Exclusion in a Multiple Access Channel. IEEE Trans. Parallel Distrib. Syst. 22(7): 1092-1104 (2011)
- [c64]Dariusz R. Kowalski, Pierre Sens, Antonio Fernández Anta, Guillaume Pierre: Introduction. Euro-Par (1) 2011: 554
- [c63]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc, Mariusz A. Rokicki: Efficient Distributed Communication in Ad-Hoc Radio Networks. ICALP (2) 2011: 613-624
- [c62]
- [c61]Majid Khabbazian, Dariusz R. Kowalski: Time-efficient randomized multiple-message broadcast in radio networks. PODC 2011: 373-380
- [c60]Emmanuel Agiriga, Frans Coenen, Jane Hurst, Robert J. Beynon, Darek Kowalski: Towards Large-Scale Multi-Agent Based Rodent Simulation: The "Mice In A Box" Scenario. SGAI Conf. 2011: 369-382
- [c59]Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Medium Access Control for Adversarial Channels with Jamming. SIROCCO 2011: 89-100
- [c58]Dariusz R. Kowalski, Mariusz A. Rokicki: Multi-channel Assignment for Communication in Radio Networks. TAPAS 2011: 181-192
- [c57]Chryssis Georgiou, Dariusz R. Kowalski: Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts. DISC 2011: 165-180
- [e1]Augustin Chaintreau, Dariusz R. Kowalski (Eds.): FOMC'11, The Seventh ACM SIGACT/SIGMOBILE International Workshop on Foundations of Mobile Computing (part of FCRC 2011), San Jose, CA, USA, June 9, 2011, Proceedings. ACM 2011, ISBN 978-1-4503-0779-6
- 2010
- [j30]Vicent Cholvi, Dariusz R. Kowalski: Bounds on Stability and Latency in Wireless Communication. IEEE Communications Letters 14(9): 842-844 (2010)
- [j29]Dariusz R. Kowalski, Mariam Momenzadeh, Alexander A. Shvartsman: Emulating shared-memory Do-All algorithms in asynchronous message-passing systems. J. Parallel Distrib. Comput. 70(6): 699-705 (2010)
- [j28]David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc: Fast radio broadcasting with advice. Theor. Comput. Sci. 411(14-15): 1544-1557 (2010)
- [c56]Majid Khabbazian, Fabian Kuhn, Dariusz R. Kowalski, Nancy A. Lynch: Decomposing broadcast algorithms using abstract MAC layers. DIALM-PODC 2010: 13-22
- [c55]Gianluca De Marco, Dariusz R. Kowalski: Towards Power-Sensitive Communication on a Multiple-Access Channel. ICDCS 2010: 728-735
- [c54]Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Deterministic Broadcast on Multiple Access Channels. INFOCOM 2010: 146-150
- [c53]Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowalski: Meeting the deadline: on the complexity of fault-tolerant continuous gossip. PODC 2010: 247-256
- [c52]Seth Gilbert, Dariusz R. Kowalski: Distributed Agreement with Optimal Communication Complexity. SODA 2010: 965-977
- [c51]Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski: Dynamic Sharing of a Multiple Access Channel. STACS 2010: 83-94
- [c50]Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski: Scalable Quantum Consensus for Crash Failures. DISC 2010: 236-250
- [c49]Dariusz R. Kowalski, Mariusz A. Rokicki: Connectivity Problem in Wireless Networks. DISC 2010: 344-358
- [c48]Seth Gilbert, Dariusz R. Kowalski: Trusted Computing for Fault-Prone Wireless Networks. DISC 2010: 359-373
- [i2]Marcin Bienkowski, Marek Klonowski, Miroslaw Korzeniowski, Dariusz R. Kowalski: Dynamic sharing of a multiple access channel. CoRR abs/1001.3044 (2010)
- [i1]Vicent Cholvi, Dariusz R. Kowalski: Bounds on Stability and Latency in Wireless Communication. CoRR abs/1006.1345 (2010)
2000 – 2009
- 2009
- [j27]Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik: Many-to-Many Communication in Radio Networks. Algorithmica 54(1): 118-139 (2009)
- [j26]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Maximum throughput of multiple access channels in adversarial environments. Distributed Computing 22(2): 93-116 (2009)
- [j25]Dariusz R. Kowalski, Michal Strojnowski: Gossiping by processors prone to omission failures. Inf. Process. Lett. 109(6): 308-314 (2009)
- [j24]Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman: Node discovery in networks. J. Parallel Distrib. Comput. 69(4): 337-348 (2009)
- [j23]Seth Gilbert, Dariusz R. Kowalski: Reliability and security in wireless networks. SIGACT News 40(4): 86-87 (2009)
- [c47]Dariusz R. Kowalski, Andrzej Pelc: Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. ICALP (2) 2009: 521-533
- [c46]Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski, Calvin C. Newport: Interference-Resilient Information Exchange. INFOCOM 2009: 2249-2257
- [c45]Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski: Fast scalable deterministic consensus for crash failures. PODC 2009: 111-120
- [c44]Bogdan S. Chlebus, Dariusz R. Kowalski: Locally scalable randomized consensus for synchronous crash failures. SPAA 2009: 290-299
- [c43]Jurek Czyzowicz, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc: Consensus and Mutual Exclusion in a Multiple Access Channel. DISC 2009: 512-526
- 2008
- [j22]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)
- [j21]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)
- [j20]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)
- [j19]Dariusz R. Kowalski, Adam Malinowski: How to meet in anonymous network. Theor. Comput. Sci. 399(1-2): 141-156 (2008)
- [c42]Chryssis Georgiou, Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski: On the complexity of asynchronous gossip. PODC 2008: 135-144
- [c41]
- [c40]David Ilcinkas, Dariusz R. Kowalski, Andrzej Pelc: Fast Radio Broadcasting with Advice. SIROCCO 2008: 291-305
- [c39]Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen: Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. DISC 2008: 274-288
- 2007
- [j18]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)
- [j17]Dariusz R. Kowalski, Andrzej Pelc: Optimal Deterministic Broadcasting in Known Topology Radio Networks. Distributed Computing 19(3): 185-195 (2007)
- [j16]Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski: The Wake-Up Problem in MultiHop Radio Networks. SIAM J. Comput. 36(5): 1453-1471 (2007)
- [c38]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Stability of the Multiple-Access Channel Under Maximum Broadcast Loads. SSS 2007: 124-138
- [c37]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
- [c36]Seth Gilbert, Rachid Guerraoui, Dariusz R. Kowalski: On the Message Complexity of Indulgent Consensus. DISC 2007: 283-297
- [c35]Dariusz R. Kowalski, Michal Strojnowski: On the Communication Surplus Incurred by Faulty Processors. DISC 2007: 328-342
- 2006
- [j15]Anders Dessmark, Pierre Fraigniaud, Dariusz R. Kowalski, Andrzej Pelc: Deterministic Rendezvous in Graphs. Algorithmica 46(1): 69-96 (2006)
- [j14]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas: Performing work in broadcast networks. Distributed Computing 18(6): 435-451 (2006)
- [j13]Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc: Complexity of Searching for a Black Hole. Fundam. Inform. 71(2-3): 229-242 (2006)
- [j12]Bogdan S. Chlebus, Dariusz R. Kowalski: Robust gossiping with an application to consensus. J. Comput. Syst. Sci. 72(8): 1262-1281 (2006)
- [j11]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)
- [j10]Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc: Collective tree exploration. Networks 48(3): 166-177 (2006)
- [c34]Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik: On Many-to-Many Communication in Packet Radio Networks. OPODIS 2006: 260-274
- [c33]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Adversarial queuing on the multiple-access channel. PODC 2006: 92-101
- [c32]
- [c31]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Average-Time Complexity of Gossiping in Radio Networks. SIROCCO 2006: 253-267
- [c30]Bogdan S. Chlebus, Dariusz R. Kowalski: Time and Communication Efficient Consensus for Crash Failures. DISC 2006: 314-328
- 2005
- [j9]Dariusz R. Kowalski, Andrzej Pelc: Broadcasting in undirected ad hoc radio networks. Distributed Computing 18(1): 43-57 (2005)
- [j8]Dariusz R. Kowalski, Alexander A. Shvartsman: Performing work with asynchronous processors: Message-delay-sensitive bounds. Inf. Comput. 203(2): 181-210 (2005)
- [j7]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)
- [j6]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)
- [j5]Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman: Efficient gossip and robust distributed computation. Theor. Comput. Sci. 347(1-2): 130-166 (2005)
- [c29]
- [c28]Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik: On the Wake-Up Problem in Radio Networks. ICALP 2005: 347-359
- [c27]Dariusz R. Kowalski, Peter M. Musial, Alexander A. Shvartsman: Explicit Combinatorial Structures for Cooperative Distributed Algorithms. ICDCS 2005: 49-58
- [c26]Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman: Node Discovery in Networks. OPODIS 2005: 206-220
- [c25]
- [c24]Bogdan S. Chlebus, Dariusz R. Kowalski: Cooperative asynchronous update of shared memory. STOC 2005: 733-739
- [c23]Alexander Kesselman, Dariusz R. Kowalski: Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. WONS 2005: 119-124
- 2004
- [j4]Bogdan S. Chlebus, Dariusz R. Kowalski: Randomization helps to perform independent tasks reliably. Random Struct. Algorithms 24(1): 11-41 (2004)
- [j3]Dariusz R. Kowalski, Andrzej Pelc: Time of Deterministic Broadcasting in Radio Networks with Local Knowledge. SIAM J. Comput. 33(4): 870-891 (2004)
- [j2]Dariusz R. Kowalski, Andrzej Pelc: Faster Deterministic Broadcasting in Ad Hoc Radio Networks. SIAM J. Discrete Math. 18(2): 332-346 (2004)
- [c22]Dariusz R. Kowalski, Andrzej Pelc: Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. APPROX-RANDOM 2004: 171-182
- [c21]Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman: The Join Problem in Dynamic Network Algorithms. DSN 2004: 315-324
- [c20]Dariusz R. Kowalski, Andrzej Pelc: Polynomial Deterministic Rendezvous in Arbitrary Graphs. ISAAC 2004: 644-656
- [c19]Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc: Collective Tree Exploration. LATIN 2004: 141-151
- [c18]Jurek Czyzowicz, Dariusz R. Kowalski, Euripides Markou, Andrzej Pelc: Searching for a Black Hole in Tree Networks. OPODIS 2004: 67-80
- [c17]
- [c16]Marek Chrobak, Leszek Gasieniec, Dariusz R. Kowalski: The wake-up problem in multi-hop radio networks. SODA 2004: 992-1000
- [c15]Dariusz R. Kowalski, Alexander A. Shvartsman: Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. SPAA 2004: 311-320
- [c14]Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman: Collective asynchronous reading with polylogarithmic worst-case overhead. STOC 2004: 321-330
- 2003
- [j1]Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski: Broadcasting Spanning Forests on a Multiple-Access Channel. Theory Comput. Syst. 36(6): 711-733 (2003)
- [c13]Dariusz R. Kowalski, Mariam Momenzadeh, Alexander A. Shvartsman: Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems. OPODIS 2003: 210-222
- [c12]Dariusz R. Kowalski, Andrzej Pelc: Broadcasting in undirected ad hoc radio networks. PODC 2003: 73-82
- [c11]Dariusz R. Kowalski, Alexander A. Shvartsman: Performing work with asynchronous processors: message-delay-sensitive bounds. PODC 2003: 265-274
- [c10]
- [c9]Dariusz R. Kowalski, Andrzej Pelc: Faster Deterministic Broadcasting in Ad Hoc Radio Networks. STACS 2003: 109-120
- [c8]Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman: Efficient Gossip and Robust Distributed Computation. DISC 2003: 224-238
- 2002
- [c7]Dariusz R. Kowalski, Andrzej Pelc: Deterministic Broadcasting Time in Radio Networks of Unknown Topology. FOCS 2002: 63-72
- [c6]Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski: Finding Spanning Forests by Broadcasting. SIROCCO 2002: 41-56
- [c5]
- [c4]Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman: Bounding Work and Communication in Robust Cooperative Computation. DISC 2002: 295-310
- 2001
- [c3]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas: The do-all problem in broadcast networks. PODC 2001: 117-127
- [c2]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
1990 – 1999
- 1999
- [c1]Bogdan S. Chlebus, Dariusz R. Kowalski: Randomization Helps to Perform Tasks on Processors Prone to Failures. DISC 1999: 284-296
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 09:00 CEST by the dblp team