#### Filter Results:

- Full text PDF available (135)

#### Publication Year

1984

2017

- This year (8)
- Last 5 years (54)
- Last 10 years (108)

#### 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 multi-hop 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… (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
- 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)

- Petrisor Panaite, Andrzej Pelc
- J. Algorithms
- 1998

A robot has to construct a complete map of an unknown environment modeled as an undirected connected graph. The task is to explore all nodes and edges of the graph using the minimum number of edge traversals. The penalty of an exploration algorithm running on a graph G = (V(G), E(G)) is the worst-case number of traversals in excess of the lower bound IE(G)I… (More)

- Bogdan S. Chlebus, Leszek Gasieniec, Alan Gibbons, Andrzej Pelc, Wojciech Rytter
- Distributed Computing
- 2002

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)

- 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)

- Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc
- Theor. Comput. Sci.
- 2006

Autonomous identical robots represented by unit discs move deterministically in the plane. They do not have any common coordinate system, do not communicate, do not have memory of the past and are totally asynchronous. Gathering such robots means forming a configuration for which the union of all discs representing them is connected. We solve the gathering… (More)

- Yuval Emek, Leszek Gasieniec, Erez Kantor, Andrzej Pelc, David Peleg, Chang Su
- Distributed Computing
- 2007

We consider broadcasting in radio networks, modeled as unit disk graphs (UDG). Such networks occur in wireless communication between sites (e.g., stations or sensors) situated in a terrain. Network stations are represented by points in the Euclidean plane, where a station is connected to all stations at distance at most 1 from it. A message transmitted by a… (More)