The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bogdan S. Chlebus: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis
    Oblivious gossiping in ad-hoc radio networks. [Citation Graph (0, 0)][DBLP]
    DIAL-M, 2001, pp:44-51 [Conf]
  2. Bogdan S. Chlebus, Anna Gambin, Piotr Indyk
    PRAM Computations Resilient to Memory Faults. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:401-412 [Conf]
  3. Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
    Fast Deterministic Simulation of Computations on Faulty Parallel Machines. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:89-101 [Conf]
  4. Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn
    Routing on the PADAM: Degrees of Optimality. [Citation Graph (0, 0)][DBLP]
    Euro-Par, 1997, pp:272-279 [Conf]
  5. Bogdan S. Chlebus
    Algorithms solving path systems. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:70-79 [Conf]
  6. Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks
    Saturating Flows in Networks. [Citation Graph (0, 0)][DBLP]
    FCT, 1987, pp:82-91 [Conf]
  7. Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
    New Simulations between CRCW PRAMs. [Citation Graph (0, 0)][DBLP]
    FCT, 1989, pp:95-104 [Conf]
  8. Bogdan S. Chlebus, Dariusz R. Kowalski
    Almost Optimal Explicit Selectors. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:270-280 [Conf]
  9. Bogdan S. Chlebus, Imrich Vrto
    Unifying Binary-Search Trees and Permutations. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:190-199 [Conf]
  10. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Optimal Broadcasting in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    FTCS, 1991, pp:266-273 [Conf]
  11. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Waking up an Anonymous Faulty Network from a Single Source. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1994, pp:187-193 [Conf]
  12. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sparse Networks Supporting Efficient Reliable Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICALP, 1993, pp:388-397 [Conf]
  13. Bogdan S. Chlebus, Anna Gambin, Piotr Indyk
    Shared-Memory Simulations on a Faulty-Memory DMM. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:586-597 [Conf]
  14. Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik
    On the Wake-Up Problem in Radio Networks. [Citation Graph (0, 0)][DBLP]
    ICALP, 2005, pp:347-359 [Conf]
  15. Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson
    Deterministic Radio Broadcasting. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:717-728 [Conf]
  16. Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki
    Distributing Tokens on a Hypercube without Error Accumulation. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:573-578 [Conf]
  17. Bogdan S. Chlebus, Jop F. Sibeyn
    Routing on Meshes in Optimum Time and with Really Small Queues. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2003, pp:56- [Conf]
  18. Bogdan S. Chlebus
    On four logics of programs and complexity of their satisfiability problems: extended abstract. [Citation Graph (0, 0)][DBLP]
    Logic of Programs, 1980, pp:98-107 [Conf]
  19. Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
    Parallel Alternating-Direction Access Machine. [Citation Graph (0, 0)][DBLP]
    MFCS, 1996, pp:267-278 [Conf]
  20. Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik
    Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:231-239 [Conf]
  21. Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik
    Testing Isomorphism of Outerplanar Graphs in Parallel. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:220-230 [Conf]
  22. Bogdan S. Chlebus, Krzysztof Diks, Wojciech Rytter, Tomasz Szymacha
    Parallel Complexity of Lexicographically First Order Problems for Tree-Structured Graphs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1989, pp:185-195 [Conf]
  23. Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
    Shorter Queues for Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:597-607 [Conf]
  24. Bogdan S. Chlebus
    Sorting within Distance Bound on a Mesh-Connected Processor Array. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:232-238 [Conf]
  25. Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik
    On Many-to-Many Communication in Packet Radio Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2006, pp:260-274 [Conf]
  26. Bogdan S. Chlebus, Dariusz R. Kowalski
    A better wake-up in radio networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:266-274 [Conf]
  27. Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas
    The do-all problem in broadcast networks. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:117-127 [Conf]
  28. Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
    Adversarial queuing on the multiple-access channel. [Citation Graph (0, 0)][DBLP]
    PODC, 2006, pp:92-101 [Conf]
  29. Bogdan S. Chlebus, Sinh Hoa Nguyen
    On Finding Optimal Discretizations for Two Attributes. [Citation Graph (0, 0)][DBLP]
    Rough Sets and Current Trends in Computing, 1998, pp:537-544 [Conf]
  30. Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
    Finding Spanning Forests by Broadcasting. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:41-56 [Conf]
  31. Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
    Average-Time Complexity of Gossiping in Radio Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2006, pp:253-267 [Conf]
  32. Bogdan S. Chlebus, Mariusz A. Rokicki
    Asynchronous Broadcast in Radio Networks. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:57-68 [Conf]
  33. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
    Deterministic broadcasting in unknown radio networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:861-870 [Conf]
  34. Bogdan S. Chlebus
    On the Klee`s Measure Problem in Small Dimensions. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 1998, pp:304-311 [Conf]
  35. Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto
    Towards practical deteministic write-all algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:271-280 [Conf]
  36. Bogdan S. Chlebus, Dariusz R. Kowalski
    Gossiping to reach consensus. [Citation Graph (0, 0)][DBLP]
    SPAA, 2002, pp:220-229 [Conf]
  37. Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn
    Deterministic Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:284- [Conf]
  38. Bogdan S. Chlebus, Leszek Gasieniec
    Optimal Pattern Matching on Meshes. [Citation Graph (0, 0)][DBLP]
    STACS, 1994, pp:213-224 [Conf]
  39. Bogdan S. Chlebus, Dariusz R. Kowalski
    Cooperative asynchronous update of shared memory. [Citation Graph (0, 0)][DBLP]
    STOC, 2005, pp:733-739 [Conf]
  40. Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman
    Collective asynchronous reading with polylogarithmic worst-case overhead. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:321-330 [Conf]
  41. Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman
    Bounding Work and Communication in Robust Cooperative Computation. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:295-310 [Conf]
  42. Bogdan S. Chlebus, Dariusz R. Kowalski
    Randomization Helps to Perform Tasks on Processors Prone to Failures. [Citation Graph (0, 0)][DBLP]
    DISC, 1999, pp:284-296 [Conf]
  43. Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman
    Performing Tasks on Restartable Message-Passing Processors. [Citation Graph (0, 0)][DBLP]
    WDAG, 1997, pp:96-110 [Conf]
  44. Bogdan S. Chlebus, Dariusz R. Kowalski
    Time and Communication Efficient Consensus for Crash Failures. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:314-328 [Conf]
  45. Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk
    O(log log n)-Time Integer Geometry on the CRCW PRAM. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:14, n:1, pp:52-69 [Journal]
  46. Bogdan S. Chlebus
    Mesh Sorting and Selection Optimal to the Average. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1997, v:16, n:2, pp:- [Journal]
  47. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Reliable Broadcasting in Hypercubes with Random Link and Node Failures. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1996, v:5, n:, pp:337-350 [Journal]
  48. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Fast gossiping with short unreliable messages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:53, n:1-3, pp:15-24 [Journal]
  49. Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
    Deterministic broadcasting in ad hoc radio networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2002, v:15, n:1, pp:27-38 [Journal]
  50. Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas
    Performing work in broadcast networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:6, pp:435-451 [Journal]
  51. Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman
    Performing tasks on synchronous restartable message-passing processors. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:1, pp:49-64 [Journal]
  52. Bogdan S. Chlebus
    A note on the polynomial-time hierarchy and the quantified Boolean formulas. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1987, v:31, n:, pp:15-21 [Journal]
  53. Bogdan S. Chlebus
    Proving NP-completeness Using BOUNDED TILING. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1987, v:23, n:8/9, pp:479-484 [Journal]
  54. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Transition-Optimal Token Distribution. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:32, n:3-4, pp:313-328 [Journal]
  55. Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc
    Deterministic Computations on a PRAM with Static Processor and Memory Faults. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:55, n:3-4, pp:285-306 [Journal]
  56. Bogdan S. Chlebus
    Turing Machines With Access to History [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:89, n:2, pp:133-143 [Journal]
  57. Tom Altman, Bogdan S. Chlebus
    Sorting Roughly Sorted Sequences in Parallel. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:33, n:6, pp:297-300 [Journal]
  58. Bogdan S. Chlebus
    A Parallel Bucket Sort. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:27, n:2, pp:57-61 [Journal]
  59. Bogdan S. Chlebus
    Parallel Iterated Bucket Sort. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:4, pp:181-183 [Journal]
  60. Marek Chrobak, Bogdan S. Chlebus
    Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1984, v:19, n:4, pp:167-171 [Journal]
  61. Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann
    Deterministic Permutation Routing on Meshes. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:22, n:1, pp:111-141 [Journal]
  62. Bogdan S. Chlebus
    Domino-Tiling Games. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:32, n:3, pp:374-392 [Journal]
  63. Bogdan S. Chlebus, Dariusz R. Kowalski
    Robust gossiping with an application to consensus. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2006, v:72, n:8, pp:1262-1281 [Journal]
  64. Bogdan S. Chlebus, Imrich Vrto
    Parallel Quicksort. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1991, v:11, n:4, pp:332-337 [Journal]
  65. Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski
    Broadcasting Spanning Forests on a Multiple-Access Channel. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:6, pp:711-733 [Journal]
  66. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sparse Networks Supporting Efficient Reliable Broadcasting. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1994, v:1, n:3, pp:332-345 [Journal]
  67. Bogdan S. Chlebus
    Two Selection Algorithms on a Mesh-Connected Computer. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:341-346 [Journal]
  68. Bogdan S. Chlebus, Dariusz R. Kowalski
    Randomization helps to perform independent tasks reliably. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:1, pp:11-41 [Journal]
  69. Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc
    Sorting on a Mesh-Connected Computer with Delaying Links. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1994, v:7, n:1, pp:119-132 [Journal]
  70. Bogdan S. Chlebus
    On the Computational Complexity of Satisfiability in Propositional Logics of Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:179-212 [Journal]
  71. Bogdan S. Chlebus
    A Hierarchy of Propositional Horn Formulas. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:68, n:1, pp:113-119 [Journal]
  72. Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski
    Algorithms for the parallel alternating direction access machine. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:245, n:2, pp:151-173 [Journal]
  73. Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki
    Stability of the Multiple-Access Channel Under Maximum Broadcast Loads. [Citation Graph (0, 0)][DBLP]
    SSS, 2007, pp:124-138 [Conf]
  74. Bogdan S. Chlebus, Mariusz A. Rokicki
    Centralized asynchronous broadcast in radio networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:1, pp:5-22 [Journal]

  75. Deterministic Broadcast on Multiple Access Channels. [Citation Graph (, )][DBLP]


  76. Adversarial Multiple Access Channel with Individual Injection Rates. [Citation Graph (, )][DBLP]


  77. Asynchronous exclusive selection. [Citation Graph (, )][DBLP]


  78. Fast scalable deterministic consensus for crash failures. [Citation Graph (, )][DBLP]


  79. Locally scalable randomized consensus for synchronous crash failures. [Citation Graph (, )][DBLP]


  80. Duplicating keys to streamline sorting on a mesh-connected computer. [Citation Graph (, )][DBLP]


  81. Scalable Quantum Consensus for Crash Failures. [Citation Graph (, )][DBLP]


  82. Many-to-Many Communication in Radio Networks. [Citation Graph (, )][DBLP]


  83. Maximum throughput of multiple access channels in adversarial environments. [Citation Graph (, )][DBLP]


Search in 0.447secs, Finished in 0.453secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002