| Power consumption in packet radio networks LM Kirousis, E Kranakis, D Krizanc, A Pelc Theoretical Computer Science 243 (1-2), 289-305, 2000 | 492 | 2000 |
| Deterministic broadcasting in ad hoc radio networks BS Chlebus, L Gasieniec, A Gibbons, A Pelc, W Rytter Distributed computing 15 (1), 27-38, 2002 | 336 | 2002 |
| Searching games with errors—fifty years of coping with liars A Pelc Theoretical Computer Science 270 (1-2), 71-109, 2002 | 285 | 2002 |
| Exploring unknown undirected graphs P Panaite, A Pelc Journal of Algorithms 33 (2), 281-295, 1999 | 283 | 1999 |
| 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 | 236 | 2005 |
| Dissemination of information in communication networks: broadcasting, gossiping, leader election, and fault-tolerance J Hromkovič, R Klasing, A Pelc, P Ružička, W Unger Springer Berlin Heidelberg, 2005 | 225 | 2005 |
| Gathering asynchronous oblivious mobile robots in a ring R Klasing, E Markou, A Pelc Theoretical Computer Science 390 (1), 27-39, 2008 | 211 | 2008 |
| Broadcasting in undirected ad hoc radio networks DR Kowalski, A Pelc Proceedings of the twenty-second annual symposium on Principles of …, 2003 | 209 | 2003 |
| Deterministic rendezvous in graphs A Dessmark, P Fraigniaud, DR Kowalski, A Pelc Algorithmica 46 (1), 69-96, 2006 | 199 | 2006 |
| Tree exploration with little memory K Diks, P Fraigniaud, E Kranakis, A Pelc Journal of Algorithms 51 (1), 38-63, 2004 | 198 | 2004 |
| Collective tree exploration P Fraigniaud, L Gasieniec, DR Kowalski, A Pelc Networks: An International Journal 48 (3), 166-177, 2006 | 196 | 2006 |
| Gathering few fat mobile robots in the plane J Czyzowicz, L Gasieniec, A Pelc Theoretical Computer Science 410 (6-7), 481-499, 2009 | 190 | 2009 |
| Solution of Ulam's problem on searching with a lie A Pelc Journal of Combinatorial Theory, Series A 44 (1), 129-140, 1987 | 174 | 1987 |
| Broadcasting with locally bounded byzantine faults A Pelc, D Peleg Information Processing Letters 93 (3), 109-115, 2005 | 171 | 2005 |
| 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 | 167 | 2006 |
| Fault‐tolerant broadcasting and gossiping in communication networks A Pelc Networks: An International Journal 28 (3), 143-156, 1996 | 162 | 1996 |
| 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 | 146 | 2000 |
| Searching with known error probability A Pelc Theoretical Computer Science 63 (2), 185-202, 1989 | 144 | 1989 |
| How to meet asynchronously (almost) everywhere J Czyzowicz, A Pelc, A Labourel ACM Transactions on Algorithms (TALG) 8 (4), 1-14, 2012 | 133 | 2012 |
| Optimal deterministic broadcasting in known topology radio networks DR Kowalski, A Pelc Distributed Computing 19 (3), 185-195, 2007 | 133 | 2007 |
