default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBogdan S. Chlebus
Person information
- affiliation: Augusta University, Augusta, GA, USA
- affiliation (former): University of Colorado Denver
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j48]Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma:
Flexible scheduling of transactional memory on trees. Theor. Comput. Sci. 978: 114184 (2023)- [c71]Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel:
Stable Scheduling in Transactional Memory. CIAC 2023: 172-186 - [c70]Giorgos Chionas, Bogdan S. Chlebus, Dariusz R. Kowalski, Piotr Krysta:
Adversarial Contention Resolution Games. IJCAI 2023: 2598-2606 - [c69]Bogdan S. Chlebus
, Dariusz Rafal Kowalski, Jan Olkowski:
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. PODC 2023: 344-354 - [c68]Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski, Jedrzej Olkowski:
Disconnected Agreement in Networks Prone to Link Failures. SSS 2023: 207-222 - [i21]Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski:
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication. CoRR abs/2305.11644 (2023) - 2022
- [j47]Bogdan S. Chlebus, Dariusz R. Kowalski, Shailesh Vaya:
Distributed bare-bones communication in wireless networks. Distributed Comput. 35(1): 59-80 (2022) - [c67]Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski:
Brief Announcement: Deterministic Consensus and Checkpointing with Crashes: Time and Communication Efficiency. PODC 2022: 106-108 - [c66]Costas Busch, Bogdan S. Chlebus, Maurice Herlihy, Miroslav Popovic, Pavan Poudel, Gokarna Sharma:
Flexible Scheduling of Transactional Memory on Trees. SSS 2022: 146-163 - [i20]Costas Busch, Bogdan S. Chlebus, Dariusz R. Kowalski, Pavan Poudel:
Stable Scheduling in Transactional Memory. CoRR abs/2208.07359 (2022) - 2021
- [i19]Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski, Jedrzej Olkowski:
Consensus in Networks Prone to Link Failures. CoRR abs/2102.01251 (2021) - [i18]Bader A. Aldawsari, Bogdan S. Chlebus, Dariusz R. Kowalski:
Broadcasting on Adversarial Multiple Access Channels. CoRR abs/2112.14655 (2021) - 2020
- [j46]Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
Universal stability in multi-hop radio networks. J. Comput. Syst. Sci. 114: 48-64 (2020) - [c65]Bogdan S. Chlebus, Dariusz R. Kowalski, Jan Olkowski:
Fast Agreement in Networks with Byzantine Nodes. DISC 2020: 30:1-30:18
2010 – 2019
- 2019
- [j45]Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Packet latency of deterministic broadcasting in adversarial multiple access channels. J. Comput. Syst. Sci. 99: 27-52 (2019) - [c64]Bader A. Aldawsari, Bogdan S. Chlebus, Dariusz R. Kowalski:
Broadcasting on Adversarial Multiple Access Channels. NCA 2019: 1-4 - [c63]Bogdan S. Chlebus, Elijah Hradovich, Tomasz Jurdzinski, Marek Klonowski, Dariusz R. Kowalski:
Energy Efficient Adversarial Routing in Shared Channels. SPAA 2019: 191-200 - 2018
- [i17]Bogdan S. Chlebus:
Randomized Communication in Radio Networks. CoRR abs/1801.00074 (2018) - [i16]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Maximum Throughput of Multiple Access Channels in Adversarial Environments. CoRR abs/1801.00194 (2018) - [i15]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc:
Deterministic Computations on a PRAM with Static Processor and Memory Faults. CoRR abs/1801.00237 (2018) - [i14]Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski:
Broadcasting Spanning Forests on a Multiple-Access Channel. CoRR abs/1801.00365 (2018) - [i13]Bogdan S. Chlebus, Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Routing in Wireless Networks with Interferences. CoRR abs/1808.02144 (2018) - [i12]Bogdan S. Chlebus, Elijah Hradovich, Tomasz Jurdzinski, Marek Klonowski, Dariusz R. Kowalski:
Energy Efficient Adversarial Routing in Shared Channels. CoRR abs/1810.11441 (2018) - [i11]Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
Stability of Adversarial Routing with Feedback. CoRR abs/1812.11113 (2018) - 2017
- [j44]Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo:
Naming a Channel with Beeps. Fundam. Informaticae 153(3): 199-219 (2017) - [j43]Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Schwarzmann:
Doing-it-All with bounded work and communication. Inf. Comput. 254: 1-40 (2017) - [j42]Bogdan S. Chlebus, Vicent Cholvi, Pawel Garncarek, Tomasz Jurdzinski, Dariusz R. Kowalski:
Routing in Wireless Networks With Interferences. IEEE Commun. Lett. 21(9): 2105-2108 (2017) - [j41]Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki:
Adversarial Multiple Access Channels with Individual Injection Rates. Theory Comput. Syst. 61(3): 820-850 (2017) - [c62]Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo:
Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms. OPODIS 2017: 15:1-15:17 - [i10]Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Packet Latency of Deterministic Broadcasting in Adversarial Multiple Access Channels. CoRR abs/1701.00186 (2017) - 2016
- [j40]Bogdan S. Chlebus, Gianluca De Marco, Dariusz R. Kowalski:
Scalable wake-up of multi-channel single-hop radio networks. Theor. Comput. Sci. 615: 23-44 (2016) - [c61]Bogdan S. Chlebus, Shailesh Vaya:
Distributed communication in bare-bones wireless networks. ICDCN 2016: 1:1-1:10 - [i9]Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
Universal Routing in Multi-hop Radio Networks. CoRR abs/1606.03571 (2016) - [i8]Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo:
Naming a Channel with Beeps. CoRR abs/1608.04174 (2016) - 2015
- [j39]Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
Stability of adversarial routing with feedback. Networks 66(2): 88-97 (2015) - [j38]Lakshmi Anantharamu, Bogdan S. Chlebus:
Broadcasting in ad hoc multiple access channels. Theor. Comput. Sci. 584: 155-176 (2015) - [i7]Bogdan S. Chlebus, Gianluca De Marco, Muhammed Talo:
Anonymous Processors with Synchronous Shared Memory. CoRR abs/1507.02272 (2015) - [i6]Bogdan S. Chlebus, Dariusz R. Kowalski, Shailesh Vaya:
Distributed Communication in Bare-Bones Wireless Networks. CoRR abs/1510.07357 (2015) - [i5]Bogdan S. Chlebus, Dariusz R. Kowalski:
Asynchronous Exclusive Selection. CoRR abs/1512.09314 (2015) - 2014
- [c60]Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
Universal routing in multi hop radio network. FOMC 2014: 19-28 - [c59]Bogdan S. Chlebus, Gianluca De Marco, Dariusz R. Kowalski:
Scalable Wake-up of Multi-channel Single-Hop Radio Networks. OPODIS 2014: 186-201 - [i4]Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman:
Doing-it-All with Bounded Work and Communication. CoRR abs/1409.4711 (2014) - [i3]Bogdan S. Chlebus, Gianluca De Marco, Dariusz R. Kowalski:
Scalable Wake-up of Multi-Channel Single-Hop Radio Networks. CoRR abs/1411.4498 (2014) - 2013
- [c58]Bogdan S. Chlebus, Vicent Cholvi, Dariusz R. Kowalski:
Stability of Adversarial Routing with Feedback. NETYS 2013: 206-220 - [c57]Lakshmi Anantharamu, Bogdan S. Chlebus:
Broadcasting in Ad Hoc Multiple Access Channels. SIROCCO 2013: 237-248 - [i2]Lakshmi Anantharamu, Bogdan S. Chlebus:
Broadcasting in Ad Hoc Multiple Access Channels. CoRR abs/1306.6109 (2013) - [i1]Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki:
Adversarial Multiple Access Channels with Individual Injection Rates. CoRR abs/1309.6610 (2013) - 2012
- [j37]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Adversarial Queuing on the Multiple Access Channel. ACM Trans. Algorithms 8(1): 5:1-5:31 (2012) - [c56]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc:
Electing a Leader in Multi-hop Radio Networks. OPODIS 2012: 106-120 - 2011
- [j36]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) - [c55]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Pelc, Mariusz A. Rokicki:
Efficient Distributed Communication in Ad-Hoc Radio Networks. ICALP (2) 2011: 613-624 - [c54]Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Medium Access Control for Adversarial Channels with Jamming. SIROCCO 2011: 89-100 - 2010
- [c53]Lakshmi Anantharamu, Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Deterministic Broadcast on Multiple Access Channels. INFOCOM 2010: 146-150 - [c52]Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski:
Scalable Quantum Consensus for Crash Failures. DISC 2010: 236-250
2000 – 2009
- 2009
- [j35]Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik:
Many-to-Many Communication in Radio Networks. Algorithmica 54(1): 118-139 (2009) - [j34]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Maximum throughput of multiple access channels in adversarial environments. Distributed Comput. 22(2): 93-116 (2009) - [c51]Lakshmi Anantharamu, Bogdan S. Chlebus, Mariusz A. Rokicki:
Adversarial Multiple Access Channel with Individual Injection Rates. OPODIS 2009: 174-188 - [c50]Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Strojnowski:
Fast scalable deterministic consensus for crash failures. PODC 2009: 111-120 - [c49]Bogdan S. Chlebus, Dariusz R. Kowalski:
Locally scalable randomized consensus for synchronous crash failures. SPAA 2009: 290-299 - 2008
- [j33]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) - [c48]Bogdan S. Chlebus, Dariusz R. Kowalski:
Asynchronous exclusive selection. PODC 2008: 375-384 - [e2]Sotiris E. Nikoletseas, Bogdan S. Chlebus, David B. Johnson, Bhaskar Krishnamachari:
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 [contents] - 2007
- [j32]Bogdan S. Chlebus, Mariusz A. Rokicki:
Centralized asynchronous broadcast in radio networks. Theor. Comput. Sci. 383(1): 5-22 (2007) - [c47]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Stability of the Multiple-Access Channel Under Maximum Broadcast Loads. SSS 2007: 124-138 - 2006
- [j31]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas:
Performing work in broadcast networks. Distributed Comput. 18(6): 435-451 (2006) - [j30]Bogdan S. Chlebus, Dariusz R. Kowalski:
Robust gossiping with an application to consensus. J. Comput. Syst. Sci. 72(8): 1262-1281 (2006) - [c46]Bogdan S. Chlebus, Dariusz R. Kowalski, Tomasz Radzik:
On Many-to-Many Communication in Packet Radio Networks. OPODIS 2006: 260-274 - [c45]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Adversarial queuing on the multiple-access channel. PODC 2006: 92-101 - [c44]Bogdan S. Chlebus, Dariusz R. Kowalski, Mariusz A. Rokicki:
Average-Time Complexity of Gossiping in Radio Networks. SIROCCO 2006: 253-267 - [c43]Bogdan S. Chlebus, Dariusz R. Kowalski:
Time and Communication Efficient Consensus for Crash Failures. DISC 2006: 314-328 - 2005
- [c42]Bogdan S. Chlebus, Dariusz R. Kowalski:
Almost Optimal Explicit Selectors. FCT 2005: 270-280 - [c41]Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Tomasz Radzik:
On the Wake-Up Problem in Radio Networks. ICALP 2005: 347-359 - [c40]Bogdan S. Chlebus, Dariusz R. Kowalski:
Cooperative asynchronous update of shared memory. STOC 2005: 733-739 - 2004
- [j29]Bogdan S. Chlebus, Dariusz R. Kowalski:
Randomization helps to perform independent tasks reliably. Random Struct. Algorithms 24(1): 11-41 (2004) - [c39]Bogdan S. Chlebus, Dariusz R. Kowalski:
A better wake-up in radio networks. PODC 2004: 266-274 - [c38]Bogdan S. Chlebus, Mariusz A. Rokicki:
Asynchronous Broadcast in Radio Networks. SIROCCO 2004: 57-68 - [c37]Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman:
Collective asynchronous reading with polylogarithmic worst-case overhead. STOC 2004: 321-330 - 2003
- [j28]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc:
Deterministic Computations on a PRAM with Static Processor and Memory Faults. Fundam. Informaticae 55(3-4): 285-306 (2003) - [j27]Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski:
Broadcasting Spanning Forests on a Multiple-Access Channel. Theory Comput. Syst. 36(6): 711-733 (2003) - [c36]Bogdan S. Chlebus, Jop F. Sibeyn:
Routing on Meshes in Optimum Time and with Really Small Queues. IPDPS 2003: 56 - 2002
- [j26]Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter:
Deterministic broadcasting in ad hoc radio networks. Distributed Comput. 15(1): 27-38 (2002) - [c35]Bogdan S. Chlebus, Karol Golab, Dariusz R. Kowalski:
Finding Spanning Forests by Broadcasting. SIROCCO 2002: 41-56 - [c34]Bogdan S. Chlebus, Dariusz R. Kowalski:
Gossiping to reach consensus. SPAA 2002: 220-229 - [c33]Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman:
Bounding Work and Communication in Robust Cooperative Computation. DISC 2002: 295-310 - 2001
- [j25]Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman:
Performing tasks on synchronous restartable message-passing processors. Distributed Comput. 14(1): 49-64 (2001) - [c32]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Lingas, Aris Pagourtzis:
Oblivious gossiping in ad-hoc radio networks. DIAL-M 2001: 44-51 - [c31]Bogdan S. Chlebus, Dariusz R. Kowalski, Andrzej Lingas:
The do-all problem in broadcast networks. PODC 2001: 117-127 - [c30]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 - 2000
- [j24]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) - [c29]Bogdan S. Chlebus, Leszek Gasieniec, Anna Östlin, John Michael Robson:
Deterministic Radio Broadcasting. ICALP 2000: 717-728 - [c28]Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter:
Deterministic broadcasting in unknown radio networks. SODA 2000: 861-870
1990 – 1999
- 1999
- [c27]Bogdan S. Chlebus, Dariusz R. Kowalski:
Randomization Helps to Perform Tasks on Processors Prone to Failures. DISC 1999: 284-296 - 1998
- [c26]Bogdan S. Chlebus, Sinh Hoa Nguyen:
On Finding Optimal Discretizations for Two Attributes. Rough Sets and Current Trends in Computing 1998: 537-544 - [c25]Bogdan S. Chlebus:
On the Klee's Measure Problem in Small Dimensions. SOFSEM 1998: 304-311 - 1997
- [j23]Bogdan S. Chlebus:
Mesh Sorting and Selection Optimal to the Average. Comput. Artif. Intell. 16(2): 141-152 (1997) - [j22]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Transition-Optimal Token Distribution. Fundam. Informaticae 32(3-4): 313-328 (1997) - [j21]Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
Deterministic Permutation Routing on Meshes. J. Algorithms 22(1): 111-141 (1997) - [c24]Bogdan S. Chlebus, Artur Czumaj, Jop F. Sibeyn:
Routing on the PADAM: Degrees of Optimality. Euro-Par 1997: 272-279 - [c23]Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman:
Performing Tasks on Restartable Message-Passing Processors. WDAG 1997: 96-110 - [e1]Bogdan S. Chlebus, Ludwik Czaja:
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 [contents] - 1996
- [j20]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Reliable Broadcasting in Hypercubes with Random Link and Node Failures. Comb. Probab. Comput. 5: 337-350 (1996) - [c22]Bogdan S. Chlebus, Anna Gambin, Piotr Indyk:
Shared-Memory Simulations on a Faulty-Memory DMM. ICALP 1996: 586-597 - [c21]Bogdan S. Chlebus, José D. P. Rolim, Giora Slutzki:
Distributing Tokens on a Hypercube without Error Accumulation. IPPS 1996: 573-578 - [c20]Bogdan S. Chlebus, Artur Czumaj, Leszek Gasieniec, Miroslaw Kowaluk, Wojciech Plandowski:
Parallel Alternating-Direction Access Machine. MFCS 1996: 267-278 - 1995
- [j19]Bogdan S. Chlebus, Krzysztof Diks, Miroslaw Kowaluk:
O(log log n)-Time Integer Geometry on the CRCW PRAM. Algorithmica 14(1): 52-69 (1995) - [c19]Bogdan S. Chlebus, Leszek Gasieniec, Andrzej Pelc:
Fast Deterministic Simulation of Computations on Faulty Parallel Machines. ESA 1995: 89-101 - 1994
- [j18]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Fast gossiping with short unreliable messages. Discret. Appl. Math. 53(1-3): 15-24 (1994) - [j17]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting. Nord. J. Comput. 1(3): 332-345 (1994) - [j16]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sorting on a Mesh-Connected Computer with Delaying Links. SIAM J. Discret. Math. 7(1): 119-132 (1994) - [c18]Bogdan S. Chlebus, Anna Gambin, Piotr Indyk:
PRAM Computations Resilient to Memory Faults. ESA 1994: 401-412 - [c17]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Waking up an Anonymous Faulty Network from a Single Source. HICSS (2) 1994: 187-193 - [c16]Jop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann:
Shorter Queues for Permutation Routing on Meshes. MFCS 1994: 597-607 - [c15]Bogdan S. Chlebus, Leszek Gasieniec:
Optimal Pattern Matching on Meshes. STACS 1994: 213-224 - 1993
- [c14]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Sparse Networks Supporting Efficient Reliable Broadcasting. ICALP 1993: 388-397 - [c13]Bogdan S. Chlebus, Michael Kaufmann, Jop F. Sibeyn:
Deterministic Permutation Routing on Meshes. SPDP 1993: 284 - 1992
- [j15]Bogdan S. Chlebus:
Two Selection Algorithms on a Mesh-Connected Computer. Parallel Process. Lett. 2: 341-346 (1992) - 1991
- [j14]Bogdan S. Chlebus, Imrich Vrto:
Parallel Quicksort. J. Parallel Distributed Comput. 11(4): 332-337 (1991) - [c12]Bogdan S. Chlebus, Imrich Vrto:
Unifying Binary-Search Trees and Permutations. FCT 1991: 190-199 - [c11]Bogdan S. Chlebus, Krzysztof Diks, Andrzej Pelc:
Optimal Broadcasting in Faulty Hypercubes. FTCS 1991: 266-273 - [c10]Bogdan S. Chlebus:
Duplicating keys to streamline sorting on a mesh-connected computer. SPDP 1991: 296-300 - 1990
- [j13]Bogdan S. Chlebus:
Turing Machines With Access to History. Inf. Comput. 89(2): 133-143 (1990) - [j12]Tom Altman, Bogdan S. Chlebus:
Sorting Roughly Sorted Sequences in Parallel. Inf. Process. Lett. 33(6): 297-300 (1990)
1980 – 1989
- 1989
- [j11]Bogdan S. Chlebus:
Parallel Iterated Bucket Sort. Inf. Process. Lett. 31(4): 181-183 (1989) - [j10]Bogdan S. Chlebus:
A Hierarchy of Propositional Horn Formulas. Theor. Comput. Sci. 68(1): 113-119 (1989) - [c9]Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
New Simulations between CRCW PRAMs. FCT 1989: 95-104 - [c8]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 - [c7]Bogdan S. Chlebus:
Sorting within Distance Bound on a Mesh-Connected Processor Array. Optimal Algorithms 1989: 232-238 - 1988
- [j9]Bogdan S. Chlebus:
A Parallel Bucket Sort. Inf. Process. Lett. 27(2): 57-61 (1988) - [c6]Bogdan S. Chlebus, Krzysztof Diks, Tomasz Radzik:
Testing Isomorphism of Outerplanar Graphs in Parallel. MFCS 1988: 220-230 - [c5]Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik:
Efficient Simulations Between Concurrent-Read Concurrent-Write PRAM Models. MFCS 1988: 231-239 - 1987
- [j8]Bogdan S. Chlebus:
A note on the polynomial-time hierarchy and the quantified Boolean formulas. Bull. EATCS 31: 15-21 (1987) - [j7]Bogdan S. Chlebus:
Proving NP-completeness Using BOUNDED TILING. J. Inf. Process. Cybern. 23(8/9): 479-484 (1987) - [c4]Bogdan S. Chlebus, Marek Chrobak, Krzysztof Diks:
Saturating Flows in Networks. FCT 1987: 82-91 - 1986
- [j6]Bogdan S. Chlebus:
Domino-Tiling Games. J. Comput. Syst. Sci. 32(3): 374-392 (1986) - 1985
- [c3]Bogdan S. Chlebus:
Algorithms solving path systems. FCT 1985: 70-79 - 1984
- [j5]Marek Chrobak, Bogdan S. Chlebus:
Probabilistic Turing Machines and Recursively Enumerable Dedekind Cuts. Inf. Process. Lett. 19(4): 167-171 (1984) - [c2]Bogdan S. Chlebus:
From domino tilings to a new model of computation. Symposium on Computation Theory 1984: 24-33 - 1982
- [j4]Bogdan S. Chlebus:
Completeness Proofs for Some Logics of Programs. Math. Log. Q. 28(4-7): 49-62 (1982) - [j3]Bogdan S. Chlebus:
On the Decidability of Propositional Algorithmic Logic. Math. Log. Q. 28(14-18): 247-261 (1982) - [j2]Bogdan S. Chlebus:
On the Computational Complexity of Satisfiability in Propositional Logics of Programs. Theor. Comput. Sci. 21: 179-212 (1982) - 1980
- [j1]Bogdan S. Chlebus:
Decidability and Definability Results Concerning Well-Orderings and Some Extensions of First Order Logic. Math. Log. Q. 26(34-35): 529-536 (1980) - [c1]Bogdan S. Chlebus:
On four logics of programs and complexity of their satisfiability problems: extended abstract. Logic of Programs 1980: 98-107
Coauthor Index
Dariusz R. Kowalski
aka: Dariusz Rafal Kowalski
aka: Dariusz Rafal Kowalski
[c71] [c70] [c69] [c68] [i21] [j47] [c67] [i20] [i19] [i18] [j46] [c65] [j45] [c64] [c63] [i16] [i14] [i13] [i12] [i11] [j43] [j42] [i10] [j40] [i9] [j39] [i6] [i5] [c60] [c59] [i4] [i3] [c58] [j37] [c56] [c55] [c54] [c53] [c52] [j35] [j34] [c50] [c49] [j33] [c48] [c47] [j31] [j30] [c46] [c45] [c44] [c43] [c42] [c41] [c40] [j29] [c39] [c37] [j27] [c35] [c34] [c33] [c31] [c30] [c27]
Alexander A. Schwarzmann
aka: Alexander A. Shvartsman
aka: Alexander A. Shvartsman
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
