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 Article
Tree exploration with an oracle
TL;DR: In this paper, the authors investigate the minimum number of bits of information (minimum oracle size) that has to be given to an algorithm in order to perform a task with given efficiency.
Book ChapterDOI
How much memory is needed for leader election
Emanuele G. Fusco,Andrzej Pelc +1 more
TL;DR: It is proved that no automaton can solve the leader election problem for all trees, even in the weak form, and logarithmic memory is optimal for leader election in the class of arbitrary connected graphs.
Posted Content
Building a Nest by an Automaton
TL;DR: The main result is the design of a deterministic finite automaton that accomplishes this task and subsequently stops, for every initially connected field, in time $O(sz)$, where s is the span of the initial field and z is the number of bricks.
Journal ArticleDOI
Finding the size and the diameter of a radio network using short labels
Barun Gorain,Andrzej Pelc +1 more
TL;DR: The tasks of size discovery and diameter discovery are considered: finding the size of an unknown radio network with collision detection, and it is shown that diameter discovery can be done using a labeling scheme of constant length.