Bogdan S. Chlebus

Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Adversarial Queuing on the Multiple Access Channel. ACM Transactions on Algorithms 8(1): 5 (2012)

Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc: Electing a Leader in Multi-hop Radio Networks. OPODIS 2012: 106-120

Bogdan S. Chlebus, Bhaskar Krishnamachari, Sotiris E. Nikoletseas: Preface for Special Issue "Distributed Computing in Sensor Systems". Ad Hoc Networks 9(6): 985-986 (2011)

Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc, Mariusz A. Rokicki: Efficient Distributed Communication in Ad-Hoc Radio Networks. ICALP (2) 2011: 613-624

Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Medium Access Control for Adversarial Channels with Jamming. SIROCCO 2011: 89-100

Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Deterministic Broadcast on Multiple Access Channels. INFOCOM 2010: 146-150

Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski: Scalable Quantum Consensus for Crash Failures. DISC 2010: 236-250

Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik: Many-to-Many Communication in Radio Networks. Algorithmica 54(1): 118-139 (2009)

Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Maximum throughput of multiple access channels in adversarial environments. Distributed Computing 22(2): 93-116 (2009)

Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki: Adversarial Multiple Access Channel with Individual Injection Rates. OPODIS 2009: 174-188

Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski: Fast scalable deterministic consensus for crash failures. PODC 2009: 111-120

Bogdan S. Chlebus, Dariusz R. Kowalski: Locally scalable randomized consensus for synchronous crash failures. SPAA 2009: 290-299

Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman: A robust randomized algorithm to perform independent tasks. J. Discrete Algorithms 6(4): 651-665 (2008)

Bogdan S. Chlebus, Dariusz R. Kowalski: Asynchronous exclusive selection. PODC 2008: 375-384

Sotiris E. Nikoletseas, Bogdan S. Chlebus, David B. Johnson, Bhaskar Krishnamachari (Eds.): Distributed Computing in Sensor Systems, 4th IEEE International Conference, DCOSS 2008, Santorini Island, Greece, June 11-14, 2008, Proceedings. Lecture Notes in Computer Science 5067, Springer 2008, isbn 978-3-540-69169-3

Bogdan S. Chlebus, Mariusz A. Rokicki: Centralized asynchronous broadcast in radio networks. Theor. Comput. Sci. 383(1): 5-22 (2007)

Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Stability of the Multiple-Access Channel Under Maximum Broadcast Loads. SSS 2007: 124-138

Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas: Performing work in broadcast networks. Distributed Computing 18(6): 435-451 (2006)

Bogdan S. Chlebus, Dariusz R. Kowalski: Robust gossiping with an application to consensus. J. Comput. Syst. Sci. 72(8): 1262-1281 (2006)

Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik: On Many-to-Many Communication in Packet Radio Networks. OPODIS 2006: 260-274

Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Adversarial queuing on the multiple-access channel. PODC 2006: 92-101

Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki: Average-Time Complexity of Gossiping in Radio Networks. SIROCCO 2006: 253-267

Bogdan S. Chlebus, Dariusz R. Kowalski: Time and Communication Efficient Consensus for Crash Failures. DISC 2006: 314-328

Bogdan S. Chlebus, Dariusz R. Kowalski: Almost Optimal Explicit Selectors. FCT 2005: 270-280

Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik: On the Wake-Up Problem in Radio Networks. ICALP 2005: 347-359

Bogdan S. Chlebus, Dariusz R. Kowalski: Cooperative asynchronous update of shared memory. STOC 2005: 733-739

Bogdan S. Chlebus, Dariusz R. Kowalski: Randomization helps to perform independent tasks reliably. Random Struct. Algorithms 24(1): 11-41 (2004)

Bogdan S. Chlebus, Dariusz R. Kowalski: A better wake-up in radio networks. PODC 2004: 266-274

Bogdan S. Chlebus, Mariusz A. Rokicki: Asynchronous Broadcast in Radio Networks. SIROCCO 2004: 57-68

Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman: Collective asynchronous reading with polylogarithmic worst-case overhead. STOC 2004: 321-330

Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc: Deterministic Computations on a PRAM with Static Processor and Memory Faults. Fundam. Inform. 55(3-4): 285-306 (2003)

Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski: Broadcasting Spanning Forests on a Multiple-Access Channel. Theory Comput. Syst. 36(6): 711-733 (2003)

Bogdan S. Chlebus, Jop F. Sibeyn: Routing on Meshes in Optimum Time and with Really Small Queues. IPDPS 2003: 56

Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter: Deterministic broadcasting in ad hoc radio networks. Distributed Computing 15(1): 27-38 (2002)

Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski: Finding Spanning Forests by Broadcasting. SIROCCO 2002: 41-56

Bogdan S. Chlebus, Dariusz R. Kowalski: Gossiping to reach consensus. SPAA 2002: 220-229

Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman: Bounding Work and Communication in Robust Cooperative Computation. DISC 2002: 295-310

Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman: Performing tasks on synchronous restartable message-passing processors. Distributed Computing 14(1): 49-64 (2001)

Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis: Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51

Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas: The do-all problem in broadcast networks. PODC 2001: 117-127

Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto: Towards practical deteministic write-all algorithms. SPAA 2001: 271-280

Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski: Algorithms for the parallel alternating direction access machine. Theor. Comput. Sci. 245(2): 151-173 (2000)

Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson: Deterministic Radio Broadcasting. ICALP 2000: 717-728

Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter: Deterministic broadcasting in unknown radio networks. SODA 2000: 861-870

Bogdan S. Chlebus, Dariusz R. Kowalski: Randomization Helps to Perform Tasks on Processors Prone to Failures. DISC 1999: 284-296

Bogdan S. Chlebus, Sinh Hoa Nguyen: On Finding Optimal Discretizations for Two Attributes. Rough Sets and Current Trends in Computing 1998: 537-544

Bogdan S. Chlebus: On the Klee`s Measure Problem in Small Dimensions. SOFSEM 1998: 304-311

Bogdan S. Chlebus: Mesh Sorting and Selection Optimal to the Average. Computers and Artificial Intelligence 16(2) (1997)

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Transition-Optimal Token Distribution. Fundam. Inform. 32(3-4): 313-328 (1997)

Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann: Deterministic Permutation Routing on Meshes. J. Algorithms 22(1): 111-141 (1997)

Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn: Routing on the PADAM: Degrees of Optimality. Euro-Par 1997: 272-279

Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman: Performing Tasks on Restartable Message-Passing Processors. WDAG 1997: 96-110

Bogdan S. Chlebus, Ludwik Czaja (Eds.): Fundamentals of Computation Theory, 11th International Symposium, FCT '97, Kraków, Poland, September 1-3, 1997, Proceedings. Lecture Notes in Computer Science 1279, Springer 1997, isbn 3-540-63386-3

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Reliable Broadcasting in Hypercubes with Random Link and Node Failures. Combinatorics, Probability & Computing 5: 337-350 (1996)

Bogdan S. Chlebus, Anna Gambin, Piotr Indyk: Shared-Memory Simulations on a Faulty-Memory DMM. ICALP 1996: 586-597

Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki: Distributing Tokens on a Hypercube without Error Accumulation. IPPS 1996: 573-578

Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski: Parallel Alternating-Direction Access Machine. MFCS 1996: 267-278

Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk: O(log log n)-Time Integer Geometry on the CRCW PRAM. Algorithmica 14(1): 52-69 (1995)

Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc: Fast Deterministic Simulation of Computations on Faulty Parallel Machines. ESA 1995: 89-101

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Fast gossiping with short unreliable messages. Discrete Applied Mathematics 53(1-3): 15-24 (1994)

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Sparse Networks Supporting Efficient Reliable Broadcasting. Nord. J. Comput. 1(3): 332-345 (1994)

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Sorting on a Mesh-Connected Computer with Delaying Links. SIAM J. Discrete Math. 7(1): 119-132 (1994)

Bogdan S. Chlebus, Anna Gambin, Piotr Indyk: PRAM Computations Resilient to Memory Faults. ESA 1994: 401-412

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Waking up an Anonymous Faulty Network from a Single Source. HICSS (2) 1994: 187-193

Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann: Shorter Queues for Permutation Routing on Meshes. MFCS 1994: 597-607

Bogdan S. Chlebus, Leszek Gasieniec: Optimal Pattern Matching on Meshes. STACS 1994: 213-224

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Sparse Networks Supporting Efficient Reliable Broadcasting. ICALP 1993: 388-397

Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn: Deterministic Permutation Routing on Meshes. SPDP 1993: 284

Bogdan S. Chlebus: Two Selection Algorithms on a Mesh-Connected Computer. Parallel Processing Letters 2: 341-346 (1992)

Bogdan S. Chlebus, Imrich Vrto: Parallel Quicksort. J. Parallel Distrib. Comput. 11(4): 332-337 (1991)

Bogdan S. Chlebus, Imrich Vrto: Unifying Binary-Search Trees and Permutations. FCT 1991: 190-199

Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc: Optimal Broadcasting in Faulty Hypercubes. FTCS 1991: 266-273

Bogdan S. Chlebus: Duplicating keys to streamline sorting on a mesh-connected computer. SPDP 1991: 296-300

Bogdan S. Chlebus: Turing Machines With Access to History. Inf. Comput. 89(2): 133-143 (1990)

Tom Altman, Bogdan S. Chlebus: Sorting Roughly Sorted Sequences in Parallel. Inf. Process. Lett. 33(6): 297-300 (1990)

Bogdan S. Chlebus: Parallel Iterated Bucket Sort. Inf. Process. Lett. 31(4): 181-183 (1989)

Bogdan S. Chlebus: A Hierarchy of Propositional Horn Formulas. Theor. Comput. Sci. 68(1): 113-119 (1989)

Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik: New Simulations between CRCW PRAMs. FCT 1989: 95-104

Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha: Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). MFCS 1989: 185-195

Bogdan S. Chlebus: Sorting within Distance Bound on a Mesh-Connected Processor Array. Optimal Algorithms 1989: 232-238

Bogdan S. Chlebus: A Parallel Bucket Sort. Inf. Process. Lett. 27(2): 57-61 (1988)

Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik: Testing Isomorphism of Outerplanar Graphs in Parallel. MFCS 1988: 220-230

Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik: Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS 1988: 231-239

Bogdan S. Chlebus: A note on the polynomial-time hierarchy and the quantified Boolean formulas. Bulletin of the EATCS 31: 15-21 (1987)

Bogdan S. Chlebus: Proving NP-completeness Using BOUNDED TILING. Elektronische Informationsverarbeitung und Kybernetik 23(8/9): 479-484 (1987)

Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks: Saturating Flows in Networks. FCT 1987: 82-91

Bogdan S. Chlebus: Domino-Tiling Games. J. Comput. Syst. Sci. 32(3): 374-392 (1986)

Bogdan S. Chlebus: Algorithms solving path systems. FCT 1985: 70-79

Marek Chrobak, Bogdan S. Chlebus: Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts. Inf. Process. Lett. 19(4): 167-171 (1984)

Bogdan S. Chlebus: From domino tilings to a new model of computation. Symposium on Computation Theory 1984: 24-33

Bogdan S. Chlebus: On the Computational Complexity of Satisfiability in Propositional Logics of Programs. Theor. Comput. Sci. 21: 179-212 (1982)

Bogdan S. Chlebus: On four logics of programs and complexity of their satisfiability problems: extended abstract. Logic of Programs 1980: 98-107