Filtrer vos résultats
- 19
- 8
- 12
- 12
- 1
- 1
- 1
- 27
- 5
- 1
- 1
- 5
- 2
- 2
- 4
- 1
- 5
- 3
- 3
- 1
- 27
- 20
- 8
- 5
- 5
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 27
- 6
- 6
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
27 résultats
|
|
|
triés par
|
Beyond classes of graphs with “few” minimal separators : FPT results through potential maximal cliquesWorkshop on Graph-Theoretic Concepts in Computer Science (WG 2015), Jun 2015, Munich, Germany. pp.499-512, ⟨10.1007/978-3-662-53174-7_35⟩
Communication dans un congrès
hal-01216955v1
|
|||
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata13th International Conference on Cellular Automata for Research and Industry (ACRI 2018), Sep 2018, Como, Italy. pp.406-415, ⟨10.1007/978-3-319-99813-8_37⟩
Communication dans un congrès
hal-01985010v1
|
|||
Brief Announcement: Deterministic Graph Connectivity in the Broadcast Congested CliquePODC Principles of Distributed Computing, Jul 2016, Chicago, United States. pp.245-247, ⟨10.1145/2933057.2933066⟩
Communication dans un congrès
hal-01369335v1
|
|||
|
|
A Landscape of Interval Life-like Freezing Cellular AutomataAUTOMATA2021, Jul 2021, Marseille, France
Communication dans un congrès
hal-03270656v1
|
||
On Distributed Merlin-Arthur Decision ProtocolsSIROCCO 2019 - 26th International Colloquium on Structural Information and Communication Complexity, Jul 2019, L'Aquila, Italy. ⟨10.1007/978-3-030-24922-9_16⟩
Communication dans un congrès
hal-02433519v1
|
|||
On Distance-d Independent Set and other problems in graphs with few minimal separators. Graph-Theoretic Concepts in Computer Science - 42st International Workshop, WG 2016, Jun 2016, Istanbul, Turkey
Communication dans un congrès
hal-01369337v1
|
|||
|
|
Compact Distributed Certification of Planar Graphs39th ACM Symposium on Principles of Distributed Computing, Aug 2020, Virtual Event Italy, Italy. pp.319-328, ⟨10.1145/3382734.3404505⟩
Communication dans un congrès
halshs-02991868v1
|
||
|
|
The complexity of the majority rule on planar graphsAdvances in Applied Mathematics, 2015, 64, pp.111-123. ⟨10.1016/j.aam.2014.11.005⟩
Article dans une revue
hal-01315322v1
|
||
|
|
Computational complexity of threshold automata networks under different updating schemesTheoretical Computer Science, 2014, 559, pp.3-19. ⟨10.1016/j.tcs.2014.09.010⟩
Article dans une revue
hal-01315323v1
|
||
|
|
On the impact of treewidth in the computational complexity of freezing dynamics2021
Pré-publication, Document de travail
hal-02665147v1
|
||
A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton12th International Conference on Cellular Automata for Research and Industry, ACRI , Sep 2016, Fès, Morocco. pp.166-175, ⟨10.1007/978-3-319-44365-2_16⟩
Communication dans un congrès
hal-01369334v1
|
|||
Algorithms Parameterized by Vertex Cover and Modular Width, Through Potential Maximal CliquesAlgorithmica, 2018, 80 (4), pp.1146-1169
Article dans une revue
hal-01971125v1
|
|||
|
|
The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinismALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Communication dans un congrès
hal-01148013v1
|
||
|
|
On the complexity of two-dimensional signed majority cellular automataJournal of Computer and System Sciences, 2018, 91, pp.1-32
Article dans une revue
hal-01472161v2
|
||
The Simultaneous Number-in-Hand Communication Model for Networks: Private Coins, Public Coins and DeterminismStructural Information and Communication Complexity - 21st International Colloquium (SIROCCO), 2014, Takayama, Japan. pp.83-95, ⟨10.1007/978-3-319-09620-9_8⟩
Communication dans un congrès
hal-01136022v1
|
|||
|
|
Sequential and distributes graph algorithms. Parameterized algorithms via potential maximal cliques; broadcast congested clique.Data Structures and Algorithms [cs.DS]. Université d'Orléans, 2017. English. ⟨NNT : ⟩
Thèse
tel-03626690v1
|
||
Fixing improper colorings of graphsTheoretical Computer Science, 2018, 711, pp.66-78
Article dans une revue
hal-01971123v1
|
|||
|
|
On the Effects of Firing Memory in the Dynamics of Conjunctive Networks25th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2019, Guadalajara, Mexico. pp.1-19, ⟨10.1007/978-3-030-20981-0_1⟩
Communication dans un congrès
hal-02312604v1
|
||
Computing the Probability of Getting Infected: On the Counting Complexity of Bootstrap PercolationAutomata and Complexity, Essays presented to Eric Goles on the occasion of his 70th birthday., In press
Chapitre d'ouvrage
hal-03242226v1
|
|||
|
|
PSPACE-completeness of majority automata networksTheoretical Computer Science, 2016, 609, pp.118-128. ⟨10.1016/j.tcs.2015.09.014⟩
Article dans une revue
hal-01315324v1
|
||
|
|
Local Certification of Graphs with Bounded GenusDiscrete Applied Mathematics, 2023, 325, pp.9--36. ⟨10.1016/j.dam.2022.10.004⟩
Article dans une revue
hal-03663680v1
|
||
The complexity of the bootstraping percolation and other problemsTheoretical Computer Science, 2013, 504, pp.73-82. ⟨10.1016/j.tcs.2012.08.001⟩
Article dans une revue
istex
hal-00914603v1
|
|||
Algorithms parameterized by vertex cover and modular width, through potential maximal cliquesScandinavian Symposium and Workshops on Algorithm Theory, 2014, Denmark. To appear
Communication dans un congrès
hal-00984059v1
|
|||
Naming Game Automata NetworkJournal of Cellular Automata, 2016, 11 (5-6), pp.497-521
Article dans une revue
hal-01369333v1
|
|||
Generating Boolean Functions on Totalistic Automata NetworksInternational Journal of Unconventional Computing, In press
Article dans une revue
hal-03229422v1
|
|||
|
|
On the complexity of asynchronous freezing cellular automataInformation and Computation, 2021, pp.104764. ⟨10.1016/j.ic.2021.104764⟩
Article dans une revue
hal-03242235v1
|
||
|
|
On the effects of firing memory in the dynamics of conjunctive networksDiscrete & Continuous Dynamical Systems - A, 2020, 40 (10), pp.5765-5793. ⟨10.3934/dcds.2020245⟩
Article dans une revue
hal-03242233v1
|