Dariusz R. Kowalski

From MaRDI portal
Person:282239

Available identifiers

zbMath Open kowalski.dariusz-rMaRDI QIDQ282239

List of research outcomes

PublicationDate of PublicationType
Correction to: ``Dynamic multiple-message broadcast: bounding throughput in the affectance model2023-10-30Paper
Reaching consensus in ad-hoc diffusion networks2023-10-20Paper
Restrained medium access control on adversarial shared channels2023-08-21Paper
Dynamic multiple-message broadcast: bounding throughput in the affectance model2023-08-17Paper
Deterministic non-adaptive contention resolution on a shared channel2023-01-06Paper
Deterministic non-adaptive contention resolution on a shared channel2022-09-27Paper
Optimal Packet-Oblivious Stable Routing in Multi-hop Wireless Networks2022-09-01Paper
The structure of the genetic code as an optimal graph clustering problem2022-08-04Paper
Local queuing under contention2022-07-21Paper
Polynomial anonymous dynamic distributed computing without a unique leader2022-07-21Paper
Stable routing scheduling algorithms in multi-hop wireless networks2022-05-23Paper
Generalized framework for group testing: queries, feedbacks and adversaries2022-05-10Paper
Distributed bare-bones communication in wireless networks2022-04-01Paper
Information dissemination in wireless ad-hoc networks under the weighted-TIM framework2022-01-18Paper
Polynomial anonymous dynamic distributed computing without a unique leader2021-10-28Paper
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations2021-07-28Paper
Optimal channel utilization with limited feedback2021-04-14Paper
Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations2020-11-11Paper
Confidential gossip2020-10-16Paper
Universal stability in multi-hop radio networks2020-09-07Paper
Subquadratic non-adaptive threshold group testing2020-03-26Paper
Token traversal in ad hoc wireless networks via implicit carrier sensing2020-02-13Paper
Optimal channel utilization with limited feedback2020-01-30Paper
Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel2020-01-30Paper
Ordered and delayed adversaries and how to work against them on a shared channel2019-11-27Paper
Online packet scheduling under adversarial errors2019-10-18Paper
Deterministic Digital Clustering of Wireless Ad Hoc Networks2019-09-19Paper
Packet latency of deterministic broadcasting in adversarial multiple access channels2018-12-10Paper
Distributed Online and Stochastic Queueing on a Multiple Access Channel2018-11-13Paper
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors2018-11-05Paper
Station assignment with applications to sensing2018-10-17Paper
Stability of adversarial routing with feedback2018-05-23Paper
Fault tolerant scheduling of tasks of two sizes under resource augmentation2018-02-28Paper
Information gathering in ad-hoc radio networks with tree topology2017-12-20Paper
Clique Here: On the Distributed Complexity in Fully-Connected Networks2017-12-15Paper
Contention resolution in a non-synchronized multiple access channel2017-09-07Paper
Adaptive packet scheduling over a wireless channel under constrained jamming2017-09-05Paper
Doing-it-all with bounded work and communication2017-05-18Paper
Randomized mutual exclusion on a multiple access channel2017-04-04Paper
Measuring the impact of adversarial errors on packet scheduling strategies2016-05-12Paper
The do-all problem in broadcast networks2016-03-04Paper
Scalable wake-up of multi-channel single-hop radio networks2016-01-21Paper
Online Packet Scheduling Under Adversarial Jamming2015-11-20Paper
Time-efficient randomized multiple-message broadcast in radio networks2015-09-11Paper
Broadcasting in undirected ad hoc radio networks2015-09-04Paper
Performing work with asynchronous processors2015-09-04Paper
On the impact of geometry on ad hoc communication in wireless networks2015-09-03Paper
Fast Nonadaptive Deterministic Algorithm for Conflict Resolution in a Dynamic Multiple-Access Channel2015-08-03Paper
https://portal.mardi4nfdi.de/entity/Q55013632015-08-03Paper
A better wake-up in radio networks2015-08-03Paper
Online parallel scheduling of non-uniform tasks: trading failures for energy2015-06-10Paper
On selection problem in radio networks2015-03-10Paper
Adversarial queuing on the multiple-access channel2015-03-10Paper
Synchronous byzantine agreement with nearly a cubic number of communication bits2015-03-02Paper
Meeting the deadline2015-03-02Paper
Message and time efficient multi-broadcast schemes2015-01-28Paper
On the complexity of asynchronous gossip2014-12-12Paper
Asynchronous exclusive selection2014-12-12Paper
Adversarial Queuing on the Multiple Access Channel2014-09-09Paper
Fast scalable deterministic consensus for crash failures2014-07-23Paper
https://portal.mardi4nfdi.de/entity/Q54176812014-05-22Paper
Scheduling problems in transportation networks of line topology2014-04-30Paper
Asynchronous gossip2014-02-17Paper
https://portal.mardi4nfdi.de/entity/Q57474112014-02-14Paper
Leader election in ad hoc radio networks: a keen ear helps2014-01-27Paper
Measuring the impact of adversarial errors on packet scheduling strategies2013-12-17Paper
Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy2013-08-16Paper
Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks2013-08-16Paper
Distributed Deterministic Broadcasting in Wireless Networks of Weak Devices2013-08-07Paper
Time efficient \(k\)-shot broadcasting in known topology radio networks2013-07-04Paper
Maximum throughput of multiple access channels in adversarial environments2013-06-28Paper
Optimal deterministic broadcasting in known topology radio networks2013-06-20Paper
Performing work in broadcast networks2013-06-13Paper
Broadcasting in undirected ad hoc radio networks2013-06-07Paper
Distributed Backbone Structure for Algorithms in the SINR Model of Wireless Networks2013-03-13Paper
Distributed Online and Stochastic Queuing on a Multiple Access Channel2013-03-13Paper
Searching for a subset of counterfeit coins: Randomization vs determinism and adaptiveness vs non‐adaptiveness2013-01-21Paper
Emulating shared-memory do-all algorithms in asynchronous message-passing systems2012-03-07Paper
Meeting the deadline: on the complexity of fault-tolerant continuous gossip2012-02-06Paper
DYNAMIC SHARING OF A MULTIPLE ACCESS CHANNEL2012-01-23Paper
Performing Dynamically Injected Tasks on Processes Prone to Crashes and Restarts2011-10-28Paper
Efficient Distributed Communication in Ad-Hoc Radio Networks2011-07-07Paper
Multi-channel Assignment for Communication in Radio Networks2011-05-12Paper
Coordination Problems in Ad Hoc Radio Networks2011-04-05Paper
Scalable Quantum Consensus for Crash Failures2010-09-10Paper
Connectivity Problem in Wireless Networks2010-09-10Paper
Trusted Computing for Fault-Prone Wireless Networks2010-09-10Paper
Cooperative asynchronous update of shared memory2010-08-16Paper
Collective asynchronous reading with polylogarithmic worst-case overhead2010-08-15Paper
Gossiping by processors prone to omission failures2010-06-16Paper
Fast radio broadcasting with advice2010-04-06Paper
Distributed Computing2010-02-23Paper
Consensus and Mutual Exclusion in a Multiple Access Channel2009-11-19Paper
Leader Election in Ad Hoc Radio Networks: A Keen Ear Helps2009-07-14Paper
Many-to-many communication in radio networks2009-06-16Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
How to Meet in Anonymous Network2009-03-12Paper
Average-Time Complexity of Gossiping in Radio Networks2009-03-12Paper
A robust randomized algorithm to perform independent tasks2009-02-23Paper
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges2008-11-20Paper
Time and Communication Efficient Consensus for Crash Failures2008-09-09Paper
Energy and Time Efficient Broadcasting in Known Topology Radio Networks2008-09-02Paper
On the Message Complexity of Indulgent Consensus2008-09-02Paper
On the Communication Surplus Incurred by Faulty Processors2008-09-02Paper
Fast Radio Broadcasting with Advice2008-07-10Paper
How to meet in anonymous network2008-06-24Paper
Searching for a Black Hole in Synchronous Tree Networks2008-01-18Paper
The Wake‐Up Problem in MultiHop Radio Networks2007-10-22Paper
Collective tree exploration2007-02-15Paper
Robust gossiping with an application to consensus2006-12-07Paper
Fundamentals of Computation Theory2006-10-20Paper
Deterministic rendezvous in graphs2006-10-16Paper
Fast distributed algorithm for convergecast in ad hoc geometric radio networks2006-08-04Paper
https://portal.mardi4nfdi.de/entity/Q54806562006-08-03Paper
Automata, Languages and Programming2006-01-10Paper
Performing work with asynchronous processors: Message-delay-sensitive bounds2006-01-10Paper
Efficient gossip and robust distributed computation2005-12-29Paper
Algorithms and Computation2005-12-22Paper
Principles of Distributed Systems2005-12-15Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques2005-08-25Paper
Principles of Distributed Systems2005-08-24Paper
Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism2005-04-06Paper
Faster Deterministic Broadcasting in Ad Hoc Radio Networks2005-02-28Paper
Time of Deterministic Broadcasting in Radio Networks with Local Knowledge2005-02-21Paper
Broadcasting spanning forests on a multiple-access channel2005-02-11Paper
Randomization helps to perform independent tasks reliably2004-02-03Paper
https://portal.mardi4nfdi.de/entity/Q44371322003-12-07Paper
https://portal.mardi4nfdi.de/entity/Q44186412003-08-11Paper

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: Dariusz R. Kowalski