#### Filter Results:

- Full text PDF available (140)

#### Publication Year

1984

2017

- This year (12)
- Last 5 years (58)
- Last 10 years (113)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Lefteris M. Kirousis, Evangelos Kranakis, Danny Krizanc, Andrzej Pelc
- Theor. Comput. Sci.
- 2000

In this paper we study the problem of assigning transmission ranges to the nodes of a multihop packet radio network so as to minimize the total power consumed under the constraint that adequate power is provided to the nodes to ensure that the network is strongly connected (i.e., each node can communicate along some path in the network to every other node).… (More)

- Dariusz R. Kowalski, Andrzej Pelc
- Distributed Computing
- 2003

We consider distributed broadcasting in radio networks, modeled as undirected graphs, whose nodes have no information on the topology of the network, nor even on their immediate neighborhood. For randomized broadcasting, we give an algorithm working in expected time <i>O</i>(<i>D</i> log(<i>n/D</i>) + log<sup>2</sup> <i>n</i>) in <i>n</i>-node radio… (More)

We consider the problem of distributed deterministic broadcasting in radio networks of unknown topology and size. The network is synchronous. If a node u can be reached from two nodes which send messages in the same round, none of the messages is received by u. Such messages block each other and node u either hears the noise of interference of messages,… (More)

- Ralf Klasing, Euripides Markou, Andrzej Pelc
- ISAAC
- 2006

We consider the problem of gathering identical, memoryless, mobile robots in one node of an anonymous unoriented ring. Robots start from different nodes of the ring. They operate in Look-Compute-Move cycles and have to end up in the same node. In one cycle, a robot takes a snapshot of the current configuration (Look), makes a decision to stay idle or to… (More)

- Andrzej Pelc, David Peleg
- Inf. Process. Lett.
- 2005

- Dariusz R. Kowalski, Andrzej Pelc
- Distributed Computing
- 2006

We consider deterministic broadcasting in radio networks whose nodes have full topological information about the network. The aim is to design a polynomial algorithm, which, given a graph G with source s, produces a fast broadcast scheme in the radio network represented by G. The problem of finding a fastest broadcast scheme for a given graph is NP-hard,… (More)

- Paola Flocchini, David Ilcinkas, Andrzej Pelc, Nicola Santoro
- Algorithmica
- 2007

We consider the problem of exploring an anonymous unoriented ring by a team of k identical, oblivious, asynchronous mobile robots that can view the environment but cannot communicate. This weak scenario is standard when the spatial universe in which the robots operate is the two-dimensional plane, but (with one exception) has not been investigated before… (More)

- Andrzej Pelc
- Encyclopedia of Algorithms
- 2007

We consider deterministic broadcasting in geometric radio networks (GRN) whose nodes know only a limited part of the network. Nodes of a GRN are situated in the plane and each of them is equipped with a transmitter of some range r . A signal from this node can reach all nodes at distance at most r from it but if a node u is situated within the range of two… (More)

- Leszek Gasieniec, Andrzej Pelc, David Peleg
- SIAM J. Discrete Math.
- 2001

This paper studies the di erences between two levels of synchronization in a distributed broadcast system (or a multiple access channel). In the globally synchronous model, all processors have access to a global clock. In the locally synchronous model, processors have local clocks ticking at the same rate, but each clock starts individually, when the… (More)

An n-node tree has to be explored by k mobile agents (robots), starting in its root. Every edge of the tree must be traversed by at least one robot, and exploration must be completed as fast as possible. Even when the tree is known in advance, scheduling optimal collective exploration turns out to be NP-hard. We investigate the problem of distributed… (More)