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
Fault-Tolerant Broadcasting in Radio Networks
TL;DR: Radio networks that are subject to permanent node failures of unknown location are considered, giving broadcasting algorithms whose worst-case running time has optimal order of magnitude, and corresponding lower bounds are proved.
Journal ArticleDOI
How to meet when you forget: log-space rendezvous in arbitrary graphs
TL;DR: The minimum size of the memory of anonymous agents that guarantees deterministic rendezvous when it is feasible is established, and the first algorithm to find a quotient graph of a given unlabeled graph in polynomial time is got, by means of a mobile agent moving around the graph.
Journal ArticleDOI
Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots
TL;DR: 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 is considered, and it is proved that Ω(logn) robots are necessary for infinitely many n.
Journal ArticleDOI
Remembering without memory: Tree exploration by asynchronous oblivious robots
TL;DR: The final result shows that the difficulty in tree exploration comes in fact from the symmetries of the tree, and it is shown that, in order to explore trees that do not have any non-trivial automorphisms, 4 robots are always sufficient and often necessary.
Journal ArticleDOI
Gathering Despite Mischief
TL;DR: In this paper, the authors considered the problem of Byzantine gathering with termination and gave deterministic polynomial algorithms for weakly Byzantine agents and strongly Byzantine agents, both when the size of the network is known and when it is unknown.