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
Book ChapterDOI
Waking up anonymous ad hoc radio networks
TL;DR: This work considers the task of waking up an anonymous ad hoc radio network from a single source, by a deterministic algorithm, and designs a universal wakeup algorithm and shows that no such algorithm exists.
Posted Content
Leader Election in Trees with Customized Advice.
Barun Gorain,Andrzej Pelc +1 more
TL;DR: The goal is to establish tradeoffs between the allocated time $\tau$ and the amount of information that has to be given {\em a priori} to the nodes of a network to enable leader election in time $tau$.
Book
Structural Information and Communication Complexity: 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings
TL;DR: In this article, the authors present a survey on the applicability of distributed data structures for online scheduling in static ad hoc wireless networks, including the L(h,k)-labeling problem on Bipartite Graphs and a tight bound for online coloring of Disk Graphs.
Posted Content
Finding the Size and the Diameter of a Radio Network Using Short Labels.
Barun Gorain,Andrzej Pelc +1 more
TL;DR: In this article, the authors consider the problem of finding the size of a radio network with collision detection capability, and show that the minimum length of a labeling scheme that permits diameter discovery is Θ(log(log √ log log √ n) for all radio networks of maximum degree Δ.