Your search returned the following 7 documents:

7. Cooperative asynchronous update of shared memory
   Bogdan S. Chlebus and Dariusz Kowalski
   In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC 2005), Baltimore, USA, 2005, 733-739
   
6. A better wake-up in radio networks
   Bogdan S. Chlebus and Dariusz Kowalski
   In: Proceedings of the 23rd Annual ACM Symposium on Principles of Distributed Computing, PODC 2004, St. John's, Newfoundland, Canada, 2004, 266-274
   
5. Collective asynchronous reading with polylogarithmic worst-case overhead
   Bogdan S. Chlebus, Dariusz Kowalski, and Alex Shvartsman
   In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing (STOC-04), Chicago, USAJune 13 - 15, 2004, 2004, 321-330
   
4. Randomization helps to perform independent tasks reliably
   Bogdan S. Chlebus and Dariusz Kowalski
   Random Structures and Algorithms 24: 11-41, 2004
   
3. Parallel Alternating-Direction Access Machine
   Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, and Wojciech Plandowski
   In: Mathematical Foundations of Computer Science 1996: 21st International Symposium (MFCS'96), Cracow, Poland, September, 2-6, 1996, 255-266
   
2. Deterministic Permutation Routing on Meshes
   Jop F. Sibeyn, Michael Kaufmann, and Bogdan S. Chlebus
   Journal of Algorithms 22 (1): 111-141, 1997
   
1. Routing on the PADAM: Degrees of Optimality
   Bogdan S. Chlebus, Artur Czumaj, and Jop F. Sibeyn
   In: Proceedings of the 3rd International Euro-Par Conference on Parallel Processing (Euro-Par-97), Passau, Germany, August 26-29, 1997, 272-279