Filtrer vos résultats
- 54
- 49
- 50
- 35
- 11
- 5
- 2
- 3
- 1
- 1
- 99
- 21
- 1
- 2
- 4
- 4
- 3
- 4
- 4
- 3
- 3
- 8
- 8
- 6
- 9
- 5
- 8
- 11
- 1
- 6
- 4
- 5
- 2
- 3
- 101
- 2
- 39
- 32
- 30
- 24
- 12
- 7
- 6
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 103
- 27
- 15
- 11
- 11
- 11
- 9
- 8
- 8
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
103 résultats
|
|
Election in the Qualitative WorldInternational Colloquium on Structural Information & Communication Complexity (SIROCCO 2006), Jul 2006, United Kingdom. pp.85--99
Communication dans un congrès
hal-00308122v1
|
||
Groupings and Pairings in Anonymous NetworksDISC 2006, Sep 2006, Sweden. pp.105-119
Communication dans un congrès
hal-00308128v1
|
|||
Election in Partially Anonymous Networks with Arbitrary Knowledge in Message Passing SystemsDistributed Computing, 2012, 25 (4), pp.297-311
Article dans une revue
hal-00695944v1
|
|||
|
|
Lock-in Problem for Parallel Rotor-router Walks2015
Pré-publication, Document de travail
hal-01021930v3
|
||
|
|
Deterministic Symmetric Rendezvous in Arbitrary Graphs: Overcoming Anonymity, Failures and UncertaintyAlpern, Steve and Fokkink, Robbert and Gasieniec, Leszek and Lindelauf, Roy and Subrahmanian, V. S. Search theory: A game theoretic perspective, Springer, pp.175--195, 2013, 978-1-4614-6824-0. ⟨10.1007/978-1-4614-6825-7_12⟩
Chapitre d'ouvrage
hal-01199884v1
|
||
Rendezvous in networks in spite of delay faultsDistributed Computing, 2016
Article dans une revue
hal-01330426v1
|
|||
|
|
Rendezvous in networks in spite of delay faults2024
Pré-publication, Document de travail
hal-03138464v1
|
||
|
|
Cop and robber games when the robber can hide and rideSIAM Journal on Discrete Mathematics, 2011, 25 (1), pp.333-359
Article dans une revue
inria-00622957v1
|
||
Rendezvous of Mobile Agents without Agreement on Local OrientationAutomata, Languages and Programming, 37th International Colloquium, ICALP 2010, 2010, Bordeaux, France. pp.515--526, ⟨10.1007/978-3-642-14162-1_43⟩
Communication dans un congrès
istex
hal-01198883v1
|
|||
|
|
Mapping Simple Polygons: How Robots Benefit from Looking BackAlgorithmica, 2013, 65 (1), pp.43--59. ⟨10.1007/s00453-011-9572-8⟩
Article dans une revue
hal-01198892v1
|
||
|
|
Packing bipartite graphs with covers of complete bipartite graphsDiscrete Applied Mathematics, 2014, 168, pp.40--50. ⟨10.1016/j.dam.2012.08.026⟩
Article dans une revue
hal-01198888v1
|
||
|
|
Convergecast and Broadcast by Power-Aware Mobile Agents[Research Report] Laboratoire Informatique Fondamentale, Aix-Marseille Université. 2016
Rapport
hal-01287382v1
|
||
|
|
Utiliser des jumelles pour explorer rapidement les graphes triangulésALGOTEL 2016 - 18èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2016, Bayonne, France
Communication dans un congrès
hal-01305095v2
|
||
|
|
Collecting Information by Power-Aware Mobile AgentsInternational Symposium on DIStributed Computing, Oct 2012, Salvador, Brazil. pp.46 - 60, ⟨10.1007/978-3-642-33651-5_4⟩
Communication dans un congrès
hal-01480387v1
|
||
|
|
Tight Bounds for Scattered Black Hole Search in a Ring18th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Jun 2011, Gdańsk, Poland. pp.186-197, ⟨10.1007/978-3-642-22212-2_17⟩
Communication dans un congrès
hal-00866368v1
|
||
Mobile agent algorithms versus message passing algorithms10th International Conference On Principles Of Distributed Systems (OPODIS 2006), 2006, France. pp.185-199
Communication dans un congrès
hal-00308127v1
|
|||
|
|
Tight Bounds for Black Hole Search with Scattered Agents in Synchronous Rings2011
Rapport
hal-00588856v1
|
||
|
|
Isometric Path Complexity of Graphs48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Aug 2023, Bordeaux, France. pp.32:1-32:14, ⟨10.4230/LIPIcs.MFCS.2023.32⟩
Communication dans un congrès
hal-04184516v1
|
||
|
|
Unlabeled Sample Compression Schemes and Corner Peelings for Ample and Maximum Classes46th International Colloquium on Automata, Languages, and Programming (ICALP 2019), 2019, Patras, Greece. pp.34:1--34:15, ⟨10.4230/LIPIcs.ICALP.2019.34⟩
Communication dans un congrès
hal-02269141v1
|
||
|
|
Dejean's conjecture and letter frequencyRAIRO - Theoretical Informatics and Applications (RAIRO: ITA), 2008, 42, pp.477-480. ⟨10.1051/ita:2008013⟩
Article dans une revue
hal-00432200v1
|
||
On the power of synchronization between two adjacent processesDistributed Computing, 2010, 23 (3), pp.177-196
Article dans une revue
hal-00527102v1
|
|||
|
|
Enumeration and Leader Election in Partially Anonymous and Multi-hop Broadcast Networks2010
Pré-publication, Document de travail
hal-00540222v3
|
||
|
|
Packing Bipartite Graphs with Covers of Complete Bipartite GraphsAlgorithms and Complexity, 7th International Conference, CIAC 2010, 2010, Rome, Italy. pp.276--287, ⟨10.1007/978-3-642-13073-1_25⟩
Communication dans un congrès
hal-01198882v1
|
||
An efficient message passing algorithm based on Mazurkiewicz s algorithmFundamenta Informaticae, 2007, 80 (1-3), pp.221-246
Article dans une revue
hal-00308125v1
|
|||
Local terminations and distributed computability in anonymous networksInternational symposium on distributed computing (DISC), Sep 2008, Arcachon, France. pp.47-62
Communication dans un congrès
hal-00332759v1
|
|||
Rendez vous of mobile agents in unknown graphs with faulty linksDISC 2007, Sep 2007, Cyprus. pp.108--122
Communication dans un congrès
hal-00308123v1
|
|||
Graph labelings derived from models in distributed computingWG 2006, Jun 2006, Norway. pp.301-312
Communication dans un congrès
hal-00308129v1
|
|||
|
|
Collaborative Delivery with Energy-Constrained Mobile Robots 23rd International Colloquium on Structural Information and Communication Complexity, Jun 2016, Helsinki, Finland. pp.258 - 274, ⟨10.1007/978-3-319-48314-6_17⟩
Communication dans un congrès
hal-01480368v1
|
||
|
|
Cop and Robber Game and HyperbolicitySIAM Journal on Discrete Mathematics, 2014, 28 (4), pp.1987--2007. ⟨10.1137/130941328⟩
Article dans une revue
hal-01198887v1
|
||
|
|
Cop and robber games when the robber can hide and ride[Research Report] RR-7178, INRIA. 2010, pp.44
Rapport
inria-00448243v3
|