Filter your results
- 20
- 13
- 3
- 1
- 1
- 1
- 16
- 24
- 14
- 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
- 1
- 1
- 33
- 8
- 6
- 2
- 16
- 15
- 13
- 12
- 11
- 4
- 3
- 3
- 3
- 2
- 2
- 1
- 1
- 1
- 1
- 39
- 27
- 26
- 22
- 22
- 22
- 20
- 20
- 17
- 16
- 16
- 16
- 15
- 14
- 14
- 12
- 12
- 11
- 11
- 8
- 8
- 8
- 7
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 35
- 4
- 23
- 16
- 1
- 1
- 2
- 5
- 2
- 6
- 3
- 2
- 6
- 4
- 3
- 1
- 3
|
|
sorted by
|
Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern EmergenceProceedings of MFCS'2011, 2011, Unknown, Unknown Region. pp.508--520
Conference papers
hal-01459886v1
|
|||
Emergence of regularities on decreasing sandpile models15th Mons Theoretical Computer Science Days, Sep 2014, Nancy, France
Conference papers
hal-01459882v1
|
|||
Emergence of wave patterns on Kadanoff Sandpiles11th Latin American Theoretical INformatics Symposium (LATIN), Mar 2014, Montevideo, Uruguay. A paraître
Conference papers
halshs-00949246v1
|
|||
|
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⟩
Conference papers
hal-01313306v1
|
||
|
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
Conference papers
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
Conference papers
hal-01785462v1
|
||
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⟩
Conference papers
hal-02403974v1
|
|||
|
Maximum sensitivity to update schedules of elementary cellular automata over periodic configurations2019
Preprints, Working Papers, ...
hal-02179732v1
|
||
Effects of Migration of Three Competing Species on Their Distributions in Multizone EnvironmentProceedings of RIVF'2013, 2013, Unknown, Unknown Region. pp.227--232
Conference papers
hal-01459883v1
|
|||
|
Strong Emergence of Wave Patterns on Kadanoff SandpilesThe Electronic Journal of Combinatorics, 2017, 24 (2), pp. 2-4
Journal articles
halshs-01417254v1
|
||
|
Hardness of monadic second-order formulae over succinct graphs2023
Preprints, Working Papers, ...
hal-03978957v1
|
||
Avalanche Structure in the Kadanoff Sand Pile ModelProceedings of LATA'2011, 2011, Unknown, Unknown Region. pp.427--439
Conference papers
hal-01459885v1
|
|||
Computational complexity of the avalanche problem for one dimensional decreasing sandpilesJournal of Cellular Automata, 2018, 13 (3), pp. 215-228
Journal articles
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
Conference papers
hal-01242024v1
|
|||
Chip-firing game and partial Tutte polynomial for Eulerian digraphsThe Electronic Journal of Combinatorics, 2016, 23 (1)
Journal articles
hal-01459877v1
|
|||
|
Rikudo is NP-complete[Research Report] Inria; Université Côte d'Azur; I3S; CNRS. 2021
Reports
hal-03512769v1
|
||
|
Études de la complexité algorithmique des réseaux d'automatesMathématique discrète [cs.DM]. Aix-Marseille Université, 2022
Habilitation à diriger des recherches
tel-03611794v1
|
||
Balanced Connected Partitioning of Unweighted Grid GraphsProceedings of MFCS'2018, 2018, Liverpool, United Kingdom. pp.39:1--39:18, ⟨10.4230/LIPIcs.MFCS.2018.39⟩
Conference papers
hal-02093978v1
|
|||
|
Kadanoff Sand Pile Model, Avalanche Structure and Wave ShapeTheoretical Computer Science, 2013, 504, pp.52-72. ⟨10.1016/j.tcs.2013.01.033⟩
Journal articles
halshs-00949239v1
|
||
|
Linearity is Strictly More Powerful than Contiguity for Encoding GraphsDiscrete Mathematics, 2016, 339 (8), pp.2168-2177. ⟨10.1016/j.disc.2016.03.006⟩
Journal articles
hal-01424428v1
|
||
|
Emergence on Decreasing Sandpile ModelsMFCS 2015 40th International Symposium on Mathematical Foundations of Computer Science, Aug 2015, Milan, Italy
Conference papers
halshs-01212069v1
|
||
Characterisation of the elementary cellular automata in terms of their maximum sensitivity to all possible asynchronous updatesChaos, Solitons & Fractals, 2018, 113, pp.209--220. ⟨10.1016/j.chaos.2018.06.004⟩
Journal articles
hal-02093397v1
|
|||
|
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⟩
Conference papers
hal-03188339v1
|
||
|
Non-maximal Sensitivity to Synchronism in Periodic Elementary Cellular Automata: Exact Asymptotic Measures26th International Workshop on Cellular Automata and Discrete Complex Systems (AUTOMATA), Aug 2020, Stockholm, Sweden. pp.14-28, ⟨10.1007/978-3-030-61588-8_2⟩
Conference papers
hal-03659470v1
|
||
|
A framework for (de)composing with Boolean automata networksInternational Conference on Machines, Computations, and Universality (MCU'2018), 2018, Fontainebleau, France
Conference papers
hal-01654221v2
|
||
Emergence on decreasing sandpile modelsProceedings of MFCS'2015, 2015, Unknown, Unknown Region. pp.419--431
Conference papers
hal-01459879v1
|
|||
|
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
Journal articles
hal-01738027v1
|
||
|
Feedback arc set problem and NP-hardness of minimum recurrent configuration problem of Chip-firing game on directed graphsAnnals of Combinatorics, 2015, 19 (2), pp.373-396. ⟨10.1007/s00026-015-0266-9⟩
Journal articles
hal-01459881v1
|
||
|
On the complexity of two-dimensional signed majority cellular automataJournal of Computer and System Sciences, 2018, 91, pp.1-32
Journal articles
hal-01472161v2
|
||
|
How Hard is it to Predict Sandpiles on Lattices? A SurveyFundamenta Informaticae, 2020, 171 (1-4), pp.189-219. ⟨10.3233/FI-2020-1879⟩
Journal articles
hal-02457343v1
|
- 1
- 2