Theoretical Computer Science, Volume 340

Volume 340, Number 1, June 2005

• Roberto Gorrieri, Fabio Martinelli:
  Theoretical foundations of security analysis and design II. 1-2
  
• Alessandra Di Pierro, Chris Hankin, Herbert Wiklicky:
  Measuring the confinement of probabilistic systems. 3-56
  
• Jonathan Herzog:
  A computational interpretation of Dolev-Yao adversaries. 57-81
  
• Gordon Thomas Rohrmair, Gavin Lowe:
  Using data-independence in the analysis of intrusion detection systems. 82-101
  
• Karthikeyan Bhargavan, Cédric Fournet, Andrew D. Gordon:
  A semantics for web services authentication. 102-153
  
• Roberto Zunino, Pierpaolo Degano:
  Weakening the perfect encryption assumption in Dolev-Yao adversaries. 154-178
  

Volume 340, Issue 2, June 2005

• Aldo de Luca, Filippo Mignosi, Dominique Perrin, Grzegorz Rozenberg:
  Preface. 179-185
  

• From Antonio's former students. 186-187
  

• Arto Salomaa:
  Connections between subwords and certain matrix mappings. 188-203
  
• Isabel M. Araújo, Véronique Bruyère:
  Words derivated from Sturmian words. 204-219
  
• Arturo Carpi, Aldo de Luca:
  Codes of central Sturmian words. 220-239
  
• Clelia de Felice:
  An enhanced property of factorizing codes. 240-256
  
• Stefano Crespi-Reghizzi, Matteo Pradella:
  Tile rewriting grammars and picture languages. 257-272
  
• Tero Harju, Dirk Nowotka:
  Counting bordered and primitive words with a fixed weight. 273-279
  
• Jean Berstel:
  Growth of repetition-free words -- a review. 280-290
  
• Zoltán Ésik, Pascal Weil:
  Algebraic recognizability of regular tree languages. 291-321
  
• Juhani Karhumäki, Michel Latteux, Ion Petre:
  Commutation with codes. 322-333
  
• Jean-Pierre Borel, Christophe Reutenauer:
  Palindromic factors of billiard words. 334-348
  
• Paola Bonizzoni, Giancarlo Mauri:
  Regular splicing languages and subclasses. 349-363
  
• Christian Choffrut, Berke Durak:
  Collage of two-dimensional words. 364-380
  
• Marie-Pierre Béal, Dominique Perrin:
  Codes and sofic constraints. 381-393
  
• Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
  Small size quantum automata recognizing some regular languages. 394-407
  
• Marcella Anselmo, Dora Giammarresi, Maria Madonia:
  New operations and regular expressions for two-dimensional languages over one-letter alphabet. 408-431
  
• Julien Clément, Jean-Pierre Duval, Giovanna Guaiana, Dominique Perrin, Giuseppina Rindone:
  Parsing with a finite dictionary. 432-442
  
• Jean-Eric Pin, Pedro V. Silva:
  A topological approach to transductions. 443-456
  

Volume 340, Number 3, 31 August 2005

• Mogens Nielsen, Branislav Rovan:
  Introduction - Combined TCSA/TCSB issue - mathematical foundations of computer science 2000. 457-458
  
• Mariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama:
  Compositional characterisations of lambda-terms using intersection types. 459-495
  
• Arnaud Durand, Miki Hermann, Phokion G. Kolaitis:
  Subtractive reductions and complete problems for counting complexity classes. 496-513
  
• Dimitris Fotakis, Sotiris E. Nikoletseas, Vicky G. Papadopoulou, Paul G. Spirakis:
  Radiocoloring in planar graphs: Complexity and approximations. 514-538
  
• Ugo Montanari, Marco Pistore:
  Structured coalgebras and minimal HD-automata for the pi-calculus. 539-576
  
• David Peleg:
  Informative labeling schemes for graphs. 577-593
  
• Petr Savický, Detlef Sieling:
  A hierarchy result for read-once branching programs with restricted parity nondeterminism. 594-605
  
• Lucian Wischik, Philippa Gardner:
  Explicit fusions. 606-630
  

Last update Thu May 23 19:35:58 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page