Journals in DBLP

Theor. Comput. Sci.
2004, volume: 325, number: 2

1. Jarkko Kari
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:325, n:2, pp:169-0 [Journal]
   
2. André Barbé, Fritz von Haeseler
   The Pascal matroid as a home for generating sets of cellular automata configurations defined by quasigroups. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:325, n:2, pp:171-214 [Journal]
   
3. Tim Boykett
   Efficient exhaustive listings of reversible one dimensional cellular automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:325, n:2, pp:215-247 [Journal]
   
4. Gianpiero Cattaneo, Alberto Dennunzio, Luciano Margara
   Solution of some conjectures about topological properties of linear cellular automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:325, n:2, pp:249-271 [Journal]
   
5. Eugen Czeizler
   On the size of the inverse neighborhoods for one-dimensional reversible cellular automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:325, n:2, pp:273-284 [Journal]
   
6. Andrés Moreira, Nino Boccara, Eric Goles Ch.
   On conservative and monotone one-dimensional cellular automata and their particle representation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:325, n:2, pp:285-316 [Journal]
   
7. Klaus Sutner
   The complexity of reversible cellular automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:325, n:2, pp:317-328 [Journal]
   
8. Tommaso Toffoli, Silvio Capobianco, Patrizia Mentrasti
   How to turn a second-order cellular automaton into a lattice gas: a new inversion scheme. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2004, v:325, n:2, pp:329-344 [Journal]