Follow
Andrzej Pelc
Andrzej Pelc
Professor of Computer Science, Universite du Quebec en Outaouais
Verified email at uqo.ca
Title
Cited by
Cited by
Year
Power consumption in packet radio networks
LM Kirousis, E Kranakis, D Krizanc, A Pelc
Theoretical Computer Science 243 (1-2), 289-305, 2000
4752000
Deterministic broadcasting in ad hoc radio networks
BS Chlebus, L Gasieniec, A Gibbons, A Pelc, W Rytter
Distributed computing 15 (1), 27-38, 2002
3152002
Exploring unknown undirected graphs
P Panaite, A Pelc
Journal of Algorithms 33 (2), 281-295, 1999
2621999
Searching games with errors—fifty years of coping with liars
A Pelc
Theoretical Computer Science 270 (1-2), 71-109, 2002
2462002
Graph exploration by a finite automaton
P Fraigniaud, D Ilcinkas, G Peer, A Pelc, D Peleg
Theoretical Computer Science 345 (2-3), 331-344, 2005
2112005
Dissemination of information in communication networks: broadcasting, gossiping, leader election, and fault-tolerance
J Hromkovič, R Klasing, A Pelc, P Ruzicka, W Unger
Springer Science & Business Media, 2005
2112005
Broadcasting in undirected ad hoc radio networks
DR Kowalski, A Pelc
Proceedings of the twenty-second annual symposium on Principles of …, 2003
1992003
Gathering asynchronous oblivious mobile robots in a ring
R Klasing, E Markou, A Pelc
Theoretical Computer Science 390 (1), 27-39, 2008
1882008
Tree exploration with little memory
K Diks, P Fraigniaud, E Kranakis, A Pelc
Journal of Algorithms 51 (1), 38-63, 2004
1862004
Gathering few fat mobile robots in the plane
J Czyzowicz, L Gasieniec, A Pelc
Theoretical Computer Science 410 (6-7), 481-499, 2009
1822009
Deterministic rendezvous in graphs
A Dessmark, P Fraigniaud, DR Kowalski, A Pelc
Algorithmica 46, 69-96, 2006
1802006
Collective tree exploration
P Fraigniaud, L Gasieniec, DR Kowalski, A Pelc
Networks: An International Journal 48 (3), 166-177, 2006
1722006
Solution of Ulam's problem on searching with a lie
A Pelc
Journal of Combinatorial Theory, Series A 44 (1), 129-140, 1987
1591987
Asynchronous deterministic rendezvous in graphs
G De Marco, L Gargano, E Kranakis, D Krizanc, A Pelc, U Vaccaro
Theoretical Computer Science 355 (3), 315-326, 2006
1562006
Broadcasting with locally bounded byzantine faults
A Pelc, D Peleg
Information Processing Letters 93 (3), 109-115, 2005
1562005
Fault‐tolerant broadcasting and gossiping in communication networks
A Pelc
Networks: An International Journal 28 (3), 143-156, 1996
1561996
The wakeup problem in synchronous broadcast systems
L Gąsieniec, A Pelc, D Peleg
Proceedings of the nineteenth annual ACM symposium on Principles of …, 2000
1392000
Power consumption in packet radio networks
LM Kirousis, E Kranakis, D Krizanc, A Pelc
STACS 97: 14th Annual Symposium on Theoretical Aspects of Computer Science …, 1997
1311997
Searching with known error probability
A Pelc
Theoretical Computer Science 63 (2), 185-202, 1989
1311989
How to meet asynchronously (almost) everywhere
J Czyzowicz, A Pelc, A Labourel
ACM Transactions on Algorithms (TALG) 8 (4), 1-14, 2012
1272012
The system can't perform the operation now. Try again later.
Articles 1–20