Filtrer vos résultats
- 13
- 10
- 10
- 7
- 2
- 2
- 1
- 1
- 2
- 22
- 1
- 1
- 1
- 3
- 2
- 5
- 3
- 6
- 1
- 1
- 1
- 21
- 2
- 20
- 16
- 15
- 3
- 3
- 3
- 3
- 2
- 1
- 1
- 1
- 1
- 23
- 19
- 8
- 6
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
23 résultats
|
|
triés par
|
|
Almost Universal Anonymous Rendezvous in the PlaneSPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Jul 2020, Virtual Event, United States. pp.117-127, ⟨10.1145/3350755.3400283⟩
Communication dans un congrès
hal-03138344v1
|
||
|
Deterministic Treasure Hunt in the Plane with Angular Hints29th International Symposium on Algorithms and Computation, ISAAC 2018, Dec 2018, Jiaoxi Township, Taiwan. pp.48:1--48:13, ⟨10.4230/LIPIcs.ISAAC.2018.48⟩
Communication dans un congrès
hal-01970990v1
|
||
|
Almost Universal Anonymous Rendezvous in the Plane[Research Report] Université de Picardie Jules Verne. 2020
Rapport
hal-03035154v1
|
||
|
Want to Gather? No Need to Chatter![Research Report] Université de Picardie Jules Verne. 2020
Rapport
hal-03035137v1
|
||
Byzantine Gathering in NetworksStructural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Jul 2015, Montserrat, Spain
Communication dans un congrès
hal-01330420v1
|
|||
|
Asynchronous approach in the plane: a deterministic polynomial algorithmDistributed Computing, 2019, 32 (4), pp.317-337. ⟨10.1007/s00446-018-0338-2⟩
Article dans une revue
hal-02413273v1
|
||
|
Want to Gather? No Need to Chatter!PODC '20 - 39th Symposium on Principles of Distributed Computing, Aug 2020, Salerno / Virtual, Italy. pp.253-262, ⟨10.1145/3382734.3405693⟩
Communication dans un congrès
hal-03138303v1
|
||
|
Deterministic Treasure Hunt in the Plane with Angular HintsAlgorithmica, 2020, 82 (11), pp.3250-3281. ⟨10.1007/s00453-020-00724-4⟩
Article dans une revue
hal-03138288v1
|
||
|
Rassemblement byzantin dans les réseaux20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications(ALGOTEL 2018), May 2018, Roscoff, France
Communication dans un congrès
hal-01782387v1
|
||
|
Almost-Optimal Deterministic Treasure Hunt in Arbitrary GraphsInternational Colloquium on Automata, Languages and Programming (ICALP) 2021, Jul 2021, Glasgow, United Kingdom
Communication dans un congrès
hal-03287594v1
|
||
|
Approche asynchrone dans le plan : un algorithme déterministe polynomialALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France
Communication dans un congrès
hal-01782388v1
|
||
|
On the Deterministic Gathering of Mobile AgentsDistributed, Parallel, and Cluster Computing [cs.DC]. Sorbonne Université, 2019. English. ⟨NNT : 2019SORUS175⟩
Thèse
tel-02320156v3
|
||
|
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs2021
Pré-publication, Document de travail
hal-03287599v1
|
||
|
Byzantine gathering in networksDistributed Computing, 2016, 29 (6), pp.435-457. ⟨10.1007/s00446-016-0276-9⟩
Article dans une revue
hal-01398630v1
|
||
Almost-Optimal Deterministic Treasure Hunt in Unweighted GraphsACM Transactions on Algorithms, 2023, 19 (3), pp.1-32. ⟨10.1145/3588437⟩
Article dans une revue
hal-04122270v1
|
|||
|
Visual Secrets : A recognition-based security primitive and its use for boardroom voting2022
Pré-publication, Document de travail
hal-03133412v2
|
||
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm31st International Symposium on Distributed Computing, DISC 2017, Oct 2017, Vienna, Austria
Communication dans un congrès
hal-01672916v1
|
|||
Impact of knowledge on the cost of treasure hunt in treesNetworks, In press, pp.net.22075. ⟨10.1002/net.22075⟩
Article dans une revue
hal-03595594v1
|
|||
Byzantine Gathering in Polynomial Time45th International Colloquium on Automata, Languages, and Programming (ICALP 2018), Jul 2018, Prague, Czech Republic. ⟨10.4230/LIPIcs.ICALP.2018.147⟩
Communication dans un congrès
hal-01965743v1
|
|||
|
Trouver un trésor plus rapidement avec des conseils angulairesALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
Communication dans un congrès
hal-02118362v1
|
||
|
On Deterministic Rendezvous at a Node of Agents with Arbitrary VelocitiesInformation Processing Letters, 2018, 133, pp.39 - 43. ⟨10.1016/j.ipl.2018.01.003⟩
Article dans une revue
hal-01701786v1
|
||
Using virtual reality and eye-tracking with child sexual offenders: Assessing deviant sexual interestsVirtual Reality Technologies for Health and Clinical Applications: Vol. 2: Psychological and Neurocognitive Interventions / S. Rizzo & S. Bouchard (eds.), Springer, pp.32, In press
Chapitre d'ouvrage
hal-01768276v1
|
|||
|
Byzantine gathering in polynomial timeDistributed Computing, 2022, 35 (3), pp.235-263. ⟨10.1007/s00446-022-00419-9⟩
Article dans une revue
hal-03705418v1
|