| Methods and problems of communication in usual networks P Fraigniaud, E Lazard Discrete Applied Mathematics 53 (1-3), 79-133, 1994 | 501 | 1994 |
| Robust position‐based routing in wireless ad hoc networks with irregular transmission ranges L Barriere, P Fraigniaud, L Narayanan, J Opatrny Wireless Communications and Mobile Computing 3 (2), 141-153, 2003 | 307 | 2003 |
| Capture of an intruder by mobile agents L Barriere, P Flocchini, P Fraigniaud, N Santoro Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002 | 221 | 2002 |
| Routing in trees P Fraigniaud, C Gavoille International Colloquium on Automata, Languages, and Programming, 757-772, 2001 | 207 | 2001 |
| Euro-Par'96-Parallel Processing: Second International Euro-Par Conference, Lyon, France, August 26-29, 1996, Proceedings J Van Leeuwen Springer Science & Business Media, 1996 | 207 | 1996 |
| 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 | 206 | 2005 |
| Tree exploration with little memory K Diks, P Fraigniaud, E Kranakis, A Pelc Journal of Algorithms 51 (1), 38-63, 2004 | 171 | 2004 |
| Deterministic rendezvous in graphs A Dessmark, P Fraigniaud, DR Kowalski, A Pelc Algorithmica 46 (1), 69-96, 2006 | 152 | 2006 |
| Collective tree exploration P Fraigniaud, L Gasieniec, DR Kowalski, A Pelc Networks: An International Journal 48 (3), 166-177, 2006 | 151 | 2006 |
| The content-addressable network D2B P Fraigniaud, P Gauron | 150* | 2003 |
| Towards a complexity theory for local distributed computing P Fraigniaud, A Korman, D Peleg Journal of the ACM (JACM) 60 (5), 1-26, 2013 | 147* | 2013 |
| Efficient routing in networks with long range contacts L Barriere, P Fraigniaud, E Kranakis, D Krizanc International Symposium on Distributed Computing, 270-284, 2001 | 146 | 2001 |
| Online computation with advice Y Emek, P Fraigniaud, A Korman, A Rosén Theoretical Computer Science 412 (24), 2642-2656, 2011 | 144 | 2011 |
| Label-guided graph exploration by a finite automaton R Cohen, P Fraigniaud, D Ilcinkas, A Korman, D Peleg ACM Transactions on Algorithms (TALG) 4 (4), 1-18, 2008 | 117 | 2008 |
| Parsimonious flooding in dynamic graphs H Baumann, P Crescenzi, P Fraigniaud Distributed Computing 24 (1), 31-44, 2011 | 113 | 2011 |
| A general theory for deadlock avoidance in wormhole-routed networks E Fleury, P Fraigniaud IEEE Transactions on Parallel and Distributed Systems 9 (7), 626-638, 1998 | 106 | 1998 |
| D2B: A de Bruijn based content-addressable network P Fraigniaud, P Gauron Theoretical Computer Science 355 (1), 65-79, 2006 | 104 | 2006 |
| Digraphs exploration with little memory P Fraigniaud, D Ilcinkas Annual Symposium on Theoretical Aspects of Computer Science, 246-257, 2004 | 101 | 2004 |
| Searching is not jumping L Barriere, P Fraigniaud, N Santoro, DM Thilikos International Workshop on Graph-Theoretic Concepts in Computer Science, 34-45, 2003 | 98 | 2003 |
| Eclecticism shrinks even small worlds P Fraigniaud, C Gavoille, C Paul Distributed Computing 18 (4), 279-291, 2006 | 95* | 2006 |
Peter M BentlerUniversity of California, Los AngelesVerified email at ucla.edu
