53 search results - page 9 / 11 » stacs 2009 |
STACS
2009
Springer
14 years 4 months ago
2009
Springer
Cellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours an...
STACS
2009
Springer
14 years 4 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...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
As the World Wide Web is growing rapidly, it is getting increasingly challenging to gather representative information about it. Instead of crawling the web exhaustively one has to...
STACS
2009
Springer
14 years 4 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...