Pierre Fraigniaud
Pierre Fraigniaud
CNRS and Université Paris Cité
Geverifieerd e-mailadres voor irif.fr - Homepage
Geciteerd door
Geciteerd door
Methods and problems of communication in usual networks
P Fraigniaud, E Lazard
Discrete Applied Mathematics 53 (1-3), 79-133, 1994
Robust position-based routing in wireless ad hoc networks with unstable transmission ranges
L Barriere, P Fraigniaud, L Narayanan
Proceedings of the 5th international workshop on Discrete algorithms and …, 2001
D2B: A de Bruijn based content-addressable network
P Fraigniaud, P Gauron
Theoretical Computer Science 355 (1), 65-79, 2006
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
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
Routing in trees
P Fraigniaud, C Gavoille
Automata, Languages and Programming: 28th International Colloquium, ICALP …, 2001
Tree exploration with little memory
K Diks, P Fraigniaud, E Kranakis, A Pelc
Journal of Algorithms 51 (1), 38-63, 2004
Deterministic rendezvous in graphs
A Dessmark, P Fraigniaud, DR Kowalski, A Pelc
Algorithmica 46, 69-96, 2006
Towards a complexity theory for local distributed computing
P Fraigniaud, A Korman, D Peleg
Journal of the ACM (JACM) 60 (5), 1-26, 2013
Online computation with advice
Y Emek, P Fraigniaud, A Korman, A Rosén
Theoretical Computer Science 412 (24), 2642-2656, 2011
Collective tree exploration
P Fraigniaud, L Gasieniec, DR Kowalski, A Pelc
Networks: An International Journal 48 (3), 166-177, 2006
Efficient routing in networks with long range contacts
L Barriere, P Fraigniaud, E Kranakis, D Krizanc
Distributed Computing: 15th International Conference, DISC 2001 Lisbon …, 2001
Local conflict coloring
P Fraigniaud, M Heinrich, A Kosowski
2016 IEEE 57th annual symposium on foundations of computer science (FOCS …, 2016
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
Parsimonious flooding in dynamic graphs
H Baumann, P Crescenzi, P Fraigniaud
Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009
Digraphs exploration with little memory
P Fraigniaud, D Ilcinkas
STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science …, 2004
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
Searching is not jumping
L Barrière, P Fraigniaud, N Santoro, DM Thilikos
International Workshop on Graph-Theoretic Concepts in Computer Science, 34-45, 2003
Eclecticism shrinks even small worlds
P Fraigniaud, C Gavoille, C Paul
Proceedings of the twenty-third annual ACM symposium on Principles of …, 2004
Rendezvous and election of mobile agents: impact of sense of direction
L Barriere, P Flocchini, P Fraigniaud, N Santoro
Theory of Computing Systems 40 (2), 143-162, 2007
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20