Volume 403, Number 1, August 2008
Fundamental study
- Zhiguo Yang, Daoyi Xu:
Global dynamics for non-autonomous reaction-diffusion neural networks with time-varying delays.
3-10
Contributions
- Jonathan Timmis, Andrew Hone, Thomas Stibor, Edward Clark:
Theoretical advances in artificial immune systems.
11-32
- Pavel A. Borisovsky, Anton V. Eremeev:
Comparing evolutionary algorithms to the (1+1)-EA.
33-41
- Lvzhou Li, Daowen Qiu:
Determining the equivalence for one-way quantum finite automata.
42-51
- François Fages, Sylvain Soliman:
Abstract interpretation and types for systems biology.
52-70
- Tommaso Toffoli, Silvio Capobianco, Patrizia Mentrasti:
When-and how-can a cellular automaton be rewritten as a lattice gas?
71-88
- M. V. Panduranga Rao:
Interference automata.
89-103
- Carsten Witt:
Population size versus runtime of a simple evolutionary algorithm.
104-120
- Willem L. Fouché, Johannes Heidema, Glyn Jones, Petrus H. Potgieter:
Universality and programmability of quantum computers.
121-129
Erratum
- Faisal Shah Khan, Marek A. Perkowski:
Erratum to: "Synthesis of multi-qudit hybrid and d-valued quantum logic circuits by decomposition" [TCS 367 (3) (2006) 336-346].
130-131
Volume 403, Numbers 2-3, August 2008
- Jean-François Dufourd:
Polyhedra genus theorem and Euler formula: A hypermap-formalized intuitionistic proof.
133-159
- Matthias Baaz, Stefan Hetzl, Alexander Leitsch, Clemens Richter, Hendrik Spohr:
CERES: An analysis of Fürstenberg's proof of the infinity of primes.
160-175
- Florentin Ipate, Mike Holcombe:
Testing data processing-oriented systems from stream X-machine models.
176-191
- Sanjiang Li, Mingsheng Ying:
Soft constraint abstraction based on semiring homomorphism.
192-201
- Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime, Olivier H. Roux:
When are Timed Automata weakly timed bisimilar to Time Petri Nets?
202-220
- Torsten Stüber, Heiko Vogler:
Weighted monadic datalog.
221-238
- José Meseguer, Miguel Palomino, Narciso Martí-Oliet:
Equational abstractions.
239-264
- Dan Olteanu, Christoph Koch, Lyublena Antova:
World-set decompositions: Expressiveness and efficient algorithms.
265-284
- Christophe Calvès, Maribel Fernández:
A polynomial nominal unification algorithm.
285-306
- Étienne Payet:
Loop detection in term rewriting using the eliminating unfoldings.
307-327
- Agata Ciabattoni, George Metcalfe:
Density elimination.
328-346
- Thomas Ehrhard, Laurent Regnier:
Uniformity and the Taylor expansion of ordinary lambda-terms.
347-372
- Alexander Rabinovich:
Arity hierarchy for temporal logics.
373-381
- Laura Bozzelli, Salvatore La Torre, Adriano Peron:
Verification of well-formed communicating recursive state machines.
382-405
Corrigenda
- Andrew R. Plummer:
S4 enriched multimodal categorial grammars are context-free: Corrigendum.
406-408
- Stefan Milius, Lawrence S. Moss:
Corrigendum to: "The category theoretic solution of recursive program schemes" [TCS 366 (2006) 3-59].
409-415
Last update Wed May 22 18:54:22 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
