Search the dblp DataBase
Dariusz R. Kowalski :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Dariusz R. Kowalski , Andrzej Pelc Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks. [Citation Graph (0, 0)][DBLP ] APPROX-RANDOM, 2004, pp:171-182 [Conf ] Kishori M. Konwar , Dariusz R. Kowalski , Alexander A. Shvartsman The Join Problem in Dynamic Network Algorithms. [Citation Graph (0, 0)][DBLP ] DSN, 2004, pp:315-324 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski Almost Optimal Explicit Selectors. [Citation Graph (0, 0)][DBLP ] FCT, 2005, pp:270-280 [Conf ] Dariusz R. Kowalski , Andrzej Pelc Deterministic Broadcasting Time in Radio Networks of Unknown Topology. [Citation Graph (0, 0)][DBLP ] FOCS, 2002, pp:63-72 [Conf ] Bogdan S. Chlebus , Leszek Gasieniec , Dariusz R. Kowalski , Tomasz Radzik On the Wake-Up Problem in Radio Networks. [Citation Graph (0, 0)][DBLP ] ICALP, 2005, pp:347-359 [Conf ] Dariusz R. Kowalski , Peter M. Musial , Alexander A. Shvartsman Explicit Combinatorial Structures for Cooperative Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] ICDCS, 2005, pp:49-58 [Conf ] Dariusz R. Kowalski , Andrzej Pelc Polynomial Deterministic Rendezvous in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:644-656 [Conf ] Pierre Fraigniaud , Leszek Gasieniec , Dariusz R. Kowalski , Andrzej Pelc Collective Tree Exploration. [Citation Graph (0, 0)][DBLP ] LATIN, 2004, pp:141-151 [Conf ] Dariusz R. Kowalski , Mariam Momenzadeh , Alexander A. Shvartsman Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems. [Citation Graph (0, 0)][DBLP ] OPODIS, 2003, pp:210-222 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski , Tomasz Radzik On Many-to-Many Communication in Packet Radio Networks. [Citation Graph (0, 0)][DBLP ] OPODIS, 2006, pp:260-274 [Conf ] Jurek Czyzowicz , Dariusz R. Kowalski , Euripides Markou , Andrzej Pelc Searching for a Black Hole in Tree Networks. [Citation Graph (0, 0)][DBLP ] OPODIS, 2004, pp:67-80 [Conf ] Kishori M. Konwar , Dariusz R. Kowalski , Alexander A. Shvartsman Node Discovery in Networks. [Citation Graph (0, 0)][DBLP ] OPODIS, 2005, pp:206-220 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski A better wake-up in radio networks. [Citation Graph (0, 0)][DBLP ] PODC, 2004, pp:266-274 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski , Andrzej Lingas The do-all problem in broadcast networks. [Citation Graph (0, 0)][DBLP ] PODC, 2001, pp:117-127 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski , Mariusz A. Rokicki Adversarial queuing on the multiple-access channel. [Citation Graph (0, 0)][DBLP ] PODC, 2006, pp:92-101 [Conf ] Dariusz R. Kowalski On selection problem in radio networks. [Citation Graph (0, 0)][DBLP ] PODC, 2005, pp:158-166 [Conf ] Dariusz R. Kowalski , Andrzej Pelc Broadcasting in undirected ad hoc radio networks. [Citation Graph (0, 0)][DBLP ] PODC, 2003, pp:73-82 [Conf ] Dariusz R. Kowalski , Alexander A. Shvartsman Performing work with asynchronous processors: message-delay-sensitive bounds. [Citation Graph (0, 0)][DBLP ] PODC, 2003, pp:265-274 [Conf ] Bogdan S. Chlebus , Karol Golab , Dariusz R. Kowalski Finding Spanning Forests by Broadcasting. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2002, pp:41-56 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski , Mariusz A. Rokicki Average-Time Complexity of Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2006, pp:253-267 [Conf ] Dariusz R. Kowalski , Adam Malinowski How to Meet in Anonymous Network. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2006, pp:44-58 [Conf ] Dariusz R. Kowalski , Andrzej Pelc Time of Radio Broadcasting. [Citation Graph (0, 0)][DBLP ] SIROCCO, 2003, pp:195-210 [Conf ] Marek Chrobak , Leszek Gasieniec , Dariusz R. Kowalski The wake-up problem in multi-hop radio networks. [Citation Graph (0, 0)][DBLP ] SODA, 2004, pp:992-1000 [Conf ] Bogdan S. Chlebus , Stefan Dobrev , Dariusz R. Kowalski , Grzegorz Malewicz , Alexander A. Shvartsman , Imrich Vrto Towards practical deteministic write-all algorithms. [Citation Graph (0, 0)][DBLP ] SPAA, 2001, pp:271-280 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski Gossiping to reach consensus. [Citation Graph (0, 0)][DBLP ] SPAA, 2002, pp:220-229 [Conf ] Dariusz R. Kowalski , Alexander A. Shvartsman Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. [Citation Graph (0, 0)][DBLP ] SPAA, 2004, pp:311-320 [Conf ] Dariusz R. Kowalski , Andrzej Pelc Faster Deterministic Broadcasting in Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP ] STACS, 2003, pp:109-120 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski Cooperative asynchronous update of shared memory. [Citation Graph (0, 0)][DBLP ] STOC, 2005, pp:733-739 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski , Alexander A. Shvartsman Collective asynchronous reading with polylogarithmic worst-case overhead. [Citation Graph (0, 0)][DBLP ] STOC, 2004, pp:321-330 [Conf ] Bogdan S. Chlebus , Leszek Gasieniec , Dariusz R. Kowalski , Alexander A. Shvartsman Bounding Work and Communication in Robust Cooperative Computation. [Citation Graph (0, 0)][DBLP ] DISC, 2002, pp:295-310 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski Randomization Helps to Perform Tasks on Processors Prone to Failures. [Citation Graph (0, 0)][DBLP ] DISC, 1999, pp:284-296 [Conf ] Chryssis Georgiou , Dariusz R. Kowalski , Alexander A. Shvartsman Efficient Gossip and Robust Distributed Computation. [Citation Graph (0, 0)][DBLP ] DISC, 2003, pp:224-238 [Conf ] Bogdan S. Chlebus , Dariusz R. Kowalski Time and Communication Efficient Consensus for Crash Failures. [Citation Graph (0, 0)][DBLP ] DISC, 2006, pp:314-328 [Conf ] Alexander Kesselman , Dariusz R. Kowalski Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. [Citation Graph (0, 0)][DBLP ] WONS, 2005, pp:119-124 [Conf ] Anders Dessmark , Pierre Fraigniaud , Dariusz R. Kowalski , Andrzej Pelc Deterministic Rendezvous in Graphs. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2006, v:46, n:1, pp:69-96 [Journal ] Bogdan S. Chlebus , Dariusz R. Kowalski , Andrzej Lingas Performing work in broadcast networks. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2006, v:18, n:6, pp:435-451 [Journal ] Dariusz R. Kowalski , Andrzej Pelc Broadcasting in undirected ad hoc radio networks. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2005, v:18, n:1, pp:43-57 [Journal ] Dariusz R. Kowalski , Andrzej Pelc Optimal Deterministic Broadcasting in Known Topology Radio Networks. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2007, v:19, n:3, pp:185-195 [Journal ] Jurek Czyzowicz , Dariusz R. Kowalski , Euripides Markou , Andrzej Pelc Complexity of Searching for a Black Hole. [Citation Graph (0, 0)][DBLP ] Fundam. Inform., 2006, v:71, n:2-3, pp:229-242 [Journal ] Dariusz R. Kowalski , Alexander A. Shvartsman Performing work with asynchronous processors: Message-delay-sensitive bounds. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2005, v:203, n:2, pp:181-210 [Journal ] Bogdan S. Chlebus , Dariusz R. Kowalski Robust gossiping with an application to consensus. [Citation Graph (0, 0)][DBLP ] J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1262-1281 [Journal ] Alexander Kesselman , Dariusz R. Kowalski Fast distributed algorithm for convergecast in ad hoc geometric radio networks. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2006, v:66, n:4, pp:578-585 [Journal ] Bogdan S. Chlebus , Karol Golab , Dariusz R. Kowalski Broadcasting Spanning Forests on a Multiple-Access Channel. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 2003, v:36, n:6, pp:711-733 [Journal ] Pierre Fraigniaud , Leszek Gasieniec , Dariusz R. Kowalski , Andrzej Pelc Collective tree exploration. [Citation Graph (0, 0)][DBLP ] Networks, 2006, v:48, n:3, pp:166-177 [Journal ] Bogdan S. Chlebus , Dariusz R. Kowalski Randomization helps to perform independent tasks reliably. [Citation Graph (0, 0)][DBLP ] Random Struct. Algorithms, 2004, v:24, n:1, pp:11-41 [Journal ] Dariusz R. Kowalski , Andrzej Pelc Time of Deterministic Broadcasting in Radio Networks with Local Knowledge. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:4, pp:870-891 [Journal ] Marek Chrobak , Leszek Gasieniec , Dariusz R. Kowalski The Wake-Up Problem in MultiHop Radio Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2007, v:36, n:5, pp:1453-1471 [Journal ] Dariusz R. Kowalski , Andrzej Pelc Faster Deterministic Broadcasting in Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Discrete Math., 2004, v:18, n:2, pp:332-346 [Journal ] Alexander Kesselman , Dariusz R. Kowalski , Michael Segal Energy efficient communication in ad hoc networks from user's and designer's perspective. [Citation Graph (0, 0)][DBLP ] Mobile Computing and Communications Review, 2005, v:9, n:1, pp:15-26 [Journal ] Chryssis Georgiou , Dariusz R. Kowalski , Alexander A. Shvartsman Efficient gossip and robust distributed computation. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:347, n:1-2, pp:130-166 [Journal ] Dariusz R. Kowalski , Andrzej Pelc Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2005, v:333, n:3, pp:355-371 [Journal ] Bogdan S. Chlebus , Dariusz R. Kowalski , Mariusz A. Rokicki Stability of the Multiple-Access Channel Under Maximum Broadcast Loads. [Citation Graph (0, 0)][DBLP ] SSS, 2007, pp:124-138 [Conf ] Leszek Gasieniec , Erez Kantor , Dariusz R. Kowalski , David Peleg , Chang Su Energy and Time Efficient Broadcasting in Known Topology Radio Networks. [Citation Graph (0, 0)][DBLP ] DISC, 2007, pp:253-267 [Conf ] Dariusz R. Kowalski , Michal Strojnowski On the Communication Surplus Incurred by Faulty Processors. [Citation Graph (0, 0)][DBLP ] DISC, 2007, pp:328-342 [Conf ] Seth Gilbert , Rachid Guerraoui , Dariusz R. Kowalski On the Message Complexity of Indulgent Consensus. [Citation Graph (0, 0)][DBLP ] DISC, 2007, pp:283-297 [Conf ] Decomposing broadcast algorithms using abstract MAC layers. [Citation Graph (, )][DBLP ] Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. [Citation Graph (, )][DBLP ] Towards Power-Sensitive Communication on a Multiple-Access Channel. [Citation Graph (, )][DBLP ] Interference-Resilient Information Exchange. [Citation Graph (, )][DBLP ] Deterministic Broadcast on Multiple Access Channels. [Citation Graph (, )][DBLP ] On the complexity of asynchronous gossip. [Citation Graph (, )][DBLP ] Asynchronous exclusive selection. [Citation Graph (, )][DBLP ] Fast scalable deterministic consensus for crash failures. [Citation Graph (, )][DBLP ] Meeting the deadline: on the complexity of fault-tolerant continuous gossip. [Citation Graph (, )][DBLP ] Fast Radio Broadcasting with Advice. [Citation Graph (, )][DBLP ] Distributed Agreement with Optimal Communication Complexity. [Citation Graph (, )][DBLP ] Locally scalable randomized consensus for synchronous crash failures. [Citation Graph (, )][DBLP ] Dynamic Sharing of a Multiple Access Channel. [Citation Graph (, )][DBLP ] Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. [Citation Graph (, )][DBLP ] Consensus and Mutual Exclusion in a Multiple Access Channel. [Citation Graph (, )][DBLP ] Connectivity Problem in Wireless Networks. [Citation Graph (, )][DBLP ] Scalable Quantum Consensus for Crash Failures. [Citation Graph (, )][DBLP ] Trusted Computing for Fault-Prone Wireless Networks. [Citation Graph (, )][DBLP ] Many-to-Many Communication in Radio Networks. [Citation Graph (, )][DBLP ] Dynamic sharing of a multiple access channel [Citation Graph (, )][DBLP ] Bounds on Stability and Latency in Wireless Communication [Citation Graph (, )][DBLP ] Searching for a Black Hole in Synchronous Tree Networks. [Citation Graph (, )][DBLP ] Time efficient k-shot broadcasting in known topology radio networks. [Citation Graph (, )][DBLP ] Maximum throughput of multiple access channels in adversarial environments. [Citation Graph (, )][DBLP ] Search in 0.004secs, Finished in 0.453secs