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
|
||
|
|
Black Hole Search with Finite Automata Scattered in a Synchronous Torus2011
Rapport
hal-00604523v2
|
||
On snapshots and stable properties detection in anonymous fully distributed systems (Extended abstract)19th International Colloquium on Structural Information and Communication Complexity, Jun 2012, Iceland. pp.207-218
Communication dans un congrès
hal-00695582v1
|
|||
|
|
Limit Behavior of the Multi-Agent Rotor-Router SystemDISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨10.1007/978-3-662-48653-5_9⟩
Communication dans un congrès
hal-01206149v1
|
||
|
|
What Do We Need to Know to Elect in Networks with Unknown Participants?Structural Information and Communication Complexity - 21st International Colloquium, SIROCCO 2014, 2014, Takayama, Japan. pp.279--294, ⟨10.1007/978-3-319-09620-9_22⟩
Communication dans un congrès
hal-01198876v1
|
||
|
|
Simple agents learn to find their way: An introduction on mapping polygonsDiscrete Applied Mathematics, 2013, 161 (10-11), pp.1287--1307. ⟨10.1016/j.dam.2013.01.006⟩
Article dans une revue
hal-01198890v1
|
||
|
|
Data Delivery by Energy-Constrained Mobile Agents on a LineAutomata, Languages, and Programming - 41st International Colloquium, ICALP 2014, 2014, Copenhagen, Denmark. pp.423--434, ⟨10.1007/978-3-662-43951-7_36⟩
Communication dans un congrès
hal-01198877v1
|
||
Data Delivery by Energy-Constrained Mobile AgentsAlgorithms for Sensor Systems - 9th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2013, 2013, Sophia Antipolis, France. pp.111--122, ⟨10.1007/978-3-642-45346-5_9⟩
Communication dans un congrès
hal-01198878v1
|
|||
Sequence HypergraphsWG 2016 ― 42nd International Workshop on Graph-Theoretic Concepts in Computer Science, 2016, Unknown, Unknown Region
Communication dans un congrès
hal-01411308v1
|
|||
|
|
Local Computations on Closed Unlabelled Edges : the Election Problem and the Naming ProblemSOFSEM 2005, Jan 2005, Slovakia. pp.82--91
Communication dans un congrès
hal-00308136v1
|
||
Labelled (hyper)graphs, negotiations and the naming problemInternational conference on graph transformation (ICGT), Sep 2008, United Kingdom. pp.54-68
Communication dans un congrès
hal-00332765v1
|
|||
|
|
Graphs with G^p-connected medians2024
Pré-publication, Document de travail
hal-03550008v1
|
||
|
|
Medians in Median Graphs and Their Cube Complexes in Linear TimeICALP 2020 47th International Colloquium on Automata, Languages, and Programming, 2020, Saarbrücken, Germany. pp.10:1--10:17, ⟨10.4230/LIPIcs.ICALP.2020.10⟩
Communication dans un congrès
hal-03047193v1
|
||
|
|
Network Exploration by Silent and Oblivious RobotsGraph Theoretic Concepts in Computer Science - 36th International Workshop, WG 2010, 2010, Zarós, Crete, Greece. pp.208--219, ⟨10.1007/978-3-642-16926-7_20⟩
Communication dans un congrès
hal-01198880v1
|
||
Population Protocols that Correspond to Symmetric GamesInternational Journal of Unconventional Computing, 2013, 9 (1-2), pp.5--36
Article dans une revue
hal-01198889v1
|
|||
|
|
On Factorization Forests of Finite HeightTheoretical Computer Science, 2004, 310, pp.489--499
Article dans une revue
hal-00308120v1
|
||
Local Computations in Graphs: The Case of Cellular Edge Local ComputationsFundamenta Informaticae, 2006, 74 (1), pp.85-114
Article dans une revue
hal-00160439v1
|
|||
|
|
Convergecast and Broadcast by Power-Aware Mobile AgentsAlgorithmica, 2016, 74, pp.117-155. ⟨10.1007/s00453-014-9939-8⟩
Article dans une revue
hal-01480232v1
|
||
|
|
A counterexample to Thiagarajan's conjecture on regular event structuresJournal of Computer and System Sciences, 2020, 113, pp.76-100. ⟨10.1016/j.jcss.2020.05.001⟩
Article dans une revue
hal-03047160v1
|
||
Weakly modular graphs and nonpositive curvature2015
Pré-publication, Document de travail
hal-01199930v1
|
|||
|
|
1-Safe Petri nets and special cube complexes: equivalence and applicationsACM Transactions on Computational Logic, 2019, 20 (3), pp.17:1-17:49. ⟨10.1145/3322095⟩
Article dans une revue
hal-01863455v2
|
||
|
|
Collaborative delivery on a fixed path with homogeneous energy-constrained agentsTheoretical Computer Science, 2021, 868, pp.87-96. ⟨10.1016/j.tcs.2021.04.004⟩
Article dans une revue
hal-03287588v1
|
||
|
|
Fast Approximation and Exact Computation of Negative Curvature Parameters of GraphsDiscrete and Computational Geometry, 2021, 65 (3), pp.856-892. ⟨10.1007/s00454-019-00107-9⟩
Article dans une revue
hal-02149991v1
|