Research interests of Dariusz Kowalski:

Conference publications

    1. Broadcasting in undirected ad hoc radio networks, in Proc., 22-nd ACM Symposium on Principles of Distributed Computing, 2003, to appear (with A. Pelc)
    2. Performing work with asynchronous processors: Message-delay-sensitive bounds, in Proc., 22-nd ACM Symposium on Principles of Distributed Computing, 2003, to appear (with A. Shvartsman)
    3. Faster deterministic broadcasting in ad hoc radio networks, in Proc., 20-th Annual Symposium on Theoretical Aspects of Computer Science, 2003, Springer, pp. 109-120 (with A. Pelc)
    4. Deterministic broadcasting time in radio networks of unknown topology, in Proc., 43-rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 63-72 (with A. Pelc)
    5. Bounding work and communication in robust cooperative computation, in Proc., 16-th International Symposium on Distributed Computing, 2002, pp. 295-310 (with B. Chlebus, L. Gasieniec and A. Shvartsman)
    6. Gossiping to reach consensus, in Proc., 14-th ACM Symposium on Parallel Algorithms and Architectures, 2002, pp. 220-229 (with B. Chlebus)
    7. Finding spanning forests by broadcasting, in Proc., 9-th International Colloquium on Structural Information and Communication Complexity, 2002, pp. 41-56 (with B.S. Chlebus and K. Golab)
    8. Towards practical deterministic Write-All algorithms, in Proc., 13-th ACM Symposium on Parallel Algorithms and Architectures, 2001, pp. 271-280 (with B. Chlebus, S. Dobrev, G. Malewicz, A. Shvartsman and I. Vrto)
    9. The Do-All problem in broadcast networks, in Proc., 20-th ACM Symposium on Principles of Distributed Computing, 2001, pp. 117-126 (with B. Chlebus and A. Lingas)
    10. Randomization helps to perform tasks on processors prone to failures, in Proc., 13-th International Symposium on Distributed Computing, 1999, Springer LNCS 1693, pp. 284-296 (with B. Chlebus)

Other publications

    1. Distributed algorithms to perform independent tasks in networks with processor faults, Ph.D. Thesis, Warsaw University, Poland, 2001 (pdf format)
    2. Rapidly mixing Markov Chains (in Polish), in Forum Informatyki Teoretycznej, TR 96-12, 1996, p. 10
    3. Algorithms for generating and counting based on rapidly mixing Markov Chains (in Polish), M.Sc. Thesis, Warsaw University, Poland, 1996

<< back to home page

 Last updated:  04/02/2003