A
Andrzej Pelc
Researcher at Université du Québec en Outaouais
Publications - 414
Citations - 10896
Andrzej Pelc is an academic researcher from Université du Québec en Outaouais. The author has contributed to research in topics: Node (networking) & Deterministic algorithm. The author has an hindex of 56, co-authored 408 publications receiving 10456 citations. Previous affiliations of Andrzej Pelc include University of Liverpool & Pennsylvania State University.
Papers
More filters
Journal ArticleDOI
Power consumption in packet radio networks
TL;DR: For points in three dimensions it is shown that the problem of deciding whether a complete range assignment of a given cost exists, is NP-hard and an O(n 2 ) time approximation algorithm is given which provides a completerange assignment with cost within a factor of two of the minimum.
BookDOI
Deterministic Rendezvous in Graphs
TL;DR: Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph and fast deterministic algorithms for this rendezvous problem are presented.
Journal ArticleDOI
Searching games with errors---fifty years of coping with liars
TL;DR: The relations between searching games with errors and problems concerning communication through a noisy channel and error-correcting codes are shown, and a taxonomy of such games is given, depending on the type of questions allowed, on the degree of interactivity between the players, and on the imposed limitations on errors.
Proceedings ArticleDOI
Exploring unknown undirected graphs
Petrişor Panaite,Andrzej Pelc +1 more
TL;DR: In this paper, the authors give an exploration algorithm whose penalty is O(|V(G)|) for every graph, and also show that some natural exploration algorithms cannot achieve this efficiency.
Journal ArticleDOI
Gathering asynchronous oblivious mobile robots in a ring
TL;DR: This work considers the problem of gathering identical, memoryless, mobile robots in one node of an anonymous unoriented ring, and provides gathering algorithms for initial configurations proved to be gatherable.