#### Filter Results:

- Full text PDF available (20)

#### Publication Year

1983

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (7)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- B S Chlebus, K Diks, A Pelc
- 1994

The problem of broadcasting in a network is to disseminate information from one node to all other nodes by transmitting it over communication links that connect nodes. We consider the time of broadcasting in the presence of at most k dynamic link failures. If a node knows source information, then in the next step all its neighbors connected by operational… (More)

- Torben Hagerup, Marek Chrobak, Krzysztof Diks
- SIAM J. Comput.
- 1989

- Pramod Chandra P. Bhatt, Krzysztof Diks, Torben Hagerup, V. C. Prasad, Tomasz Radzik, Sanjeev Saxena
- Inf. Comput.
- 1991

- Krzysztof Diks, Hristo Djidjev, Ondrej Sýkora, Imrich Vrto
- J. Algorithms
- 1993

- Piotr Berman, Krzysztof Diks, Andrzej Pelc
- J. Algorithms
- 1997

A robot with <i>k</i>-bit memory has to explore a tree whose nodes are unlabeled and edge ports are locally labeled at each node. The robot has no <i>a priori</i> knowledge of the topology of the tree or of its size, and its aim is to traverse all the edges. While <i>O</i>(logΔ) bits of memory suffice to explore any tree of maximum degree Δ if… (More)

- Krzysztof Diks, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
- Theor. Comput. Sci.
- 2002

Abstrac t : This paper is part of a continued investigation of the relative power of different variants of the CRCW PRAM with infinite global memory. The models that we consider are the standard PRIORITY and COMMON PRAMs, together with the less well-known COLLISION + and TOLERANT PRAMs. We describe several new results for the simulation of an n-processor… (More)

- Krzysztof Diks, Oscar Garrido, Andrzej Lingas
- ISA
- 1991

Let k be a positive integer, a subset Q of the set of vertices of a graph G is k-dependent in G if each vertex of Q has no more than k neighbours in Q. We present a parallel algorithm which computes a maximal k-dependent set in a graph on n nodes in time O(log 4 n) on an EREW PRAM with O(n 2) processors. In this way, we establish the membership of the… (More)

- Krzysztof Diks, Piotr Sankowski
- ESA
- 2007