Theoretical Computer Science, Volume 408

Volume 408, Number 1, November 2008

• Grzegorz Rozenberg:
  Preface. 1-2
  

• Muffy Calder, Stephen Gilmore:
  Preface. 3
  

• Mark Girolami:
  Bayesian inference for differential equations. 4-16
  
• Alberto Credi, Marco Garavelli, Cosimo Laneve, Sylvain Pradalier, Serena Silvi, Gianluigi Zavattaro:
  nanoK: A calculus for the modeling and simulation of nano devices. 17-30
  
• Raya Khanin, Desmond J. Higham:
  Chemical Master Equation and Langevin regimes for a gene transcription model. 31-40
  
• Federica Ciocchetta, Jane Hillston, Martin Kos, David Tollervey:
  Modelling co-transcriptional cleavage in the synthesis of yeast pre-rRNA. 41-54
  
• François Fages, Aurélien Rizk:
  On temporal logic constraint solving for analyzing numerical data time series. 55-65
  
• Andrea Bracciali, Marcello Brunelli, Enrico Cataldo, Pierpaolo Degano:
  Synapses as stochastic concurrent systems. 66-82
  
• Lorenzo Dematté, Corrado Priami, Alessandro Romanel, Orkun Soyer:
  Evolving BlenX programs to simulate the evolution of biological networks. 83-96
  

Volume 408, Numbers 2-3, November 2008

• Nancy M. Amato, Der-Tsai Lee, Andrea Pietracaprina, Roberto Tamassia:
  Preface. 97-98
  

• Franco P. Preparata:
  The unpredictable deviousness of models. 99-105
  
• Alberto Apostolico, Claudia Tagliacollo:
  Incremental discovery of the irredundant motif bases for all suffixes of a string in O(n²logn) time. 106-115
  
• Luca Allulli, Giorgio Ausiello, Vincenzo Bonifaci, Luigi Laura:
  On the power of lookahead in on-line server routing problems. 116-128
  
• Melanie Badent, Emilio Di Giacomo, Giuseppe Liotta:
  Drawing colored graphs on colored points. 129-142
  
• Sandeep N. Bhatt, Gianfranco Bilardi, Geppino Pucci:
  Area-time tradeoffs for universal VLSI circuits. 143-150
  
• Mary Ellen Bock, Claudio Garutti, Concettina Guerra:
  Cavity detection and matching for binding site recognition. 151-162
  
• Jean-Daniel Boissonnat, Camille Wormser, Mariette Yvinec:
  Anisotropic diagrams: Labelle Shewchuk approach revisited. 163-173
  
• Luca Castelli Aleardi, Olivier Devillers, Gilles Schaeffer:
  Succinct representations of planar maps. 174-187
  
• Bruno Codenotti, Amin Saberi, Kasturi R. Varadarajan, Yinyu Ye:
  The complexity of equilibria: Hardness results for economies via a correspondence with games. 188-198
  
• Michael T. Goodrich:
  Pipelined algorithms to detect cheating in long-term grid computations. 199-207
  
• Kazuo Iwama, Hiroki Morizumi, Jun Tarui:
  Reductions for monotone Boolean circuits. 208-212
  
• Irit Katriel, Claire Kenyon-Mathieu, Eli Upfal:
  Commitment under uncertainty: Two-stage stochastic matching problems. 213-223
  
• Charalampos Papamanthou, Ioannis G. Tollis:
  Algorithms for computing a parameterized st-orientation. 224-240
  
• Eric Rachlin, John E. Savage:
  Nanowire addressing with randomized-contact decoders. 241-261