Filter your results
- 43
- 22
- 28
- 26
- 7
- 4
- 64
- 1
- 1
- 1
- 2
- 5
- 4
- 5
- 2
- 5
- 5
- 8
- 4
- 5
- 2
- 4
- 9
- 1
- 1
- 2
- 61
- 4
- 61
- 21
- 19
- 16
- 14
- 10
- 8
- 7
- 7
- 5
- 5
- 5
- 4
- 2
- 2
- 2
- 1
- 1
- 1
- 65
- 22
- 19
- 18
- 11
- 9
- 7
- 5
- 5
- 5
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
65 Results
|
Deaf, Dumb, and Chatting Robots: Enabling Distributed Computation and Fault-Tolerance Among Stigmergic RobotsThirteenth International Conference On Principle Of DIstributed Systems (OPODIS 2009), Dec 2009, Nîmes, France. pp.71-85, ⟨10.1007/978-3-642-10877-8_8⟩
Conference papers
istex
hal-01298720v1
|
||
How to Meet Asynchronously at Polynomial CostSIAM Journal on Computing, 2015
Journal articles
hal-01330413v1
|
|||
|
Squaring the Circle with Weak Mobile RobotsAlgoTel, 2009, Carry-Le-Rouet, France
Conference papers
inria-00384093v1
|
||
Asynchronous Approach in the Plane: A Deterministic Polynomial Algorithm31st International Symposium on Distributed Computing, DISC 2017, Oct 2017, Vienna, Austria
Conference papers
hal-01672916v1
|
|||
|
COL: A data collection protocol for VANET2012 IEEE Intelligent Vehicles Symposium, 2012, Madrid, Spain. pp.711-716, ⟨10.1109/IVS.2012.6232266⟩
Conference papers
hal-01008765v1
|
||
|
Price of asynchrony in mobile agents computingTheoretical Computer Science, 2014, 524, pp.59-67. ⟨10.1016/j.tcs.2013.12.023⟩
Journal articles
hal-03138505v1
|
||
|
Rendezvous in networks in spite of delay faultsDistributed Computing, 2016, 29 (3), pp.187-205. ⟨10.1007/s00446-015-0259-2⟩
Journal articles
hal-03138464v1
|
||
|
Byzantine gathering in networksDistributed Computing, 2016, 29 (6), pp.435-457. ⟨10.1007/s00446-016-0276-9⟩
Journal articles
hal-01398630v1
|
||
|
Fault-Tolerant Rendezvous in Networks[Research Report] 2014
Reports
hal-00945262v1
|
||
|
Anonymous Meeting in NetworksAlgorithmica, 2016, 74 (2), pp.908-946. ⟨10.1007/s00453-015-9982-0⟩
Journal articles
hal-03138455v1
|
||
Gathering Despite MischiefACM Transactions on Algorithms, 2014, 11 (1), pp.1-28. ⟨10.1145/2629656⟩
Journal articles
hal-03138497v1
|
|||
|
Impact of Knowledge on Election Time in Anonymous NetworksAlgorithmica, 2019, 81 (1), pp.238-288. ⟨10.1007/s00453-018-0444-3⟩
Journal articles
hal-03138396v1
|
||
Byzantine Gathering in NetworksStructural Information and Communication Complexity - 22nd International Colloquium, SIROCCO 2015, Jul 2015, Montserrat, Spain
Conference papers
hal-01330420v1
|
|||
Rendezvous in networks in spite of delay faultsDistributed Computing, 2016
Journal articles
hal-01330426v1
|
|||
|
Self-stabilizing gathering with strong multiplicity detectionTheoretical Computer Science, 2012, 428, pp.47-57. ⟨10.1016/j.tcs.2011.12.010⟩
Journal articles
hal-01197406v1
|
||
Brief announcement: deaf, dumb, and chatting robotsPODC 2009, 2009, Calgary, Alberta, Canada, Canada. pp.308-309
Conference papers
hal-01008757v1
|
|||
Gathering Despite MischiefSODA 2012, 2012, Kyoto, Japan, Japan. pp.527--540
Conference papers
hal-01008764v1
|
|||
|
Want to Gather? No Need to Chatter![Research Report] Université de Picardie Jules Verne. 2020
Reports
hal-03035137v1
|
||
|
Almost Universal Anonymous Rendezvous in the Plane[Research Report] Université de Picardie Jules Verne. 2020
Reports
hal-03035154v1
|
||
|
Self-stabilizing Deterministic Gathering[Research Report] 2009
Reports
inria-00381582v1
|
||
|
How to Meet Asynchronously at Polynomial CostSIAM Journal on Computing, 2015, 44 (3), pp.844-867. ⟨10.1137/130931990⟩
Journal articles
hal-03138485v1
|
||
Deterministic Network Exploration by Anonymous Silent Agents with Local Traffic ReportsACM Transactions on Algorithms, 2014, 11 (2), pp.1-29. ⟨10.1145/2594581⟩
Journal articles
hal-03138500v1
|
|||
Brief Announcement: Leader Election vs Pattern FormationPODC '10 - 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing, Jul 2010, Zurich, Switzerland. pp.404--405, ⟨10.1145/1835698.1835793⟩
Conference papers
hal-01008762v1
|
|||
|
Deterministic Geoleader Election in Disoriented Anonymous SystemsTheoretical Computer Science, 2013, 506, pp.43-54. ⟨10.1016/j.tcs.2013.07.033⟩
Journal articles
hal-00933915v1
|
||
|
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
Conference papers
hal-01782388v1
|
||
Explicit Communication Among Stigmergic RobotsInternational Journal of Foundations of Computer Science, 2019, 30 (02), pp.315-332. ⟨10.1142/S0129054119500072⟩
Journal articles
hal-02420394v1
|
|||
|
Almost-Optimal Deterministic Treasure Hunt in Arbitrary Graphs2021
Preprints, Working Papers, ...
hal-03287599v1
|
||
|
Fault-Tolerant Rendezvous in NetworksInternationnal Conference on Automata, Languages, and Programming, Jul 2014, Copenhagen, Denmark. pp.411-422, ⟨10.1007/978-3-662-43951-7_35⟩
Conference papers
hal-01195852v1
|
||
Scatter of RobotsParallel Processing Letters, 2009, 19 (1), pp.175-184
Journal articles
hal-01008754v1
|
|||
How to meet asynchronously at polynomial costPODC 2013, 2013, Montreal, QC, Canada, Canada. pp.92-99
Conference papers
hal-01008769v1
|