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
Posted Content
Fast Rendezvous with Advice
Avery Miller,Andrzej Pelc +1 more
TL;DR: In this article, the authors studied the minimum size of advice that has to be provided to the agents in order to achieve rendezvous in optimal time, and showed that the optimal size is Θ(D\log(n/D)+\log\log L) where L is the length of advice.
Journal ArticleDOI
Global Synchronization and Consensus Using Beeps in a Fault-Prone Multiple Access Channel
TL;DR: The main result is the design and analysis of a deterministic ϵ-safe global synchronization algorithm that works in O ( log p 2 ϵ ) time in any fault-prone MAC using beeps, and shows that this time cannot be significantly improved, even when the MAC is fault-free.
Book ChapterDOI
Communication in networks with random dependent faults
TL;DR: This is the first analytic paper which investigates network communication for random dependent faults in networks where nodes fail in a random dependent way, and it is shown that the torus supports communication with high probability when p decreases faster than 1/n1/2, and does not when p ?
Book ChapterDOI
Optimal exploration of terrains with obstacles
TL;DR: A mobile robot represented by a point moving in the plane has to explore an unknown flat terrain with impassable obstacles and all points of the terrain have to be explored and the performance of an exploration algorithm, called its complexity, is measured by the length of the trajectory of the robot.
Posted Content
Constant-Length Labeling Schemes for Deterministic Radio Broadcast
TL;DR: In this paper, the authors consider the feasibility of deterministic broadcast in radio networks and show that 2-bit labels are sufficient and sufficient for broadcast in a radio network, where all nodes have distinct labels and there is a common round in which all nodes know that broadcast has been completed.