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
|
|||
|
|
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
|
||
|
|
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
|
||
|
|
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
|
||
|
|
ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians2024
Pré-publication, Document de travail
hal-03714728v1
|
||
|
|
Sample Compression Schemes for Balls in GraphsSIAM Journal on Discrete Mathematics, 2023, 37 (4), pp.2585-2616. ⟨10.1137/22M1527817⟩
Article dans une revue
hal-03705798v2
|
||
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
|