Eric Goles Chacc

From MaRDI portal
Revision as of 16:43, 9 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Eric Goles Chacc to Eric Goles Chacc: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:1825035

Available identifiers

zbMath Open goles-chacc.ericDBLP84/3024WikidataQ3514267 ScholiaQ3514267MaRDI QIDQ1825035

List of research outcomes





PublicationDate of PublicationType
Asymptotic (a)synchronism sensitivity and complexity of elementary cellular automata2024-05-31Paper
On the parameterized complexity of freezing dynamics2024-05-08Paper
Symmetrizable Boolean networks2024-05-02Paper
Tribute to Prof. Jacques Demongeot: conversations at the \textit{National Bar}2024-02-09Paper
Generation and robustness of Boolean networks to model \textit{Clostridium difficile} infection2024-02-09Paper
Attractor landscapes in Boolean networks with firing memory: a theoretical study applied to genetic networks2024-02-09Paper
A portfolio of classification problems by one-dimensional cellular automata, over cyclic binary configurations and parallel update2023-11-30Paper
Fast-Parallel Algorithms for Freezing Totalistic Asynchronous Cellular Automata2023-06-30Paper
On fungal automata2022-10-25Paper
Cyclic automata networks on finite graphs2022-08-16Paper
On the complexity of generalized Q2R automaton2022-05-05Paper
Computational Complexity of Biased Diffusion-Limited Aggregation2022-04-20Paper
On the impact of treewidth in the computational complexity of freezing dynamics2022-03-22Paper
On the complexity of asynchronous freezing cellular automata2021-11-25Paper
Fungal Automata2021-09-08Paper
https://portal.mardi4nfdi.de/entity/Q50102892021-08-25Paper
https://portal.mardi4nfdi.de/entity/Q50103932021-08-25Paper
https://portal.mardi4nfdi.de/entity/Q50101562021-08-24Paper
Freezing sandpiles and Boolean threshold networks: equivalence and complexity2021-04-23Paper
Dynamics of extended Schelling models2021-03-25Paper
https://portal.mardi4nfdi.de/entity/Q51451512021-01-20Paper
Computational universality of fungal sandpile automata2020-11-30Paper
Shift-equivalence of \(k\)-ary, one-dimensional cellular automata rules2020-10-23Paper
On the complexity of the stability problem of binary freezing totalistic cellular automata2020-09-17Paper
The complexity of the asynchronous prediction of the majority automata2020-09-17Paper
On the effects of firing memory in the dynamics of conjunctive networks2020-09-03Paper
https://portal.mardi4nfdi.de/entity/Q52197522020-03-12Paper
On the effects of firing memory in the dynamics of conjunctive networks2019-12-05Paper
Computational Complexity of Biased Diffusion Limited Aggregation2019-04-22Paper
Block invariance and reversibility of one dimensional linear cellular automata2019-03-29Paper
A characterization of the existence of energies for neural networks2019-01-10Paper
A Fast Parallel Algorithm for the Robust Prediction of the Two-Dimensional Strict Majority Automaton2018-07-06Paper
On the computational complexity of the freezing non-strict majority automata2018-03-08Paper
On the complexity of two-dimensional signed majority cellular automata2017-10-11Paper
Self-organized societies: on the Sakoda model of social interactions2017-08-03Paper
Dynamical Properties of An Automaton with Memory2017-02-24Paper
https://portal.mardi4nfdi.de/entity/Q28147552016-06-23Paper
PSPACE-completeness of majority automata networks2015-12-08Paper
Dynamics of neural networks over undirected graphs2015-11-06Paper
https://portal.mardi4nfdi.de/entity/Q34500082015-11-02Paper
Positive Automata Networks2015-04-02Paper
The complexity of the majority rule on planar graphs2015-02-06Paper
Computational complexity of threshold automata networks under different updating schemes2014-11-26Paper
The complexity of the bootstraping percolation and other problems2014-01-16Paper
Deconstruction and dynamical robustness of regulatory networks: application to the yeast cell cycle networks2013-10-11Paper
https://portal.mardi4nfdi.de/entity/Q49121642013-04-03Paper
Disjunctive networks and update schedules2012-06-01Paper
https://portal.mardi4nfdi.de/entity/Q28831872012-05-11Paper
Erratum to: ``Communication complexity and intrinsic universality in cellular automata2012-01-04Paper
Traced communication complexity of cellular automata2011-07-18Paper
Communication complexity in number-conserving and monotone cellular automata2011-07-14Paper
Communication complexity and intrinsic universality in cellular automata2011-01-10Paper
Sequential operator for filtering cycles in Boolean networks2010-09-01Paper
Maximization of granular outflow by oblique exits and by obstacles2010-03-18Paper
Understanding a Non-trivial Cellular Automaton by Finding Its Simplest Underlying Communication Protocol2009-01-29Paper
https://portal.mardi4nfdi.de/entity/Q55062502009-01-28Paper
Covering by squares2008-05-28Paper
Comparison between parallel and serial dynamics of Boolean networks2008-05-28Paper
https://portal.mardi4nfdi.de/entity/Q54483002008-03-20Paper
Crossing information in two-dimensional sandpiles2007-01-09Paper
On limit cycles of monotone functions with symmetric connection graph2004-11-12Paper
Dynamics of a class of ants on a one-dimensional lattice2004-11-12Paper
Folding and tiling2004-11-12Paper
Sandpile models and lattices: a comprehensive survey2004-11-12Paper
On conservative and monotone one-dimensional cellular automata and their particle representation2004-10-27Paper
Fixed points and maximal independent sets in AND-OR networks2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44608712004-03-29Paper
Tiling with bars under tomographic constraints.2003-08-17Paper
Lattice structure and convergence of a game of cards2003-08-14Paper
Complexity of perceptron recognition for a class of geometric patterns.2003-05-25Paper
UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES2002-12-15Paper
Complexity of Langton's ant2002-05-15Paper
Sandpiles and order structure of integer partitions2002-05-15Paper
The structure of a linear chip firing game and related models2002-03-03Paper
https://portal.mardi4nfdi.de/entity/Q27627892002-01-09Paper
Erratum: The one site-distribution of Gibbs states on Bethe lattice are probability vectors of period \(\leq 2\) for a nonlinear transformation.2001-01-16Paper
https://portal.mardi4nfdi.de/entity/Q45025362000-09-12Paper
Source reversal and chip firing on graphs2000-08-23Paper
SAND PILE AS A UNIVERSAL COMPUTER2000-07-05Paper
The one-site distributions of Gibbs states on Bethe lattice are probability vectors of period \(\leq 2\) for a nonlinear transformation.2000-02-02Paper
Tiling allowing rotations only1999-06-21Paper
Universality of the chip-firing game1998-07-23Paper
Complexity of tile rotation problems1998-06-30Paper
Dynamic behavior of cyclic automata networks1997-09-04Paper
https://portal.mardi4nfdi.de/entity/Q48904541997-06-03Paper
Reaction-diffusion automata: Three states implies universality1997-04-22Paper
No polynomial bound for the period of the parallel chip firing game on graphs1997-02-27Paper
Symmetric discrete universal neural networks1997-02-27Paper
https://portal.mardi4nfdi.de/entity/Q48904531996-08-25Paper
https://portal.mardi4nfdi.de/entity/Q43103411996-02-26Paper
Errata: Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions1994-08-14Paper
Games on line graphs and sand piles1994-04-13Paper
Lyapunov operators to study the convergence of extremal automata1994-04-05Paper
On the limit set of some universal cellular automata1993-08-30Paper
https://portal.mardi4nfdi.de/entity/Q40353371993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q39959851993-01-23Paper
Automata networks and optimization1993-01-16Paper
A lower bound on the computational complexity of the \(QR\) decomposition on a shared memory \(SIMD\) computer1992-06-28Paper
Parallel chip firing games on graphs1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39884791992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39886461992-06-28Paper
Lyapunov Functionals for Automata Networks Defined by Cyclically Monotone Functions1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30319371989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33508091989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33582511989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33632051989-01-01Paper
Bifurcation structure of a discrete neuronal equation1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117171988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38152521988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38215961988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38238091988-01-01Paper
Performance of a pipeline array of automata with periodic cycle-time1987-01-01Paper
Properties of positive functions and the dynamics of associated automata networks1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38123201987-01-01Paper
Antisymmetrical neural networks1986-01-01Paper
Invariants in automata networks1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38092921986-01-01Paper
Dynamics of positive automata networks1985-01-01Paper
Decreasing energy functions as a tool for studying threshold networks1985-01-01Paper
Dynamical Behaviour of Neural Networks1985-01-01Paper
Iterative behaviour of one-dimensional threshold automata1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37338461984-01-01Paper
Iterative behaviour of generalized majority functions1983-01-01Paper
Transient length in sequential iteration of threshold functions1983-01-01Paper
Fixed Point Behavior of Threshold Functions on a Finite Set1982-01-01Paper
Specific roles of the different Boolean mappings in random networks1982-01-01Paper
Comportement périodique des fonctions à seuil binaires et applications1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39343071981-01-01Paper
A short proof on the cyclic behaviour of multithreshold symmetric automata1981-01-01Paper
The convergence of symmetric threshold automata1981-01-01Paper
Periodic behaviour of generalized threshold functions1980-01-01Paper
Comportement itératif des fonctions à multiseuil1980-01-01Paper

Research outcomes over time

This page was built for person: Eric Goles Chacc