default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 97 matches
- 2011
- Raimundo Briceño, Pierre-Etienne Meunier:
The structure of communication problems in cellular automata. Automata 2011: 59-76 - Henryk Fuks, Andrew Skelton:
Orbits of the Bernoulli measure in single-transition asynchronous cellular automata. Automata 2011: 95-112 - Felipe García-Ramos:
Product decomposition for surjective 2-block NCCA. Automata 2011: 147-158 - Pierre Guillon:
Projective subdynamics and universal shifts. Automata 2011: 123-134 - Jarkko Kari, Siamak Taati:
Conservation Laws and Invariant Measures in Surjective Cellular Automata. Automata 2011: 113-122 - Sandip Karmakar, Dipanwita Roy Chowdhury:
NOCAS : A Nonlinear Cellular Automata Based Stream Cipher. Automata 2011: 135-146 - Chris J. Kuhlman, Henning S. Mortveit, David Murrugarra, V. S. Anil Kumar:
Bifurcations in Boolean Networks. Automata 2011: 29-46 - Petr Kurka, Enrico Formenti, Alberto Dennunzio:
Asymptotic distribution of entry times in a cellular automaton with annihilating particles. Automata 2011: 47-58 - Vincent Nesme, Guillaume Theyssier:
Selfsimilarity, Simulation and Spacetime Symmetries. Automata 2011: 77-94 - Kévin Perrot, Thi Ha Duong Phan, Van Trung Pham:
On the set of Fixed Points of the Parallel Symmetric Sand Pile Model. Automata 2011: 17-28 - Adrien Richard:
A fixed point theorem for Boolean networks expressed in terms of forbidden subnetworks. Automata 2011: 1-16 - Nazim Fatès, Eric Goles Chacc, Alejandro Maass, Ivan Rapaport:
17th International Workshop on Cellular Automata and Discrete Complex Systems, Automata 2011, Center for Mathematical Modeling, University of Chile, Santiago, Chile, November 21-23, 2011. DMTCS Proceedings AP, DMTCS 2011 [contents] - 2010
- Leemon C. Baird III, Barry Fagin:
Faster Methods for Identifying Nontrivial Energy Conservation Functions for Cellular Automata. Automata 2010: 1-18 - Eric Goles Ch., Mathilde Noual:
Block-sequential update schedules and Boolean automata circuits. Automata 2010: 41-50 - S.-J. Cho, U.-S. Choi, H.-D. Kim, Y.-H. Hwang, J.-G. Kim:
60/102 Null Boundary Cellular Automata based expander graphs. Automata 2010: 19-28 - Henryk Fuks:
Probabilistic initial value problem for cellular automaton rule 172. Automata 2010: 29-40 - Johannes Gütschow, Vincent Nesme, Reinhard F. Werner:
The fractal structure of cellular automata on abelian groups. Automata 2010: 51-70 - Martin Kutrib, Jonas Lefèvre, Andreas Malcher:
The Size of One-Way Cellular Automata. Automata 2010: 71-90 - Maurice Margenstern:
A weakly universal cellular automaton in the hyperbolic 3D space with three states. Automata 2010: 91-110 - Matthias Schulz:
Minimal Recurrent Configurations of Chip Firing Games and Directed Acyclic Graphs. Automata 2010: 111-124 - Predrag T. Tosic:
On the complexity of enumerating possible dynamics of sparsely connected Boolean network automata with simple update rules. Automata 2010: 125-144 - Nazim Fatès, Jarkko Kari, Thomas Worsch:
Automata 2010 - 16th Intl. Workshop on CA and DCS, Nancy, France, June 14-16, 2010. DMTCS Proceedings AL, DMTCS 2010 [contents] - 2003
- Nick Anzalone, John Baldwin, Ilya Bronshtein, T. Kyle Petersen:
A Reciprocity Theorem for Monomer-Dimer Coverings. DMCS 2003: 179-194 - Christopher L. Barrett, Harry B. Hunt III, Madhav V. Marathe, S. S. Ravi, Daniel J. Rosenkrantz, Richard Edwin Stearns:
Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. DMCS 2003: 69-80 - Olivier Bodini:
Tiling a Rectangle with Polyominoes. DMCS 2003: 81-88 - Arnaud Dartois, Clémence Magnien:
Results and conjectures on the Sandpile Identity on a lattice. DMCS 2003: 89-102 - Phan Ti Ha Duong, Eric Thierry:
Dynamics of the Picking transformation on integer partitions. DMCS 2003: 43-56 - Bruno Durand, Enrico Formenti, Aristide Grange, Zsuzsanna Róka:
Number conserving cellular automata: new results on decidability and dynamics. DMCS 2003: 129-140 - Bruno Durand, Enrico Formenti, Georges Varouchas:
On undecidability of equicontinuity classification for cellular automata. DMCS 2003: 117-128 - Nazim Fatès:
Experimental study of Elementary Cellular Automata dynamics using the density parameter. DMCS 2003: 155-166
skipping 67 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-27 13:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint