Theoretical Computer Science, Volume 322

Volume 322, Number 1, August 2004

• Patrick Cégielski, Malika More:
  Foreword. 1-3
  

• Zofia Adamowicz, Leszek Aleksander Kolodziejczyk:
  Well-behaved principles alternative to bounded induction. 5-16
  
• Anatoly Petrovich Beltiukov:
  A strong induction scheme that leads to polynomially computable realizations. 17-39
  
• Annie Chateau:
  On the complexity of decision using destinies in H-bounded structures. 41-67
  
• Olivier Finkel:
  Closure properties of locally finite omega-languages. 69-84
  
• Verónica Becher, Serge Grigorieff:
  Recursion and topology on 2<=omega for possibly infinite computations. 85-136
  
• Yassine Hachaïchi:
  Arithmetical definability and computational complexity. 137-146
  
• Andrea Formisano, Eugenio G. Omodeo, Alberto Policriti:
  Three-variable statements of set-pairing. 147-173
  
• Jean-Pierre Ressayre:
  Winning strategies for infinite games: from large cardinals to computer science extended abstract. 175-179
  
• K. Shahbazyan, Yu. Shoukourian:
  EMSO-logic and automata related to homogeneous flow event structures. 181-201
  
• Alan R. Woods:
  Subset sum "cubes" and the complexity of primality testing. 203-219
  
• I. D. Zaslavsky:
  On some generalizations of the primitive recursive arithmetic. 221-230
  

Volume 322, Number 2, August 2004

• Jacques Demongeot, Jacques Mazoyer:
  Discrete applied problems, cellular automata and lattices: florilegium for E. Goles. 231-232
  
• Maurice Nivat:
  For the 50th anniversary of Eric Goles: A few words by Maurice Nivat. 233-235
  

• Julio Aracena, Jacques Demongeot, Eric Goles Ch.:
  On limit cycles of monotone functions with symmetric connection graph. 237-244
  
• Mourad Baïou, Michel Balinski:
  Student admissions and faculty recruitment. 245-265
  
• Anahí Gajardo, Eric Goles Ch.:
  Dynamics of a class of ants on a one-dimensional lattice. 267-283
  
• Eric Goles Ch.:
  Folding and tiling. 285-296
  
• Andrés Moreira:
  Genetic algorithms for the imitation of genomic styles in protein backtranslation. 297-312
  
• Georges Weil, Kamel Heus, Thomas Faraut, Jacques Demongeot:
  The cyclic genetic code as a constraint satisfaction problem. 313-334
  
• Marianne Delorme, Jacques Mazoyer:
  Real-time recognition of languages on an two-dimensional Archimedean thread. 335-354
  
• Christoph Dürr, Ivan Rapaport, Guillaume Theyssier:
  Cellular automata and communication complexity. 355-368
  
• Martín Matamala, Eduardo Moreno:
  Dynamic of cyclic automata over Z² . 369-381
  
• Eric Goles Ch., Matthieu Latapy, Clémence Magnien, Michel Morvan, Ha Duong Phan:
  Sandpile models and lattices: a comprehensive survey. 383-407
  
• Eric Rémila:
  The lattice structure of the set of domino tilings of a polygon. 409-422
  

Volume 322, Number 3, September 2004

• Vladimiro Sassone:
  Preface. 423-426
  

• Martín Abadi, Cédric Fournet:
  Private authentication. 427-476
  
• Nadia Busi, Gianluigi Zavattaro:
  On the expressive power of movement and restriction in pure mobile ambients. 477-515
  
• Luís Caires, Luca Cardelli:
  A spatial logic for concurrency - II. 517-565
  
• Tom Chothia, Dominic Duggan:
  Abstractions for fault-tolerant global computing. 567-613
  
• Matthew Hennessy, Massimo Merro, Julian Rathke:
  Towards a behavioural theory of access and mobility control in distributed systems. 615-669