Theoretical Computer Science, Volume 333

Volume 333, Number 1-2, March 2005

• Andrew D. Gordon:
  Preface for the Special Issue: Foundations of Software Science and Computation Structures. 1
  
• Andreas Abel, Ralph Matthes, Tarmo Uustalu:
  Iteration and coiteration schemes for higher-order and nested datatypes. 3-66
  
• Bruno Blanchet, Andreas Podelski:
  Verification of cryptographic protocols: tagging enforces termination. 67-90
  
• Eduardo Bonelli:
  Normalisation for higher-order calculi with explicit substitutions. 91-125
  
• Iovka Boneva, Jean-Marc Talbot:
  When ambients cannot be opened. 127-169
  
• Franck van Breugel, Michael W. Mislove, Joël Ouaknine, James Worrell:
  Domain theory, testing and simulation for labelled Markov processes. 171-197
  
• Jim Laird:
  Game semantics and linear CPS interpretation. 199-224
  
• Denis Lugiez:
  Multitree automata that count. 225-263
  
• Luigi Santocanale, André Arnold:
  Ambiguous classes in mu-calculi hierarchies. 265-296
  
• Vladimiro Sassone, Pawel Sobocinski:
  Locating reaction with 2-categories. 297-327
  

Volume 333, Number 3, March 2005

• David Peleg, Jop F. Sibeyn:
  Preface: Structural Information and Communication Complexity. 329-330
  
• Andre Osterloh:
  Optimal oblivious routing on d-dimensional meshes. 331-346
  
• Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro:
  Single backup table schemes for shortest-path routing. 347-353
  
• Dariusz R. Kowalski, Andrzej Pelc:
  Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. 355-371
  
• Costas Busch, Marios Mavronicolas, Paul G. Spirakis:
  The cost of concurrent, low-contention Read&Modify&Write. 373-400
  
• Michele Flammini, Alfredo Navarra, Andrzej Proskurowski:
  On routing of wavebands for all-to-all communications in all-optical paths and cycles. 401-413
  
• Cyril Gavoille, Martin Nehéz:
  Interval routing in reliability networks. 415-432
  
• Antonio Fernández, Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman:
  The Do-All problem with Byzantine processor failures. 433-454