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
Fast Deterministic Simulation of Computations on Faulty Parallel Machines
TL;DR: It is shown that simulations of operational multiprocessor machines on faulty ones can be performed with logarithmic slowdown in the worst case and it is proved that both a PRAM and an OCPC can simulate deterministically their fault-free counterparts withlog n slowdown and preprocessing done in time.
Book ChapterDOI
DISC 2011 invited lecture: deterministic rendezvous in networks: survey of models and results
TL;DR: This paper surveys models and results concerning deterministic rendezvous in networks, where agents cannot mark nodes, and investigates whether the agents have the ability to mark nodes in some way.
Journal ArticleDOI
Optimal fault diagnosis in comparison models
TL;DR: The worst-case optimal testing algorithms for t-fault detection, sequential t-Fault diagnosis, and one-step t- fault diagnosis in both models are presented and it is shown that the latter often enables one to decrease the number of tests.
Journal ArticleDOI
Rendezvous in networks in spite of delay faults
TL;DR: An algorithm is shown with cost polynomial in the size n of the network and polylogarithmic in the larger label L, which achieves rendezvous with very high probability in arbitrary networks, by contrast, for unbounded adversarial faults it is shown that rendezvous is not possible, even in the class of rings.
Proceedings ArticleDOI
Constant-Length Labeling Schemes for Deterministic Radio Broadcast
TL;DR: Every radio network can be labeled using 2 bits in such a way that broadcast can be accomplished by some universal deterministic algorithm that does not know the network topology nor any bound on its size.