Obserwuj
Andrzej Pelc
Andrzej Pelc
Professor of Computer Science, Universite du Quebec en Outaouais
Zweryfikowany adres z uqo.ca
Tytuł
Cytowane przez
Cytowane przez
Rok
Power consumption in packet radio networks
LM Kirousis, E Kranakis, D Krizanc, A Pelc
Theoretical Computer Science 243 (1-2), 289-305, 2000
4672000
Deterministic broadcasting in ad hoc radio networks
BS Chlebus, L Gasieniec, A Gibbons, A Pelc, W Rytter
Distributed computing 15 (1), 27-38, 2002
3092002
Exploring unknown undirected graphs
P Panaite, A Pelc
Journal of Algorithms 33 (2), 281-295, 1999
2511999
Searching games with errors—fifty years of coping with liars
A Pelc
Theoretical Computer Science 270 (1-2), 71-109, 2002
2352002
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
2022005
Broadcasting in undirected ad hoc radio networks
DR Kowalski, A Pelc
Proceedings of the twenty-second annual symposium on Principles of …, 2003
2002003
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
1942005
Gathering few fat mobile robots in the plane
J Czyzowicz, L Gasieniec, A Pelc
Theoretical Computer Science 410 (6-7), 481-499, 2009
1782009
Gathering asynchronous oblivious mobile robots in a ring
R Klasing, E Markou, A Pelc
Theoretical Computer Science 390 (1), 27-39, 2008
1782008
Tree exploration with little memory
K Diks, P Fraigniaud, E Kranakis, A Pelc
Journal of Algorithms 51 (1), 38-63, 2004
1782004
Deterministic rendezvous in graphs
A Dessmark, P Fraigniaud, DR Kowalski, A Pelc
Algorithmica 46, 69-96, 2006
1702006
Fault‐tolerant broadcasting and gossiping in communication networks
A Pelc
Networks: An International Journal 28 (3), 143-156, 1996
1581996
Collective tree exploration
P Fraigniaud, L Gasieniec, DR Kowalski, A Pelc
Networks: An International Journal 48 (3), 166-177, 2006
1562006
Solution of Ulam's problem on searching with a lie
A Pelc
Journal of Combinatorial Theory, Series A 44 (1), 129-140, 1987
1541987
Broadcasting with locally bounded byzantine faults
A Pelc, D Peleg
Information Processing Letters 93 (3), 109-115, 2005
1532005
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
1462006
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
1342000
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
1301997
Optimal deterministic broadcasting in known topology radio networks.
D Kowalski, A Pelc
Distributed Computing 19 (3), 2007
1262007
How to meet asynchronously (almost) everywhere
J Czyzowicz, A Pelc, A Labourel
ACM Transactions on Algorithms (TALG) 8 (4), 1-14, 2012
1202012
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20