Bogdan S. Chlebus

According to our database1, Bogdan S. Chlebus authored at least 121 papers between 1980 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Routing in Wireless Networks with Interferences.
CoRR, 2018

Broadcasting Spanning Forests on a Multiple-Access Channel.
CoRR, 2018

Deterministic Computations on a PRAM with Static Processor and Memory Faults.
CoRR, 2018

Maximum Throughput of Multiple Access Channels in Adversarial Environments.
CoRR, 2018

Randomized Communication in Radio Networks.
CoRR, 2018

2017
Adversarial Multiple Access Channels with Individual Injection Rates.
Theory Comput. Syst., 2017

Routing in Wireless Networks With Interferences.
IEEE Communications Letters, 2017

Doing-it-All with bounded work and communication.
Inf. Comput., 2017

Naming a Channel with Beeps.
Fundam. Inform., 2017

Packet Latency of Deterministic Broadcasting in Adversarial Multiple Access Channels.
CoRR, 2017

Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

2016
Scalable wake-up of multi-channel single-hop radio networks.
Theor. Comput. Sci., 2016

Naming a Channel with Beeps.
CoRR, 2016

Universal Routing in Multi-hop Radio Networks.
CoRR, 2016

Distributed communication in bare-bones wireless networks.
Proceedings of the 17th International Conference on Distributed Computing and Networking, 2016

2015
Broadcasting in ad hoc multiple access channels.
Theor. Comput. Sci., 2015

Stability of adversarial routing with feedback.
Networks, 2015

Anonymous Processors with Synchronous Shared Memory.
CoRR, 2015

Distributed Communication in Bare-Bones Wireless Networks.
CoRR, 2015

Asynchronous Exclusive Selection.
CoRR, 2015

2014
Scalable Wake-up of Multi-Channel Single-Hop Radio Networks.
CoRR, 2014

Doing-it-All with Bounded Work and Communication.
CoRR, 2014

Scalable Wake-up of Multi-channel Single-Hop Radio Networks.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Universal routing in multi hop radio network.
Proceedings of the 10th ACM International Workshop on Foundations of Mobile Computing, 2014

2013
Adversarial Multiple Access Channels with Individual Injection Rates.
CoRR, 2013

Broadcasting in Ad Hoc Multiple Access Channels.
CoRR, 2013

Broadcasting in Ad Hoc Multiple Access Channels.
Proceedings of the Structural Information and Communication Complexity, 2013

Stability of Adversarial Routing with Feedback.
Proceedings of the Networked Systems - First International Conference, 2013

2012
Adversarial Queuing on the Multiple Access Channel.
ACM Trans. Algorithms, 2012

Electing a Leader in Multi-hop Radio Networks.
Proceedings of the Principles of Distributed Systems, 16th International Conference, 2012

2011
Preface for Special Issue "Distributed Computing in Sensor Systems".
Ad Hoc Networks, 2011

Medium Access Control for Adversarial Channels with Jamming.
Proceedings of the Structural Information and Communication Complexity, 2011

Efficient Distributed Communication in Ad-Hoc Radio Networks.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

2010
Scalable Quantum Consensus for Crash Failures.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

Deterministic Broadcast on Multiple Access Channels.
Proceedings of the INFOCOM 2010. 29th IEEE International Conference on Computer Communications, 2010

2009
Maximum throughput of multiple access channels in adversarial environments.
Distributed Computing, 2009

Many-to-Many Communication in Radio Networks.
Algorithmica, 2009

Locally scalable randomized consensus for synchronous crash failures.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Fast scalable deterministic consensus for crash failures.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Adversarial Multiple Access Channel with Individual Injection Rates.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008
A robust randomized algorithm to perform independent tasks.
J. Discrete Algorithms, 2008

Asynchronous exclusive selection.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

2007
Centralized asynchronous broadcast in radio networks.
Theor. Comput. Sci., 2007

Stability of the Multiple-Access Channel Under Maximum Broadcast Loads.
Proceedings of the Stabilization, 2007

2006
Robust gossiping with an application to consensus.
J. Comput. Syst. Sci., 2006

Performing work in broadcast networks.
Distributed Computing, 2006

Time and Communication Efficient Consensus for Crash Failures.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Average-Time Complexity of Gossiping in Radio Networks.
Proceedings of the Structural Information and Communication Complexity, 2006

Adversarial queuing on the multiple-access channel.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

On Many-to-Many Communication in Packet Radio Networks.
Proceedings of the Principles of Distributed Systems, 10th International Conference, 2006

2005
Cooperative asynchronous update of shared memory.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

On the Wake-Up Problem in Radio Networks.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Almost Optimal Explicit Selectors.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004
Randomization helps to perform independent tasks reliably.
Random Struct. Algorithms, 2004

Collective asynchronous reading with polylogarithmic worst-case overhead.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Asynchronous Broadcast in Radio Networks.
Proceedings of the Structural Information and Communication Complexity, 2004

A better wake-up in radio networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

2003
Broadcasting Spanning Forests on a Multiple-Access Channel.
Theory Comput. Syst., 2003

Deterministic Computations on a PRAM with Static Processor and Memory Faults.
Fundam. Inform., 2003

Routing on Meshes in Optimum Time and with Really Small Queues.
Proceedings of the 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 2003

2002
Deterministic broadcasting in ad hoc radio networks.
Distributed Computing, 2002

Bounding Work and Communication in Robust Cooperative Computation.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Gossiping to reach consensus.
SPAA, 2002

Finding Spanning Forests by Broadcasting.
Proceedings of the SIROCCO 9, 2002

2001
Performing tasks on synchronous restartable message-passing processors.
Distributed Computing, 2001

Towards practical deteministic write-all algorithms.
SPAA, 2001

The do-all problem in broadcast networks.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Oblivious gossiping in ad-hoc radio networks.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000
Algorithms for the parallel alternating direction access machine.
Theor. Comput. Sci., 2000

Deterministic broadcasting in unknown radio networks.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

Deterministic Radio Broadcasting.
Proceedings of the Automata, Languages and Programming, 27th International Colloquium, 2000

1999
Randomization Helps to Perform Tasks on Processors Prone to Failures.
Proceedings of the Distributed Computing, 1999

1998
On the Klee's Measure Problem in Small Dimensions.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

On Finding Optimal Discretizations for Two Attributes.
Proceedings of the Rough Sets and Current Trends in Computing, 1998

1997
Deterministic Permutation Routing on Meshes.
J. Algorithms, 1997

Transition-Optimal Token Distribution.
Fundam. Inform., 1997

Mesh Sorting and Selection Optimal to the Average.
Computers and Artificial Intelligence, 1997

Performing Tasks on Restartable Message-Passing Processors.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Routing on the PADAM: Degrees of Optimality.
Proceedings of the Euro-Par '97 Parallel Processing, 1997

1996
Reliable Broadcasting in Hypercubes with Random Link and Node Failures.
Combinatorics, Probability & Computing, 1996

Parallel Alternating-Direction Access Machine.
Proceedings of the Mathematical Foundations of Computer Science 1996, 1996

Distributing Tokens on a Hypercube without Error Accumulation.
Proceedings of IPPS '96, 1996

Shared-Memory Simulations on a Faulty-Memory DMM.
Proceedings of the Automata, Languages and Programming, 23rd International Colloquium, 1996

1995
O(log log n)-Time Integer Geometry on the CRCW PRAM.
Algorithmica, 1995

Fast Deterministic Simulation of Computations on Faulty Parallel Machines.
Proceedings of the Algorithms, 1995

1994
Sorting on a Mesh-Connected Computer with Delaying Links.
SIAM J. Discrete Math., 1994

Sparse Networks Supporting Efficient Reliable Broadcasting.
Nord. J. Comput., 1994

Fast gossiping with short unreliable messages.
Discrete Applied Mathematics, 1994

Optimal Pattern Matching on Meshes.
Proceedings of the STACS 94, 1994

Shorter Queues for Permutation Routing on Meshes.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Waking up an Anonymous Faulty Network from a Single Source.
Proceedings of the 27th Annual Hawaii International Conference on System Sciences (HICSS-27), 1994

PRAM Computations Resilient to Memory Faults.
Proceedings of the Algorithms, 1994

1993
Deterministic Permutation Routing on Meshes.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

Sparse Networks Supporting Efficient Reliable Broadcasting.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Two Selection Algorithms on a Mesh-Connected Computer.
Parallel Processing Letters, 1992

1991
Parallel Quicksort.
J. Parallel Distrib. Comput., 1991

Duplicating keys to streamline sorting on a mesh-connected computer.
Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing, 1991

Optimal Broadcasting in Faulty Hypercubes.
Proceedings of the 1991 International Symposium on Fault-Tolerant Computing, 1991

Unifying Binary-Search Trees and Permutations.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990
Turing Machines With Access to History
Inf. Comput., December, 1990

Sorting Roughly Sorted Sequences in Parallel.
Inf. Process. Lett., 1990

1989
A Hierarchy of Propositional Horn Formulas.
Theor. Comput. Sci., 1989

Parallel Iterated Bucket Sort.
Inf. Process. Lett., 1989

Sorting within Distance Bound on a Mesh-Connected Processor Array.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989

Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1989, 1989

New Simulations between CRCW PRAMs.
Proceedings of the Fundamentals of Computation Theory, 1989

1988
A Parallel Bucket Sort.
Inf. Process. Lett., 1988

Testing Isomorphism of Outerplanar Graphs in Parallel.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models.
Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1987
Proving NP-completeness Using BOUNDED TILING.
Elektronische Informationsverarbeitung und Kybernetik, 1987

A note on the polynomial-time hierarchy and the quantified Boolean formulas.
Bulletin of the EATCS, 1987

Saturating Flows in Networks.
Proceedings of the Fundamentals of Computation Theory, 1987

1986
Domino-Tiling Games.
J. Comput. Syst. Sci., 1986

1985
Algorithms solving path systems.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts.
Inf. Process. Lett., 1984

From domino tilings to a new model of computation.
Proceedings of the Computation Theory, 1984

1982
On the Computational Complexity of Satisfiability in Propositional Logics of Programs.
Theor. Comput. Sci., 1982

On the Decidability of Propositional Algorithmic Logic.
Math. Log. Q., 1982

Completeness Proofs for Some Logics of Programs.
Math. Log. Q., 1982

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

On four logics of programs and complexity of their satisfiability problems: extended abstract.
Proceedings of the Logics of Programs and Their Applications, 1980


  Loading...