Advanced search    

Search: authors:"Dariusz R. Kowalski"

6 papers found.
Use AND, OR, NOT, +word, -word, "long phrase", (parentheses) to fine-tune your search.

Local Queuing Under Contention

ACM , 48 ( 1 ): 13 - 38 , 2001 . Bogdan S. Chlebus , Dariusz R. Kowalski , and Mariusz A. Rokicki . Maximum throughput of multiple access channels in adversarial environments . Distributed Computing ... , 22 ( 2 ): 93 - 116 , 2009 . Bogdan S. Chlebus , Dariusz R. Kowalski , and Mariusz A. Rokicki . Adversarial queuing on the multiple access channel . ACM Transactions on Algorithms , 8 ( 1 ):5: 1 - 5

Brief Announcement: Deterministic Contention Resolution on a Shared Channel

Institute of Computer Science, University Wroc?aw , Poland 2 Dariusz R. Kowalski Department of Computer Science, University of Liverpool , UK A shared channel, also called multiple-access channel, is one of

Ordered and delayed adversaries and how to work against them on a shared channel

An execution of a distributed algorithm is often seen as a game between the algorithm and a conceptual adversary causing specific distractions to the computation. In this work we define a class of ordered adaptive adversaries, which cause distractions—in particular crashes—online according to some partial order of the participating stations, which is fixed by the adversary before...

Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations

Starting with Michail, Chatzigiannakis, and Spirakis work [Michail et al., 2013], the problem of Counting the number of nodes in {Anonymous Dynamic Networks} has attracted a lot of attention. The problem is challenging because nodes are indistinguishable (they lack identifiers and execute the same program) and the topology may change arbitrarily from round to round of...

Randomized mutual exclusion on a multiple access channel

In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing. In the classic version of this problem, n processes execute a concurrent program that occasionally triggers some of them to use shared resources, such as memory, communication channel, device, etc. The goal is to design...

Dynamic Sharing of a Multiple Access Channel

In this paper we consider the mutual exclusion problem on a multiple access channel. Mutual exclusion is one of the fundamental problems in distributed computing. In the classic version of this problem, $n$ processes perform a concurrent program which occasionally triggers some of them to use shared resources, such as memory, communication channel, device, etc. The goal is to...