Bogdan S. Chlebus

From MaRDI portal
Person:529039

Available identifiers

zbMath Open chlebus.bogdan-stanislawMaRDI QIDQ529039

List of research outcomes

PublicationDate of PublicationType
Deterministic Fault-Tolerant Distributed Computing in Linear Time and Communication2024-03-26Paper
Flexible scheduling of transactional memory on trees2023-10-12Paper
Flexible scheduling of transactional memory on trees2023-06-12Paper
Fast deterministic simulation of computations on faulty parallel machines2023-05-08Paper
Shorter queues for permutation routing on meshes2022-08-18Paper
Distributed bare-bones communication in wireless networks2022-04-01Paper
Performing tasks on synchronous restartable message-passing processors2020-12-03Paper
Deterministic broadcasting in ad hoc radio networks2020-12-03Paper
Universal stability in multi-hop radio networks2020-09-07Paper
Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms2020-07-30Paper
Sparse networks supporting efficient reliable broadcasting2019-03-29Paper
Packet latency of deterministic broadcasting in adversarial multiple access channels2018-12-10Paper
Stability of adversarial routing with feedback2018-05-23Paper
Naming a Channel with Beeps2018-01-05Paper
Adversarial multiple access channels with individual injection rates2017-10-12Paper
Doing-it-all with bounded work and communication2017-05-18Paper
The do-all problem in broadcast networks2016-03-04Paper
Scalable wake-up of multi-channel single-hop radio networks2016-01-21Paper
A better wake-up in radio networks2015-08-03Paper
Broadcasting in ad hoc multiple access channels2015-05-22Paper
Adversarial queuing on the multiple-access channel2015-03-10Paper
Asynchronous exclusive selection2014-12-12Paper
Adversarial Queuing on the Multiple Access Channel2014-09-09Paper
Fast scalable deterministic consensus for crash failures2014-07-23Paper
Broadcasting in Ad Hoc Multiple Access Channels2013-12-17Paper
Maximum throughput of multiple access channels in adversarial environments2013-06-28Paper
Performing work in broadcast networks2013-06-13Paper
Efficient Distributed Communication in Ad-Hoc Radio Networks2011-07-07Paper
Scalable Quantum Consensus for Crash Failures2010-09-10Paper
Cooperative asynchronous update of shared memory2010-08-16Paper
Collective asynchronous reading with polylogarithmic worst-case overhead2010-08-15Paper
Many-to-many communication in radio networks2009-06-16Paper
Average-Time Complexity of Gossiping in Radio Networks2009-03-12Paper
A robust randomized algorithm to perform independent tasks2009-02-23Paper
Time and Communication Efficient Consensus for Crash Failures2008-09-09Paper
Centralized asynchronous broadcast in radio networks2007-09-19Paper
Robust gossiping with an application to consensus2006-12-07Paper
Fundamentals of Computation Theory2006-10-20Paper
Automata, Languages and Programming2006-01-10Paper
Structural Information and Communication Complexity2005-09-07Paper
Broadcasting spanning forests on a multiple-access channel2005-02-11Paper
https://portal.mardi4nfdi.de/entity/Q48188682004-09-24Paper
Randomization helps to perform independent tasks reliably2004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q44371322003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44329622003-10-29Paper
https://portal.mardi4nfdi.de/entity/Q44303162003-10-20Paper
https://portal.mardi4nfdi.de/entity/Q47886062003-06-02Paper
https://portal.mardi4nfdi.de/entity/Q45369392002-06-25Paper
https://portal.mardi4nfdi.de/entity/Q27541902001-12-06Paper
Algorithms for the parallel alternating direction access machine2000-08-21Paper
https://portal.mardi4nfdi.de/entity/Q49527112000-05-10Paper
https://portal.mardi4nfdi.de/entity/Q42476791999-06-16Paper
https://portal.mardi4nfdi.de/entity/Q42354341999-03-22Paper
Deterministic Permutation Routing on Meshes1997-10-13Paper
https://portal.mardi4nfdi.de/entity/Q43429071997-06-24Paper
Reliable Broadcasting in Hypercubes with Random Link and Node Failures1997-05-22Paper
\(O(\log \log n)\)-time integer geometry on the CRCW PRAM1995-07-24Paper
https://portal.mardi4nfdi.de/entity/Q47646271995-05-04Paper
Fast gossiping with short unreliable messages1994-12-11Paper
Sorting on a Mesh-Connected Computer with Delaying Links1994-05-12Paper
https://portal.mardi4nfdi.de/entity/Q39748571992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39751401992-06-26Paper
Turing machines with access to history1990-01-01Paper
Sorting roughly sorted sequences in parallel1990-01-01Paper
A hierarchy of propositional Horn formuls1989-01-01Paper
Parallel iterated bucket sort1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34843471989-01-01Paper
A parallel bucket sort1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37952441988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37774531987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37799711987-01-01Paper
Domino-tiling games1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36928661985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37410561985-01-01Paper
Probabilistic Turing machines and recursively enumerable Dedekind cuts1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36591201983-01-01Paper
On the computational complexity of satisfiability in propositional logics of programs1982-01-01Paper
Completeness Proofs for Some Logics of Programs1982-01-01Paper
On the Decidability of Propositional Algorithmic Logic1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47467821981-01-01Paper
Decidability and Definability Results Concerning Well‐Orderings and Some Extensions of First Order Logic1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39014931979-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Bogdan S. Chlebus