Filtrer vos résultats
- 14
- 11
- 12
- 9
- 3
- 1
- 19
- 8
- 5
- 2
- 2
- 1
- 1
- 3
- 2
- 4
- 3
- 1
- 3
- 3
- 1
- 1
- 21
- 4
- 12
- 9
- 9
- 8
- 7
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 25
- 9
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
25 résultats
|
|
|
triés par
|
|
|
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
|
||
|
|
Strong Emergence of Wave Patterns on Kadanoff SandpilesThe Electronic Journal of Combinatorics, 2017, 24 (2), pp. 2-4
Article dans une revue
halshs-01417254v1
|
||
|
|
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations2019
Pré-publication, Document de travail
hal-02179732v1
|
||
|
|
Piles de sable décroissantes 1D : classification expérimentale d'émergencesRevue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 2015
Article dans une revue
hal-01738027v1
|
||
|
|
A framework for (de)composing with Boolean automata networksInternational Conference on Machines, Computations, and Universality (MCU'2018), 2018, Fontainebleau, France
Communication dans un congrès
hal-01654221v2
|
||
|
|
Hardness of monadic second-order formulae over succinct graphs2023
Pré-publication, Document de travail
hal-03978957v1
|
||
Computational complexity of the avalanche problem for one dimensional decreasing sandpilesJournal of Cellular Automata, 2018, 13 (3), pp. 215-228
Article dans une revue
halshs-01417248v1
|
|||
Linearity is Strictly More Powerful than Contiguity for Encoding Graphs14th International Symposium on Algorithms and Data Structures – WADS 2015, 2015, Victoria, Canada. pp.212-223
Communication dans un congrès
hal-01242024v1
|
|||
|
|
On the Complexity of Acyclic Modules in Automata NetworksTAMC 2020, Oct 2020, Changsha, China. pp.168-180, ⟨10.1007/978-3-030-59267-7_15⟩
Communication dans un congrès
hal-03188339v1
|
||
|
|
Emergence on Decreasing Sandpile ModelsMFCS 2015 40th International Symposium on Mathematical Foundations of Computer Science, Aug 2015, Milan, Italy
Communication dans un congrès
halshs-01212069v1
|
||
|
|
Kadanoff Sand Pile Model, Avalanche Structure and Wave ShapeTheoretical Computer Science, 2013, 504, pp.52-72. ⟨10.1016/j.tcs.2013.01.033⟩
Article dans une revue
halshs-00949239v1
|
||
|
|
Études de la complexité algorithmique des réseaux d'automatesMathématique discrète [cs.DM]. Aix-Marseille Université, 2022
HDR
tel-03611794v1
|
||
|
|
Linearity is Strictly More Powerful than Contiguity for Encoding GraphsDiscrete Mathematics, 2016, 339 (8), pp.2168-2177. ⟨10.1016/j.disc.2016.03.006⟩
Article dans une revue
hal-01424428v1
|
||
|
|
On the cost of simulating a parallel Boolean automata network with a block-sequential oneProceedings of TAMC'17, Apr 2017, Bern, Switzerland. pp.112--128
Communication dans un congrès
hal-01479439v1
|
||
|
|
Sensitivity to synchronism in some boolean automata networksAUTOMATA 2017 23rd annual international workshop on cellular automata and discrete complex systems , Jun 2017, Milan, Italy
Communication dans un congrès
hal-01785462v1
|
||
Emergence of wave patterns on Kadanoff Sandpiles11th Latin American Theoretical INformatics Symposium (LATIN), Mar 2014, Montevideo, Uruguay. A paraître
Communication dans un congrès
halshs-00949246v1
|
|||
Complexity of Maximum Fixed Point Problem in Boolean NetworksComputing with Foresight and Industry, 15th Conference on Computability in Europe, CiE 2019, Jul 2019, Durham, United Kingdom. pp.132-143, ⟨10.1007/978-3-030-22996-2_12⟩
Communication dans un congrès
hal-02403974v1
|
|||
|
|
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff SandpilesAUTOMATA 2014, Teijiro Isokawa; Katsunobu Imai; Nobuyuki Matsui; Ferdinand Peper; Hiroshi Umeo, Jul 2014, Himeji, Japan. pp.21-30, ⟨10.1007/978-3-319-18812-6_2⟩
Communication dans un congrès
hal-01313306v1
|
||
Emergence of regularities on decreasing sandpile modelsJournées du projet ANR Quasicool, ANR, Oct 2014, Porto Vecchio, France
Communication dans un congrès
halshs-01087472v1
|
|||
|
|
On the emergence of regularities on one-dimensional decreasing sandpilesTheoretical Computer Science, 2020, 846, pp.1-24. ⟨10.1016/j.tcs.2020.06.018⟩
Article dans une revue
halshs-02884875v1
|
||
|
|
On the set of Fixed Points of the Parallel Symmetric Sand Pile ModelAUTOMATA 2011, Nov 2011, Santiago, Chile. pp.17-28, ⟨10.46298/dmtcs.2974⟩
Communication dans un congrès
hal-01196141v1
|
||
Tout est complexeInterstices, 2023
Article dans une revue
hal-04334741v1
|
|||
|
|
NP-completeness of the game KingdominoTheoretical Computer Science, 2020, 822, pp.23-35. ⟨10.1016/j.tcs.2020.04.007⟩
Article dans une revue
hal-03121418v1
|
||
|
|
Complexity of fixed point counting problems in Boolean Networks2021
Pré-publication, Document de travail
hal-03442599v1
|
||
|
|
Any Shape Can Ultimately Cross Information on Two-Dimensional Abelian Sandpile Models24th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Jun 2018, Ghent, Belgium. pp.127-142, ⟨10.1007/978-3-319-92675-9_10⟩
Communication dans un congrès
hal-01824872v1
|