Filter your results
- 37
- 29
- 41
- 15
- 5
- 3
- 1
- 1
- 5
- 63
- 5
- 1
- 2
- 3
- 1
- 3
- 3
- 2
- 4
- 3
- 5
- 4
- 4
- 8
- 5
- 1
- 3
- 6
- 2
- 2
- 3
- 1
- 53
- 13
- 37
- 23
- 16
- 10
- 10
- 10
- 8
- 8
- 7
- 6
- 6
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 66
- 18
- 16
- 11
- 9
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 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
66 Results
|
Distributed Chasing of Network Intruders by Mobile Agents.Theoretical Computer Science, 2008, 399 (1-2), pp.12--37. ⟨10.1016/j.tcs.2008.02.004⟩
Journal articles
hal-00341368v1
|
||
|
Perpetual Graph Searching[Research Report] RR-7897, INRIA. 2012
Reports
hal-00675233v1
|
||
Brief announcement: Compact Self-Stabilizing Leader Election for General Networks31st International Symposium on Distributed Computing (DISC 2017), Oct 2017, Vienna, Austria
Conference papers
hal-01553088v1
|
|||
|
A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning TreeOPODIS 2001, 2001, France. pp.113-124
Conference papers
hal-00134604v1
|
||
|
The first Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General GraphsInternational Journal of Foundations of Computer Science, 2004, 15, pp.507--516. ⟨10.1142/S0129054104002571⟩
Journal articles
hal-00082534v1
|
||
|
On the Self-stabilization of Mobile Robots in Graphs[Research Report] RR-6266, INRIA. 2007, pp.23
Reports
inria-00166547v2
|
||
|
Construction auto-stabilisante silencieuse optimale en mémoire d'arbres couvants de degré minimumALGOTEL 2014 -- 16èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2014, Le Bois-Plage-en-Ré, France. pp.1-4
Conference papers
hal-00983011v1
|
||
|
Fast Self-Stabilizing Minimum Spanning Tree ConstructionDISC 2010 - 24th International Symposium on Distributed Computing, Sep 2010, Cambridge, MA, United States. pp.480-494, ⟨10.1007/978-3-642-15763-9_46⟩
Conference papers
hal-00492398v2
|
||
|
Distributed Approximation Allocation Resources Algorithm for Connecting GroupsEuro-Par, 2006, Germany. pp.519--529, ⟨10.1007/11823285_54⟩
Conference papers
hal-00341986v1
|
||
|
Silent MST Approximation for Tiny MemorySSS 2020 : The 22th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2020, Austin, TX / Virtual, United States. pp.118-132, ⟨10.1007/978-3-030-64348-5_10⟩
Conference papers
hal-03140584v1
|
||
|
Distributed Chasing of Network Intruders by Mobile AgentsProceedings of the 13th Colloquium on Structural Information and Communication Complexity (SIROCCO 2006), 2006, Chester, United Kingdom. pp.70--84, ⟨10.1007/11780823_7⟩
Conference papers
hal-00342000v1
|
||
|
A New Self-Stabilizing Minimum Spanning Tree Construction with Loop-Free PropertyThe Computer Journal, 2016, 59 (2), pp.225-243. ⟨10.1093/comjnl/bxv110⟩
Journal articles
hal-01269828v1
|
||
|
Détection de terminaison silencieuse, anonyme, stabilisante instantanémentAlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
Conference papers
hal-03651261v2
|
||
|
Borne inférieure optimale pour la complexité spatiale des algorithmes déterministes auto-stabilisants d'électionAlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
Conference papers
hal-03651152v2
|
||
|
Brief Announcement: Distributed Exclusive and Perpetual Tree SearchingDISC 2012 - 26th International Symposium on Distributed Computing, Oct 2012, Salvador, Brazil. pp.403-404, ⟨10.1007/978-3-642-33651-5_29⟩
Conference papers
hal-00741982v1
|
||
Hardness Results and Heuristic for Multi-groups InterconnectionThe Computer Journal, 2010, 53 (9), pp. 1497--1507. ⟨10.1093/comjnl/bxp072⟩
Journal articles
hal-01310352v1
|
|||
|
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme[Research Report] LIP6 UMR 7606, INRIA, UPMC Sorbonne Universités, France. 2013
Reports
hal-00879578v1
|
||
Proceedings of the 4th International Workshop on Theoretical Aspects of Dynamic Distributed Systems (TADDS 2012)ACM New York, NY, USA, pp.43, 2012, ICPS, 978-1-4503-1849-5
Proceedings
hal-00788158v1
|
|||
Distributed Cost Management in a Selfish Multi-Operators BGP Network2005, pp.CD
Conference papers
hal-00126486v1
|
|||
|
Algorithme distribué tricritère pour la construction de structures de connexionsActes des Rencontres Francophones sur les aspects Algorithmiques des Télécommunications (AlgoTel), 2006, France. pp.45--48
Conference papers
hal-00341985v1
|
||
Brief Announcement: Space-Optimal Silent Self-stabilizing Spanning Tree Constructions Inspired by Proof-Labeling Schemes28th International Symposium on Distributed Computing (DISC 2014), Oct 2014, Austin Texas, United States. pp.565-566
Conference papers
hal-01206324v1
|
|||
|
Exclusive Graph SearchingAlgorithmica, 2017, 77 (3), pp.942-969. ⟨10.1007/s00453-016-0124-0⟩
Journal articles
hal-01266492v1
|
||
Bounding Degrees on RPLThe 11th ACM Symposium on QoS and Security for Wireless and Mobile Networks, Q2SWinet 2015, Nov 2015, Cancun, Mexico. pp.123-130, ⟨10.1145/2815317.2815339⟩
Conference papers
hal-01269834v1
|
|||
|
A Self-Stabilizing Memory Efficient Algorithm for the Minimum Diameter Spanning Tree under an Omnipotent DaemonJournal of Parallel and Distributed Computing, 2018, 117, pp.50-62. ⟨10.1016/j.jpdc.2018.02.007⟩
Journal articles
hal-01966265v1
|
||
|
A new self-stabilizing minimum spanning tree construction with loop-free property23rd International Symposium on Distributed Computing (DISC 2009), Sep 2009, Elche, Spain. pp.407--422, ⟨10.1007/978-3-642-04355-0_43⟩
Conference papers
hal-00869591v1
|
||
|
Interconnexion multi-groupes9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.41-44
Conference papers
inria-00176947v1
|
||
|
Self-stabilizing minimum degree spanning tree within one from the optimal degreeJournal of Parallel and Distributed Computing, 2011, 71 (3), pp.438-449. ⟨10.1016/j.jpdc.2010.08.019⟩
Journal articles
hal-01151868v1
|
||
|
Fair cost-sharing methods for the minimum spanning tree gameInformation Processing Letters, 2006, 100, pp.29--35. ⟨10.1016/j.ipl.2006.05.007⟩
Journal articles
hal-00341341v1
|
||
Distributed cost management in a selfish multi-operators BGP networkProceedings of the first EuroNGI Conference on Traffic Engineering for the Next Generation Internet, 2005, Italy. pp.24--30, ⟨10.1109/NGI.2005.1431643⟩
Conference papers
hal-00341996v1
|
|||
|
Space-Optimal Time-Efficient Silent Self-Stabilizing Constructions of Constrained Spanning Trees35th IEEE International Conference on Distributed Computing Systems (ICDCS), Jun 2015, Columbus, United States. pp.589-598, ⟨10.1109/ICDCS.2015.66⟩
Conference papers
hal-01247340v1
|