The following pages link to Dariusz R. Kowalski (Q282239):
Displaying 50 items.
- Measuring the impact of adversarial errors on packet scheduling strategies (Q282242) (← links)
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Leader election in ad hoc radio networks: a keen ear helps (Q394338) (← links)
- Randomized mutual exclusion on a multiple access channel (Q518923) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
- Emulating shared-memory do-all algorithms in asynchronous message-passing systems (Q666160) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- Scalable wake-up of multi-channel single-hop radio networks (Q906382) (← links)
- How to meet in anonymous network (Q930910) (← links)
- Fast radio broadcasting with advice (Q962160) (← links)
- Gossiping by processors prone to omission failures (Q976104) (← links)
- A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- Many-to-many communication in radio networks (Q1024217) (← links)
- Packet latency of deterministic broadcasting in adversarial multiple access channels (Q1628784) (← links)
- Information gathering in ad-hoc radio networks with tree topology (Q1686117) (← links)
- Fault tolerant scheduling of tasks of two sizes under resource augmentation (Q1702666) (← links)
- Broadcasting spanning forests on a multiple-access channel (Q1763001) (← links)
- Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism (Q1770372) (← links)
- Station assignment with applications to sensing (Q1796433) (← links)
- Optimal deterministic broadcasting in known topology radio networks (Q1954200) (← links)
- Ordered and delayed adversaries and how to work against them on a shared channel (Q2010599) (← links)
- Information dissemination in wireless ad-hoc networks under the weighted-TIM framework (Q2067613) (← links)
- Distributed bare-bones communication in wireless networks (Q2121059) (← links)
- Generalized framework for group testing: queries, feedbacks and adversaries (Q2136279) (← links)
- Stable routing scheduling algorithms in multi-hop wireless networks (Q2140563) (← links)
- The structure of the genetic code as an optimal graph clustering problem (Q2161382) (← links)
- Universal stability in multi-hop radio networks (Q2194858) (← links)
- Confidential gossip (Q2204776) (← links)
- Polynomial anonymous dynamic distributed computing without a unique leader (Q2237890) (← links)
- Fault-tolerant parallel scheduling of arbitrary length jobs on a shared channel (Q2291426) (← links)
- Online packet scheduling under adversarial errors (Q2330130) (← links)
- Online parallel scheduling of non-uniform tasks: trading failures for energy (Q2348044) (← links)
- Performing work in broadcast networks (Q2375307) (← links)
- Maximum throughput of multiple access channels in adversarial environments (Q2377132) (← links)
- Adaptive packet scheduling over a wireless channel under constrained jamming (Q2401762) (← links)
- Contention resolution in a non-synchronized multiple access channel (Q2402256) (← links)
- Scheduling problems in transportation networks of line topology (Q2448158) (← links)
- Fast distributed algorithm for convergecast in ad hoc geometric radio networks (Q2497727) (← links)
- Deterministic rendezvous in graphs (Q2509029) (← links)
- Message and time efficient multi-broadcast schemes (Q2513670) (← links)
- Efficient gossip and robust distributed computation (Q2576871) (← links)
- Performing work with asynchronous processors: Message-delay-sensitive bounds (Q2581537) (← links)
- Deterministic non-adaptive contention resolution on a shared channel (Q2677825) (← links)
- The do-all problem in broadcast networks (Q2787672) (← links)
- Online Parallel Scheduling of Non-uniform Tasks: Trading Failures for Energy (Q2842781) (← links)
- Distributed Deterministic Broadcasting in Uniform-Power Ad Hoc Wireless Networks (Q2842785) (← links)
- On the complexity of asynchronous gossip (Q2934340) (← links)
- Asynchronous exclusive selection (Q2934360) (← links)
- Time-efficient randomized multiple-message broadcast in radio networks (Q2943411) (← links)
