UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

On the robustness of update schedules in Boolean networks

BioSystems, 2009-07, Vol.97 (1), p.1-8

2009

Volltextzugriff (PDF)

Comparison between parallel and serial dynamics of Boolean networks

Theoretical computer science, 2008-05, Vol.396 (1), p.247-253

2008

Volltextzugriff (PDF)

Communication complexity and intrinsic universality in cellular automata

Theoretical computer science, 2011, Vol.412 (1), p.2-21

2011

Volltextzugriff (PDF)

Communication complexity in number-conserving and monotone cellular automata

Theoretical computer science, 2011-07, Vol.412 (29), p.3616-3628

2011

Volltextzugriff (PDF)

Crossing information in two-dimensional Sandpiles

Theoretical computer science, 2006-12, Vol.369 (1), p.463-469

2006

Volltextzugriff (PDF)

Covering by squares

Theoretical computer science, 2008-05, Vol.396 (1-3), p.10-27

2008

Volltextzugriff (PDF)

Dynamics of a class of ants on a one-dimensional lattice

Theoretical computer science, 2004-08, Vol.322 (2), p.267-283

2004

Volltextzugriff (PDF)

Erratum to: “Communication Complexity and Intrinsic Universality in Cellular Automata” [Theor. Comput. Sci. 412 (1–2) (2011) 2–21]

Theoretical computer science, 2011-12, Vol.412 (52), p.7169-7170

2011

Volltextzugriff (PDF)

Folding and tiling

Theoretical computer science, 2004-08, Vol.322 (2), p.285-296

Goles, Eric

2004

Volltextzugriff (PDF)

Communication complexity and intrinsic universality in cellular automata: Complexity of Simple Programs

Theoretical computer science, 2011, Vol.412 (1-2), p.2-21

2011

Volltextzugriff (PDF)

On limit cycles of monotone functions with symmetric connection graph

Theoretical computer science, 2004-08, Vol.322 (2), p.237-244

2004

Volltextzugriff (PDF)

On conservative and monotone one-dimensional cellular automata and their particle representation

Theoretical computer science, 2004-10, Vol.325 (2), p.285-316

2004

Volltextzugriff (PDF)

No polynomial bound for the period of the parallel chip firing game on graphs

Theoretical computer science, 1994-12, Vol.136 (2), p.527-532

1994

Volltextzugriff (PDF)

Sandpile models and lattices: a comprehensive survey

Theoretical computer science, 2004-08, Vol.322 (2), p.383-407

2004

Volltextzugriff (PDF)

The structure of a linear chip firing game and related models

Theoretical computer science, 2002-01, Vol.270 (1), p.827-841

2002

Volltextzugriff (PDF)

Dynamics of positive automata networks

Theoretical computer science, 1985, Vol.41 (1), p.19-32

Goles Ch, E.

1985

Volltextzugriff (PDF)

Complexity of perceptron recognition for a class of geometric patterns

Theoretical computer science, 2003-04, Vol.299 (1-3), p.65-79

2003

Volltextzugriff (PDF)

Periodic behaviour of generalized threshold functions

Discrete mathematics, 1980, Vol.30 (2), p.187-189

1980

Volltextzugriff (PDF)

Molecular control of neural crest formation, migration and differentiation

Current Opinion in Cell Biology, 2000-12, Vol.12 (6), p.719-724

2000

Volltextzugriff (PDF)

Tiling with bars under tomographic constraints

Theoretical computer science, 2003-01, Vol.290 (3), p.1317-1329

2003

Volltextzugriff (PDF)

Universality of the chip-firing game

Theoretical computer science, 1997-02, Vol.172 (1), p.121-134

1997

Volltextzugriff (PDF)

Source reversal and chip firing on graphs

Theoretical computer science, 2000-02, Vol.233 (1-2), p.287-295

2000

Volltextzugriff (PDF)

Discrete state neural networks and energies

Neural networks, 1997-03, Vol.10 (2), p.327-334

1997

Volltextzugriff (PDF)

Lyapunov operators to study the convergence of extremal automata

Theoretical computer science, 1994-03, Vol.125 (2), p.329-337

Goles, Eric

1994

Volltextzugriff (PDF)

Tiling allowing rotations only

Theoretical computer science, 1999-05, Vol.218 (2), p.285-295

1999

Volltextzugriff (PDF)

1 – 25 von 42

Menü

Weitere Dienste

Einstellungen

On the robustness of update schedules in Boolean networks

Comparison between parallel and serial dynamics of Boolean networks

Communication complexity and intrinsic universality in cellular automata

Communication complexity in number-conserving and monotone cellular automata

Crossing information in two-dimensional Sandpiles

Covering by squares

Dynamics of a class of ants on a one-dimensional lattice

Erratum to: “Communication Complexity and Intrinsic Universality in Cellular Automata” [Theor. Comput. Sci. 412 (1–2) (2011) 2–21]

Folding and tiling

Communication complexity and intrinsic universality in cellular automata: Complexity of Simple Programs

On limit cycles of monotone functions with symmetric connection graph

On conservative and monotone one-dimensional cellular automata and their particle representation

No polynomial bound for the period of the parallel chip firing game on graphs

Sandpile models and lattices: a comprehensive survey

The structure of a linear chip firing game and related models

Dynamics of positive automata networks

Complexity of perceptron recognition for a class of geometric patterns

Periodic behaviour of generalized threshold functions

Molecular control of neural crest formation, migration and differentiation

Tiling with bars under tomographic constraints

Universality of the chip-firing game

Source reversal and chip firing on graphs

Discrete state neural networks and energies

Lyapunov operators to study the convergence of extremal automata

Tiling allowing rotations only

Aktive Filter

Suchergebnisse filtern