500 search results - page 27 / 100 » Universality and Cellular Automata |
131
Voted
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Cellular Automata (CA) are discrete dynamical systems and an abstract model of parallel computation. The limit set of a cellular automaton is its maximal topological attractor. A w...
137
Voted
IPPS
2000
IEEE
15 years 8 months ago
2000
IEEE
Cellular automata can be used to design high-performance natural solvers on parallel computers. This paper describes the development of applications using CARPET, a high-level prog...
161
Voted
PKC
1998
Springer
15 years 8 months ago
1998
Springer
One-way hash functions are an important tool in achieving authentication and data integrity. The aim of this paper is to propose a novel one-way hash function based on cellular aut...
108
Voted
JUCS
2002
15 years 3 months ago
2002
: Over the last 30 years or so many results have appeared on the descriptional complexity of machines with limited resources. Since these results have appeared in a variety of diff...
138
Voted
ICES
2000
Springer
15 years 7 months ago
2000
Springer
Testing is a key issue in the design and production of digital circuits: the adoption of BIST (Built-In Self-Test) techniques is increasingly popular, but requires efficient algori...