90 résultats  enregistrer la recherche


...
inria-00374460v1  Communication dans un congrès
Pierre FraigniaudEmmanuelle LebharLaurent ViennotLe modèle Inframétrique pour Internet
David Simplot-Ryl and Sebastien Tixeuil. 10ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel'08), 2008, Saint-Malo, France. pp.73-76, 2008
...
hal-00342000v1  Communication dans un congrès
Lélia BlinPierre FraigniaudNicolas NisseSandrine VialDistributed Chasing of Network Intruders by Mobile Agents
Proceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), 2006, United Kingdom. 4056, pp.70--84, 2006, Lecture Notes in Computer Science. <10.1007/11780823_7>
hal-00342001v1  Communication dans un congrès
Lélia BlinPierre FraigniaudNicolas NisseSandrine VialEncerclement réparti d'un fugitif dans un réseau par des agents mobiles
Actes des Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 2006, France. pp.89--92, 2006
hal-01102110v1  Article dans une revue
Heger ArfaouiPierre FraigniaudWhat can be computed without communications?
ACM SIGACT News, Association for Computing Machinery (ACM), 2014, 45 (3), pp.82-104. <10.1145/2670418.2670440>
lirmm-01483703v1  Direction d'ouvrage, Proceedings
Fedor V. FominPierre FraigniaudNicolas NisseDimitrios M. ThilikosForewords: Special issue on Theory and Applications of Graph Searching Problems
France. 655:1, 2016, Theoretical Computer Science - Special Issue on Theory and Applications of Graph Searching Problems, <10.1016/j.tcs.2016.11.001>
hal-01102123v1  Communication dans un congrès
Lélia BlinPierre FraigniaudBoaz Patt-ShamirOn Proof-Labeling Schemes versus Silent Self-stabilizing Algorithms
Pascal Felber; Vijay Garg. SSS 2014 - 16th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Sep 2014, Paderborn, Germany. Springer, 8756, pp.18-32, LNCS - Lecture Notes in Computer Science. <10.1007/978-3-319-11764-5_2>
hal-00922696v2  Communication dans un congrès
Andrea ClementiPierluigi CrescenziCarola DoerrPierre FraigniaudMarco Isopi et al.  Rumor Spreading in Random Evolving Graphs
Hans L. Bodlaender; Giuseppe F. Italiano. 21st Annual European Symposium on Algorithms - ESA 2013, Sep 2013, Sophia Antipolis, France. Springer, Algorithms – ESA 2013, 8125, pp.325-336, Lecture Notes in Computer Science. <10.1007/978-3-642-40450-4_28>
...
hal-00155186v1  Communication dans un congrès
Pierre FraigniaudCyril GavoilleAdrian KosowskiEmmanuelle LebharZvi LotkerUniversal augmentation schemes for network navigability: overcoming the $\sqrt n$-barrier
ACM. nineteenth annual ACM symposium on parallelism and architectures, 2007, San Diego, California, United States. ACM, pp.1-7, 2007
...
hal-00154849v1  Communication dans un congrès
Pierre FraigniaudAmos KormanEmmanuelle LebharLocal MST computation with short advice
ACM. ACM Symposium on Parallel Algorithms and Architectures, Jun 2007, San Diego, United States. ACM, pp.154, 2007
hal-00912527v1  Communication dans un congrès
Pierre FraigniaudMika GöösAmos KormanJukka SuomelaWhat can be decided locally without identifiers?
PODC'13 - ACM Symposium on Principles of Distributed Computing, Jul 2013, Montreal, Canada. ACM, pp.157-165, 2013, <10.1145/2484239.2484264>
...
hal-00412086v1  Communication dans un congrès
Pierre FraigniaudDavid IlcinkasAndrzej PelcExploration d'arbres avec oracle
AlgoTel 2006, May 2006, Trégastel, France. pp.25-28, 2006
...
hal-00412096v1  Communication dans un congrès
Reuven CohenPierre FraigniaudDavid IlcinkasAmos KormanDavid PelegExploration par un automate fini de réseaux anonymes étiquetés
AlgoTel 2005, May 2005, Presqu'île de Giens, France. pp.9-12, 2005
...
hal-00412099v1  Communication dans un congrès
Pierre FraigniaudDavid IlcinkasGuy PeerAndrzej PelcDavid PelegExploration de réseaux par un robot
AlgoTel 2004, May 2004, Batz-sur-mer, France. pp.123-127, 2004
...
hal-00341368v1  Article dans une revue
Lélia BlinPierre FraigniaudNicolas NisseSandrine VialDistributed Chasing of Network Intruders by Mobile Agents.
Theoretical Computer Science, Elsevier, 2008, 399, pp.12--37
...
hal-00341531v1  Article dans une revue
Pierre FraigniaudDavid IlcinkasGuy PeerAndrzej PelcDavid PelegGraph Exploration by a Finite Automaton
Theoretical Computer Science, Elsevier, 2005, 345 (2-3), pp.331-344. <10.1016/j.tcs.2005.07.014>
hal-00102819v1  Article dans une revue
Johanne CohenPierre FraigniaudMargarita MitjanaPolynomial Time Algorithms for Minimum-Time Broadcast in Tree
Theory of Computing Systems, Springer Verlag, 2002, 6, pp.641--665
...
hal-00339772v1  Communication dans un congrès
Reuven CohenPierre FraigniaudDavid IlcinkasAmos KormanDavid PelegLabel-Guided Graph Exploration by a Finite Automaton
L. Caires, G. Italiano, L. Monteiro, C. Palamidessi, M. Yung. ICALP 2005, Jul 2005, Lisbonne, Portugal. Springer Berlin / Heidelberg, 3580, pp.335-346, 2005, Lecture Notes in Computer Science. <10.1007/11523468_28>
...
hal-00339834v1  Communication dans un congrès
Reuven CohenPierre FraigniaudDavid IlcinkasAmos KormanDavid PelegLabeling Schemes for Tree Representation
Ajit Pal, Ajay D. Kshemkalyani, Rajeev Kumar, Arobinda Gupta. IWDC 2005, Dec 2005, Kharagpur, India. Springer Berlin / Heidelberg, 3741, pp.13-24, 2005, Lecture Notes in Computer Science. <10.1007/11603771_2>
...
hal-00339763v1  Communication dans un congrès
Pierre FraigniaudDavid IlcinkasGuy PeerAndrzej PelcDavid PelegGraph Exploration by a Finite Automaton
Jiri Fiala, Vaclav Koubek, Jan Kratochvil. MFCS 2004, Aug 2004, Prague, Czech Republic. Springer Berlin / Heidelberg, 3153, pp.451-462, 2004, Lecture Notes in Computer Science. <10.1007/978-3-540-28629-5_34>
...
hal-00339766v1  Communication dans un congrès
Pierre FraigniaudDavid IlcinkasSergio RajsbaumSébastien TixeuilSpace Lower Bounds for Graph Exploration via Reduced Automata
Andrzej Pelc, Michel Raynal. SIROCCO 2005, May 2005, Le Mont Saint-Michel, France. Springer Berlin / Heidelberg, 3499, pp.140-154, 2005, Lecture Notes in Computer Science. <10.1007/11429647_13>
...
hal-00339868v1  Communication dans un congrès
Pierre FraigniaudDavid IlcinkasAndrzej PelcTree Exploration with an Oracle
Rastislav Královic, Paweł Urzyczyn. MFCS 2006, Aug 2006, Stará Lesná, Slovakia. Springer Berlin / Heidelberg, 4162, pp.24-37, 2006, Lecture Notes in Computer Science. <10.1007/11821069_2>
...
hal-00339719v1  Communication dans un congrès
Pierre FraigniaudDavid IlcinkasDigraphs Exploration with Little Memory
Volker Diekert, Michel habib. STACS 2004, Mar 2004, Montpellier, France. Springer Berlin / Heidelberg, 2996, pp.246-257, 2004, Lecture Notes in Computer Science. <10.1007/978-3-540-24749-4_22>
...
hal-00339854v1  Communication dans un congrès
Pierre FraigniaudDavid IlcinkasAndrzej PelcOracle Size: a New Measure of Difficulty for Communication Tasks
PODC 2006, Jul 2006, Denver, Colorado, United States. ACM New York, NY, USA, pp.179-187, 2006, <10.1145/1146381.1146410>
hal-01423644v1  Communication dans un congrès
Pierre FraigniaudLaurent FeuilloleyJuho HirvonenA Hierarchy of Local Decision
43rd International Colloquium on Automata, Languages, and Programming (ICALP) , 2016, Roma, Italy. 2016
hal-01423645v1  Communication dans un congrès
Pierre FraigniaudPierluigi CrescenziZvi LotkerPaolo PennaCore-periphery clustering and collaboration networks
IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2016, San Francisco, United States
hal-01423679v1  Communication dans un congrès
Pierre FraigniaudSergio RajsbaumCorentin TraversMinimizing the Number of Opinions for Fault-Tolerant Distributed Decision Using Well-Quasi Orderings
12th Latin American Symposium on Theoretical Informatics (LATIN), 2016, Ensenada, Mexico. 2016