Research of Bogdan Chlebus

Areas of interests:

External funding:

Selected recent papers available online:

• A robust randomized algorithm to perform independent tasks,
  (with L. Gasieniec, D.R. Kowalski, and A. A. Shvartsman), Journal of Discrete Algorithms, to appear.
• Many-to-many communication in radio networks,
  (with D.R. Kowalski and T. Radzik), Algorithmica, to appear.
• Stability of the multiple-access channel under maximum broadcast loads,
  (with D.R. Kowalski and M.A. Rokicki), in Proc., 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2007.
• Centralized asynchronous broadcast in radio networks,
  (with M.A. Rokicki), Theoretical Computer Science, 383 (2007) 5 - 22.
• Time and communication efficient consensus for crash failures,
  (with D.R. Kowalski), in Proc., 20th Symposium on Distributed Computing (DISC), 2006, LNCS 4167, pp. 314 - 328.
• Adversarial queuing on the multiple-access channel,
  (with D.R. Kowalski and M.A. Rokicki), in Proc., 25th ACM Symposium on Principles of Distributed Computing (PODC), 2006, pp. 92 - 101.
• Average-time complexity of gossiping in radio networks,
  (with D.R. Kowalski and M.A. Rokicki), in Proc., 13th Colloquium on Structural Information and Communication Complexity (SIROCCO), 2006, LNCS 4056, pp. 253 - 26.
• Robust gossiping with an application to consensus,
  (with D.R. Kowalski), Journal of Computer and System Sciences, 72 (2006) 1262 - 1281.
• Performing work in broadcast networks,
  (with D.R. Kowalski and A. Lingas), Distributed Computing, 18 (2006) 435 - 451.
• On the wake-up problem in radio networks ,
  (with L. Gasieniec, D.R. Kowalski, and T. Radzik), in Proc., 32nd Colloquium on Automata, Languages and Programming (ICALP), 2005, LNCS 3580, pp. 347 - 359.
• Almost optimal explicit selectors,
  (with D.R. Kowalski), in Proc., 15th Symposium on Fundamentals of Computation Theory (FCT), 2005, LNCS 3623, pp. 270 - 280.
• Cooperative asynchronous update of shared memory,
  (with D.R. Kowalski), in Proc., 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 733 - 739.
• A better wake-up in radio networks,
  (with D.R. Kowalski), in Proc., 23rd ACM Symposium on Principles of Distributed Computing (PODC), 2004, pp. 266 - 274.
• Collective asynchronous reading with polylogarithmic worst-case overhead,
  (with D.R. Kowalski and A.A. Shvartsman), in Proc., 36th ACM Symposium on Theory of Computing (STOC), 2004, pp. 321 - 330.
• Randomization helps to perform independent tasks reliably,
  (with D.R. Kowalski), Random Structures and Algorithms, 24 (2004) 11 - 41.