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

Decidability and Definability Results Concerning Well-Orderings and Some Extensions of First Order Logic. - Bogdan S. Chlebus (Math. Log. Q., 1980)

Completeness Proofs for Some Logics of Programs. - Bogdan S. Chlebus (Math. Log. Q., 1982)

On the Decidability of Propositional Algorithmic Logic. - Bogdan S. Chlebus (Math. Log. Q., 1982)

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

From domino tilings to a new model of computation. - Bogdan S. Chlebus (Symposium on Computation Theory, 1984)

Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts. - Marek Chrobak; Bogdan S. Chlebus (Inf. Process. Lett., 1984)

Algorithms solving path systems. - Bogdan S. Chlebus (FCT, 1985)

Domino-Tiling Games. - Bogdan S. Chlebus (J. Comput. Syst. Sci., 1986)

Saturating Flows in Networks. - Bogdan S. Chlebus; Marek Chrobak; Krzysztof Diks (FCT, 1987)

A note on the polynomial-time hierarchy and the quantified Boolean formulas. - Bogdan S. Chlebus (Bull. EATCS, 1987)

Proving NP-completeness Using BOUNDED TILING. - Bogdan S. Chlebus (J. Inf. Process. Cybern., 1987)

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. - Bogdan S. Chlebus; Krzysztof Diks; Torben Hagerup; Tomasz Radzik (MFCS, 1988)

Testing Isomorphism of Outerplanar Graphs in Parallel. - Bogdan S. Chlebus; Krzysztof Diks; Tomasz Radzik (MFCS, 1988)

A Parallel Bucket Sort. - Bogdan S. Chlebus (Inf. Process. Lett., 1988)

New Simulations between CRCW PRAMs. - Bogdan S. Chlebus; Krzysztof Diks; Torben Hagerup; Tomasz Radzik (FCT, 1989)

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

Sorting within Distance Bound on a Mesh-Connected Processor Array. - Bogdan S. Chlebus (Optimal Algorithms, 1989)

Parallel Iterated Bucket Sort. - Bogdan S. Chlebus (Inf. Process. Lett., 1989)

A Hierarchy of Propositional Horn Formulas. - Bogdan S. Chlebus (Theor. Comput. Sci., 1989)

Sorting Roughly Sorted Sequences in Parallel. - Tom Altman; Bogdan S. Chlebus (Inf. Process. Lett., 1990)

Turing Machines With Access to History - Bogdan S. Chlebus (Inf. Comput., 1990)

Unifying Binary-Search Trees and Permutations. - Bogdan S. Chlebus; Imrich Vrto (FCT, 1991)

Optimal Broadcasting in Faulty Hypercubes. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (FTCS, 1991)

Duplicating keys to streamline sorting on a mesh-connected computer. - Bogdan S. Chlebus (SPDP, 1991)

Parallel Quicksort. - Bogdan S. Chlebus; Imrich Vrto (J. Parallel Distributed Comput., 1991)

Two Selection Algorithms on a Mesh-Connected Computer. - Bogdan S. Chlebus (Parallel Process. Lett., 1992)

PRAM Computations Resilient to Memory Faults. - Bogdan S. Chlebus; Anna Gambin; Piotr Indyk (ESA, 1994)

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

Shorter Queues for Permutation Routing on Meshes. - Jop F. Sibeyn; Bogdan S. Chlebus; Michael Kaufmann 001 (MFCS, 1994)

Optimal Pattern Matching on Meshes. - Bogdan S. Chlebus; Leszek Gasieniec (STACS, 1994)

Fast gossiping with short unreliable messages. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Discret. Appl. Math., 1994)

Sparse Networks Supporting Efficient Reliable Broadcasting. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Nord. J. Comput., 1994)

Sorting on a Mesh-Connected Computer with Delaying Links. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (SIAM J. Discret. Math., 1994)

Fast Deterministic Simulation of Computations on Faulty Parallel Machines. - Bogdan S. Chlebus; Leszek Gasieniec; Andrzej Pelc (ESA, 1995)

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

Shared-Memory Simulations on a Faulty-Memory DMM. - Bogdan S. Chlebus; Anna Gambin; Piotr Indyk (ICALP, 1996)

Distributing Tokens on a Hypercube without Error Accumulation. - Bogdan S. Chlebus; José D. P. Rolim; Giora Slutzki (IPPS, 1996)

Parallel Alternating-Direction Access Machine. - Bogdan S. Chlebus; Artur Czumaj; Leszek Gasieniec; Miroslaw Kowaluk; Wojciech Plandowski (MFCS, 1996)

Reliable Broadcasting in Hypercubes with Random Link and Node Failures. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Comb. Probab. Comput., 1996)

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

Performing Tasks on Restartable Message-Passing Processors. - Bogdan S. Chlebus; Roberto De Prisco; Alexander A. Shvartsman (WDAG, 1997)

Mesh Sorting and Selection Optimal to the Average. - Bogdan S. Chlebus (Comput. Artif. Intell., 1997)

Transition-Optimal Token Distribution. - Bogdan S. Chlebus; Krzysztof Diks; Andrzej Pelc (Fundam. Informaticae, 1997)

Deterministic Permutation Routing on Meshes. - Jop F. Sibeyn; Bogdan S. Chlebus; Michael Kaufmann 001 (J. Algorithms, 1997)

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

On the Klee's Measure Problem in Small Dimensions. - Bogdan S. Chlebus (SOFSEM, 1998)

Randomization Helps to Perform Tasks on Processors Prone to Failures. - Bogdan S. Chlebus; Dariusz R. Kowalski (DISC, 1999)

Deterministic Radio Broadcasting. - Bogdan S. Chlebus; Leszek Gasieniec; Anna Östlin; John Michael Robson (ICALP, 2000)

Deterministic broadcasting in unknown radio networks. - Bogdan S. Chlebus; Leszek Gasieniec; Alan Gibbons; Andrzej Pelc; Wojciech Rytter (SODA, 2000)

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

Oblivious gossiping in ad-hoc radio networks. - Bogdan S. Chlebus; Leszek Gasieniec; Andrzej Lingas; Aris Pagourtzis (DIAL-M, 2001)

The do-all problem in broadcast networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Andrzej Lingas (PODC, 2001)

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

Performing tasks on synchronous restartable message-passing processors. - Bogdan S. Chlebus; Roberto De Prisco; Alexander A. Shvartsman (Distributed Comput., 2001)

Finding Spanning Forests by Broadcasting. - Bogdan S. Chlebus; Karol Golab; Dariusz R. Kowalski (SIROCCO, 2002)

Gossiping to reach consensus. - Bogdan S. Chlebus; Dariusz R. Kowalski (SPAA, 2002)

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

Deterministic broadcasting in ad hoc radio networks. - Bogdan S. Chlebus; Leszek Gasieniec; Alan Gibbons; Andrzej Pelc; Wojciech Rytter (Distributed Comput., 2002)

Routing on Meshes in Optimum Time and with Really Small Queues. - Bogdan S. Chlebus; Jop F. Sibeyn (IPDPS, 2003)

Deterministic Computations on a PRAM with Static Processor and Memory Faults. - Bogdan S. Chlebus; Leszek Gasieniec; Andrzej Pelc (Fundam. Informaticae, 2003)

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

A better wake-up in radio networks. - Bogdan S. Chlebus; Dariusz R. Kowalski (PODC, 2004)

Asynchronous Broadcast in Radio Networks. - Bogdan S. Chlebus; Mariusz A. Rokicki (SIROCCO, 2004)

Collective asynchronous reading with polylogarithmic worst-case overhead. - Bogdan S. Chlebus; Dariusz R. Kowalski; Alexander A. Shvartsman (STOC, 2004)

Randomization helps to perform independent tasks reliably. - Bogdan S. Chlebus; Dariusz R. Kowalski (Random Struct. Algorithms, 2004)

Almost Optimal Explicit Selectors. - Bogdan S. Chlebus; Dariusz R. Kowalski (FCT, 2005)

On the Wake-Up Problem in Radio Networks. - Bogdan S. Chlebus; Leszek Gasieniec; Dariusz R. Kowalski; Tomasz Radzik (ICALP, 2005)

Cooperative asynchronous update of shared memory. - Bogdan S. Chlebus; Dariusz R. Kowalski (STOC, 2005)

On Many-to-Many Communication in Packet Radio Networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Tomasz Radzik (OPODIS, 2006)

Average-Time Complexity of Gossiping in Radio Networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Mariusz A. Rokicki (SIROCCO, 2006)

Time and Communication Efficient Consensus for Crash Failures. - Bogdan S. Chlebus; Dariusz R. Kowalski (DISC, 2006)

Performing work in broadcast networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Andrzej Lingas (Distributed Comput., 2006)

Robust gossiping with an application to consensus. - Bogdan S. Chlebus; Dariusz R. Kowalski (J. Comput. Syst. Sci., 2006)

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

Centralized asynchronous broadcast in radio networks. - Bogdan S. Chlebus; Mariusz A. Rokicki (Theor. Comput. Sci., 2007)

Asynchronous exclusive selection. - Bogdan S. Chlebus; Dariusz R. Kowalski (PODC, 2008)

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

Adversarial Multiple Access Channel with Individual Injection Rates. - Lakshmi Anantharamu; Bogdan S. Chlebus; Mariusz A. Rokicki (OPODIS, 2009)

Fast scalable deterministic consensus for crash failures. - Bogdan S. Chlebus; Dariusz R. Kowalski; Michal Strojnowski (PODC, 2009)

Locally scalable randomized consensus for synchronous crash failures. - Bogdan S. Chlebus; Dariusz R. Kowalski (SPAA, 2009)

Many-to-Many Communication in Radio Networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Tomasz Radzik (Algorithmica, 2009)

Maximum throughput of multiple access channels in adversarial environments. - Bogdan S. Chlebus; Dariusz R. Kowalski; Mariusz A. Rokicki (Distributed Comput., 2009)

Deterministic Broadcast on Multiple Access Channels. - Lakshmi Anantharamu; Bogdan S. Chlebus; Dariusz R. Kowalski; Mariusz A. Rokicki (INFOCOM, 2010)

Scalable Quantum Consensus for Crash Failures. - Bogdan S. Chlebus; Dariusz R. Kowalski; Michal Strojnowski (DISC, 2010)

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

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

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

Electing a Leader in Multi-hop Radio Networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Andrzej Pelc (OPODIS, 2012)

Adversarial Queuing on the Multiple Access Channel. - Bogdan S. Chlebus; Dariusz R. Kowalski; Mariusz A. Rokicki (ACM Trans. Algorithms, 2012)

Universal routing in multi hop radio network. - Bogdan S. Chlebus; Vicent Cholvi; Dariusz R. Kowalski (FOMC, 2014)

Distributed Communication in Bare-Bones Wireless Networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Shailesh Vaya (CoRR, 2015)

Anonymous Processors with Synchronous Shared Memory. - Bogdan S. Chlebus; Gianluca De Marco; Muhammed Talo (CoRR, 2015)

Stability of adversarial routing with feedback. - Bogdan S. Chlebus; Vicent Cholvi; Dariusz R. Kowalski (Networks, 2015)

Broadcasting in ad hoc multiple access channels. - Lakshmi Anantharamu; Bogdan S. Chlebus (Theor. Comput. Sci., 2015)

Distributed communication in bare-bones wireless networks. - Bogdan S. Chlebus; Shailesh Vaya (ICDCN, 2016)

Universal Routing in Multi-hop Radio Networks. - Bogdan S. Chlebus; Vicent Cholvi; Dariusz R. Kowalski (CoRR, 2016)

Scalable wake-up of multi-channel single-hop radio networks. - Bogdan S. Chlebus; Gianluca De Marco; Dariusz R. Kowalski (Theor. Comput. Sci., 2016)

Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms. - Bogdan S. Chlebus; Gianluca De Marco; Muhammed Talo (OPODIS, 2017)

Naming a Channel with Beeps. - Bogdan S. Chlebus; Gianluca De Marco; Muhammed Talo (Fundam. Informaticae, 2017)

Doing-it-All with bounded work and communication. - Bogdan S. Chlebus; Leszek Gasieniec; Dariusz R. Kowalski; Alexander A. Schwarzmann (Inf. Comput., 2017)

Routing in Wireless Networks With Interferences. - Bogdan S. Chlebus; Vicent Cholvi; Pawel Garncarek; Tomasz Jurdzinski; Dariusz R. Kowalski (IEEE Commun. Lett., 2017)

Adversarial Multiple Access Channels with Individual Injection Rates. - Lakshmi Anantharamu; Bogdan S. Chlebus; Mariusz A. Rokicki (Theory Comput. Syst., 2017)

Randomized Communication in Radio Networks. - Bogdan S. Chlebus (CoRR, 2018)

Broadcasting on Adversarial Multiple Access Channels. - Bader A. Aldawsari; Bogdan S. Chlebus; Dariusz R. Kowalski (NCA, 2019)

Energy Efficient Adversarial Routing in Shared Channels. - Bogdan S. Chlebus; Elijah Hradovich; Tomasz Jurdzinski; Marek Klonowski; Dariusz R. Kowalski (SPAA, 2019)

Packet latency of deterministic broadcasting in adversarial multiple access channels. - Lakshmi Anantharamu; Bogdan S. Chlebus; Dariusz R. Kowalski; Mariusz A. Rokicki (J. Comput. Syst. Sci., 2019)

Fast Agreement in Networks with Byzantine Nodes. - Bogdan S. Chlebus; Dariusz R. Kowalski; Jan Olkowski (DISC, 2020)

Universal stability in multi-hop radio networks. - Bogdan S. Chlebus; Vicent Cholvi; Dariusz R. Kowalski (J. Comput. Syst. Sci., 2020)

Consensus in Networks Prone to Link Failures. - Bogdan S. Chlebus; Dariusz R. Kowalski; Jan Olkowski; Jedrzej Olkowski (CoRR, 2021)

Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency. - Bogdan S. Chlebus; Dariusz R. Kowalski; Jan Olkowski (PODC, 2022)

Distributed bare-bones communication in wireless networks. - Bogdan S. Chlebus; Dariusz R. Kowalski; Shailesh Vaya (Distributed Comput., 2022)

Stable Scheduling in Transactional Memory. - Costas Busch; Bogdan S. Chlebus; Dariusz R. Kowalski; Pavan Poudel (CIAC, 2023)

Adversarial Contention Resolution Games. - Giorgos Chionas; Bogdan S. Chlebus; Dariusz R. Kowalski; Piotr Krysta (IJCAI, 2023)

Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. - Bogdan S. Chlebus; Dariusz Rafal Kowalski; Jan Olkowski (PODC, 2023)

Disconnected Agreement in Networks Prone to Link Failures. - Bogdan S. Chlebus; Dariusz R. Kowalski; Jan Olkowski; Jedrzej Olkowski (SSS, 2023)

Flexible scheduling of transactional memory on trees. - Costas Busch; Bogdan S. Chlebus; Maurice Herlihy; Miroslav Popovic; Pavan Poudel; Gokarna Sharma (Theor. Comput. Sci., 2023)