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
Gathering asynchronous oblivious agents with local vision in regular bipartite graphs
Samuel Guilbault,Andrzej Pelc +1 more
TL;DR: The main contribution is the proof that the class of gatherable initial configurations is very small: it consists only of ''stars'' (an agent A with all other agents adjacent to it) of size at least 3.
Proceedings ArticleDOI
How to meet asynchronously (almost) everywhere
TL;DR: Deterministic rendezvous algorithms for agents starting at arbitrary nodes of any anonymous connected graph or in an unknown connected terrain in the plane are given and it is shown that none of the above few limitations imposed on the environment can be removed.
Proceedings Article
Centralized Deterministic Broadcasting in Undirected Multi-hop Radio Networks.
Dariusz R. Kowalski,Andrzej Pelc +1 more
TL;DR: In this paper, the authors considered centralized deterministic broadcasting in radio networks and gave a deterministic polynomial algorithm which produces a broadcasting scheme working in time O(D log n + log 2 n), for every n-node graph of diameter D, whenever D = Ω(log n).
Journal ArticleDOI
Feasibility and complexity of broadcasting with random transmission failures
Andrzej Pelc,David Peleg +1 more
TL;DR: The goal is to establish conditions on feasibility and to estimate the (synchronous) time complexity of almost-safe broadcasting (i.e., broadcasting which is correct with probability at least 1-1/n for n-node graphs and for sufficiently large n) under these scenarios.
Book ChapterDOI
Remembering without Memory: Tree Exploration by Asynchronous Oblivious Robots
TL;DR: In this article, the authors consider the case when the robots are dispersed in an anonymous and unlabeled graph, and they must perform the very basic task of exploration: within finite time every node must be visited by at least one robot and the robots must enter a quiescent state.