Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND Volume=559
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Computational complexity of threshold automata networks under different updating schemes
Eric Goles
,
Pedro Montealegre
Theoretical Computer Science
559
, 2014, pp. 3-19
Attractor stability in nonuniform Boolean networks
Chris J. Kuhlman
,
Henning S. Mortveit
Theoretical Computer Science
559
, 2014, pp. 20-33
Limit cycle structure for dynamic bi-threshold systems
Sichao Wu
,
Abhijin Adiga
,
Henning S. Mortveit
Theoretical Computer Science
559
, 2014, pp. 34-41
Around probabilistic cellular automata
Jean Mairesse
,
Irène Marcovici
Theoretical Computer Science
559
, 2014, pp. 42-72
Three research directions in non-uniform cellular automata
Alberto Dennunzio
,
Enrico Formenti
,
Julien Provillard
Theoretical Computer Science
559
, 2014, pp. 73-90
Realization problems for nonuniform cellular automata
Ville Salo
Theoretical Computer Science
559
, 2014, pp. 91-107
The firing squad synchronization problem on CA with multiple updating cycles
Luca Manzoni
,
Hiroshi Umeo
Theoretical Computer Science
559
, 2014, pp. 108-117