Research of Bogdan Chlebus

Areas of interests: algorithms, communication in networks, distributed computing.

Recent papers:

• Adversarial stability of multiple access channels,
  (with D.R. Kowalski and M.A. Rokicki), submitted to ACM Transactions on Algorithms.
• Doing-it-all with bounded work and communication,
  (with L. Gasieniec, D.R. Kowalski, and A. A. Shvartsman), submitted to Information and Computation.
• Maximum throughput of multiple access channels in adversarial environments,
  (with D.R. Kowalski and M.A. Rokicki), Distributed Computing, to appear.
• Locally scalable randomized consensus for synchronous crash failures,
  (with D.R. Kowalski), in Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2009, to appear.
• Fast scalable deterministic consensus for crash failures,
  (with D.R. Kowalski and M. Strojnowski), in Proceedings of the 28th ACM Symposium on Principles of Distributed Computing (PODC), 2009, to appear.
• Many-to-many communication in radio networks,
  (with D.R. Kowalski and T. Radzik), Algorithmica, 54 (2009) 118 - 139.
• Asynchronous exclusive selection,
  (with D.R. Kowalski), in Proceedings of the 27th ACM Symposium on Principles of Distributed Computing (PODC) , 2008, pp. 375 - 384.
• A robust randomized algorithm to perform independent tasks,
  (with L. Gasieniec, D.R. Kowalski, and A. A. Shvartsman), Journal of Discrete Algorithms, 6 (2008) 651 - 665.
• Stability of the multiple-access channel under maximum broadcast loads,
  (with D.R. Kowalski and M.A. Rokicki), in Proceedings of the 9th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), 2007, LNCS 4838, pp. 124 - 138.
• 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 Proceedings of the 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 Proceedings of the 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 Proceedings of the 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 Proceedings of the 32nd Colloquium on Automata, Languages and Programming (ICALP), 2005, LNCS 3580, pp. 347 - 359.
• Almost optimal explicit selectors,
  (with D.R. Kowalski), in Proceedings of the 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 Proceedings of the 37th ACM Symposium on Theory of Computing (STOC), 2005, pp. 733 - 739.

Publications: from DBLP or from Libra or from Google Scholar.

Recent external funding: NSF grant Distributed Collaborative Computing and Adversity