The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Dariusz R. Kowalski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. Bogdan S. Chlebus, Dariusz R. Kowalski
    Almost Optimal Explicit Selectors. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:270-280 [Conf]
  4. 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]
  5. 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]
  6. 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]
  7. Dariusz R. Kowalski, Andrzej Pelc
    Polynomial Deterministic Rendezvous in Arbitrary Graphs. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:644-656 [Conf]
  8. Pierre Fraigniaud, Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Pelc
    Collective Tree Exploration. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:141-151 [Conf]
  9. 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]
  10. 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]
  11. 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]
  12. Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman
    Node Discovery in Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:206-220 [Conf]
  13. Bogdan S. Chlebus, Dariusz R. Kowalski
    A better wake-up in radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:266-274 [Conf]
  14. 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]
  15. 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]
  16. Dariusz R. Kowalski
    On selection problem in radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2005, pp:158-166 [Conf]
  17. Dariusz R. Kowalski, Andrzej Pelc
    Broadcasting in undirected ad hoc radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:73-82 [Conf]
  18. 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]
  19. Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
    Finding Spanning Forests by Broadcasting. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:41-56 [Conf]
  20. 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]
  21. Dariusz R. Kowalski, Adam Malinowski
    How to Meet in Anonymous Network. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:44-58 [Conf]
  22. Dariusz R. Kowalski, Andrzej Pelc
    Time of Radio Broadcasting. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2003, pp:195-210 [Conf]
  23. 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]
  24. 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]
  25. Bogdan S. Chlebus, Dariusz R. Kowalski
    Gossiping to reach consensus. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:220-229 [Conf]
  26. 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]
  27. Dariusz R. Kowalski, Andrzej Pelc
    Faster Deterministic Broadcasting in Ad Hoc Radio Networks. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:109-120 [Conf]
  28. Bogdan S. Chlebus, Dariusz R. Kowalski
    Cooperative asynchronous update of shared memory. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:733-739 [Conf]
  29. 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]
  30. 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]
  31. 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]
  32. 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]
  33. 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]
  34. 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]
  35. 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]
  36. 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]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. 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]
  43. 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]
  44. 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]
  45. 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]
  46. 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]
  47. 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]
  48. 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]
  49. 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]
  50. 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]
  51. 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]
  52. 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]
  53. 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]
  54. Dariusz R. Kowalski, Michal Strojnowski
    On the Communication Surplus Incurred by Faulty Processors. [Citation Graph (0, 0)][DBLP]
    DISC, 2007, pp:328-342 [Conf]
  55. 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]

  56. Decomposing broadcast algorithms using abstract MAC layers. [Citation Graph (, )][DBLP]


  57. Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps. [Citation Graph (, )][DBLP]


  58. Towards Power-Sensitive Communication on a Multiple-Access Channel. [Citation Graph (, )][DBLP]


  59. Interference-Resilient Information Exchange. [Citation Graph (, )][DBLP]


  60. Deterministic Broadcast on Multiple Access Channels. [Citation Graph (, )][DBLP]


  61. On the complexity of asynchronous gossip. [Citation Graph (, )][DBLP]


  62. Asynchronous exclusive selection. [Citation Graph (, )][DBLP]


  63. Fast scalable deterministic consensus for crash failures. [Citation Graph (, )][DBLP]


  64. Meeting the deadline: on the complexity of fault-tolerant continuous gossip. [Citation Graph (, )][DBLP]


  65. Fast Radio Broadcasting with Advice. [Citation Graph (, )][DBLP]


  66. Distributed Agreement with Optimal Communication Complexity. [Citation Graph (, )][DBLP]


  67. Locally scalable randomized consensus for synchronous crash failures. [Citation Graph (, )][DBLP]


  68. Dynamic Sharing of a Multiple Access Channel. [Citation Graph (, )][DBLP]


  69. Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. [Citation Graph (, )][DBLP]


  70. Consensus and Mutual Exclusion in a Multiple Access Channel. [Citation Graph (, )][DBLP]


  71. Connectivity Problem in Wireless Networks. [Citation Graph (, )][DBLP]


  72. Scalable Quantum Consensus for Crash Failures. [Citation Graph (, )][DBLP]


  73. Trusted Computing for Fault-Prone Wireless Networks. [Citation Graph (, )][DBLP]


  74. Many-to-Many Communication in Radio Networks. [Citation Graph (, )][DBLP]


  75. Dynamic sharing of a multiple access channel [Citation Graph (, )][DBLP]


  76. Bounds on Stability and Latency in Wireless Communication [Citation Graph (, )][DBLP]


  77. Searching for a Black Hole in Synchronous Tree Networks. [Citation Graph (, )][DBLP]


  78. Time efficient k-shot broadcasting in known topology radio networks. [Citation Graph (, )][DBLP]


  79. Maximum throughput of multiple access channels in adversarial environments. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002