default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDominique Désérable
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c20]Miroslaw Szaban, Michal Seredynski, Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
Pattern Formation by Collective Behavior of Competing Cellular Automata-Based Agents. ACRI 2024: 34-44- 2023
- [j16]Franciszek Seredynski
, Tomasz Kulpa, Rolf Hoffmann, Dominique Désérable:
Coverage and Lifetime Optimization by Self-Optimizing Sensor Networks. Sensors 23(8): 3930 (2023) - 2022
- [j15]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
Cellular automata rules solving the wireless sensor network coverage problem. Nat. Comput. 21(3): 417-447 (2022) - [c19]Franciszek Seredynski, Tomasz Kulpa, Rolf Hoffmann, Dominique Désérable:
Towards Self-optimizing Sensor Networks: Game-Theoretic Second-Order CA-Based Approach. ACRI 2022: 208-219 - 2021
- [j14]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
A cellular automata rule placing a maximal number of dominoes in the square and diamond. J. Supercomput. 77(8): 9069-9087 (2021) - [c18]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
Minimal Covering of the Space by Domino Tiles. PaCT 2021: 453-465 - 2020
- [i1]Genaro J. Martínez, Andrew Adamatzky, Rolf Hoffmann, Dominique Désérable, Ivan Zelinka:
On patterns and dynamics of Rule 22 cellular automaton. CoRR abs/2005.01480 (2020)
2010 – 2019
- 2019
- [j13]Genaro J. Martínez, Andrew Adamatzky, Rolf Hoffmann, Dominique Désérable, Ivan Zelinka:
On Patterns and Dynamics of Rule 22 Cellular Automaton. Complex Syst. 28(2) (2019) - [j12]Rolf Hoffmann, Dominique Désérable:
Domino pattern formation by cellular automata agents. J. Supercomput. 75(12): 7799-7813 (2019) - [c17]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
A Probabilistic Cellular Automata Rule Forming Domino Patterns. PaCT 2019: 334-344 - [c16]Franciszek Seredynski, Jakub Gasior, Rolf Hoffmann, Dominique Désérable:
Experiments with Heterogenous Automata-Based Multi-agent Systems. PPAM (2) 2019: 433-444 - 2018
- [c15]Rolf Hoffmann, Dominique Désérable, Franciszek Seredynski:
Termination and Stability Levels in Evolved CA Agents for the Black-Pattern Task. ACRI 2018: 137-145 - 2017
- [c14]Rolf Hoffmann, Dominique Désérable:
Generating Maximal Domino Patterns by Cellular Automata Agents. PaCT 2017: 18-31 - 2016
- [j11]Dominique Désérable, Rolf Hoffmann, Genaro Juárez Martínez:
Preface. J. Cell. Autom. 11(1): 1-3 (2016) - [j10]Dominique Désérable, Rolf Hoffmann:
Rectangular vs. Triangular Minimal Routing and Performance Study. J. Cell. Autom. 11(1): 47-61 (2016) - [c13]Rolf Hoffmann, Dominique Désérable:
Line Patterns Formed by Cellular Automata Agents. ACRI 2016: 424-434 - 2015
- [c12]Dominique Désérable, Rolf Hoffmann:
Hexagonal Bravais-Miller Routing by Cellular Automata Agents. PaCT 2015: 164-178 - 2014
- [j9]Rolf Hoffmann, Dominique Désérable:
All-to-all communication with cellular automata agents in 2d grids: topologies, streets and performances. J. Supercomput. 69(1): 70-80 (2014) - [c11]Dominique Désérable:
Systolic Dissemination in the Arrowhead Family. ACRI 2014: 75-86 - 2013
- [j8]Dominique Désérable, Rolf Hoffmann, Genaro Juárez Martínez:
Preface. J. Cell. Autom. 8(1-2): 1-3 (2013) - [j7]Patrick Ediger, Rolf Hoffmann, Dominique Désérable:
Rectangular vs Triangular Routing with Evolved Agents. J. Cell. Autom. 8(1-2): 73-89 (2013) - [c10]Rolf Hoffmann, Dominique Désérable:
CA Agents for All-to-All Communication Are Faster in the Triangulate Grid. PaCT 2013: 316-329 - 2012
- [j6]Dominique Désérable, Rolf Hoffmann:
Preface. J. Cell. Autom. 7(1): 1-3 (2012) - [j5]Patrick Ediger, Rolf Hoffmann, Dominique Désérable:
Routing in the Triangular Grid with Evolved Agents. J. Cell. Autom. 7(1): 47-65 (2012) - [c9]Dominique Désérable:
Propagative Mode in a Lattice-Grain CA: Time Evolution and Timestep Synchronization. ACRI 2012: 20-31 - [c8]Dominique Désérable, Rolf Hoffmann:
Rectangular vs. triangular minimal routing and performance study. HPCS 2012: 231-237 - 2011
- [j4]Dominique Désérable, Pascal Dupont, Mustapha Hellou, Siham Kamali-Bernard:
Cellular Automata in Complex Matter. Complex Syst. 20(1) (2011) - [c7]Patrick Ediger, Rolf Hoffmann, Dominique Désérable:
Rectangular vs triangular routing with evolved agents. HPCS 2011: 787-793 - [c6]Rolf Hoffmann, Dominique Désérable:
Efficient Minimal Routing in the Triangular Grid with Six Channels. PaCT 2011: 152-165 - 2010
- [c5]Guillaume Cottenceau, Dominique Désérable:
Open Environment for 2d Lattice-Grain CA. ACRI 2010: 12-23 - [c4]Patrick Ediger, Rolf Hoffmann, Dominique Désérable:
Routing in the triangular grid with evolved agents. HPCS 2010: 582-590
2000 – 2009
- 2007
- [c3]Dominique Désérable, Pascal Dupont, Mustapha Hellou, Siham Kamali-Bernard:
Cellular Automata Models for Complex Matter. PaCT 2007: 385-400 - 2002
- [j3]Dominique Désérable:
A Versatile Two-dimensional Cellular Automata Network for Granular Flow. SIAM J. Appl. Math. 62(4): 1414-1436 (2002)
1990 – 1999
- 1999
- [j2]Dominique Désérable:
A Family of Cayley Graphs on the Hexavalent Grid. Discret. Appl. Math. 93(2-3): 169-189 (1999) - 1997
- [j1]Dominique Désérable:
Broadcasting in the Arrowhead Torus. Comput. Artif. Intell. 16(6): 545-559 (1997) - [c2]Dominique Désérable:
Minimal Routing in the Triangular Grid and in a Family of Related Tori. Euro-Par 1997: 218-225 - 1994
- [c1]Dominique Désérable:
Broadcasting in the Arrowhead Torus. CONPAR 1994: 808-819
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-14 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
