Acta Informatica, Volume 42

Volume 42, Number 1, October 2005

• Iwona Cieslik:
  On-line coloring and cliques covering for KK_{s, t}-free graphs. 1-20
  
• Markus Büttner:
  Enhanced prefetching and caching strategies for single- and multi-disk systems. 21-42
  
• Floris Geerts, Lieven Smits, Jan Van den Bussche:
  N-dimensional versus (N-1)-dimensional connectivity testing of first-order queries to semi-algebraic sets. 43-56
  
• Lars Jacobsen, Kim S. Larsen:
  Exponentially decreasing number of operations in balanced trees. 57-78
  

Volume 42, Number 2-3, November 2005

• Rocco De Nicola, Davide Sangiorgi:
  Types in concurrency. 79-81
  
• Martin Berger, Kohei Honda, Nobuko Yoshida:
  Genericity and the pi-calculus. 83-141
  
• Lorenzo Bettini, Betti Venneri, Viviana Bono:
  MOMI: a calculus for mobile mixins. 143-190
  
• Simon J. Gay, Malcolm Hole:
  Subtyping for session types in the pi calculus. 191-225
  

Volume 42, Number 4-5, December 2005

• Matthew Hennessy, Julian Rathke, Nobuko Yoshida:
  safeDpi: a language for controlling mobile code. 227-290
  
• Naoki Kobayashi:
  Type-based information flow analysis for the pi-calculus. 291-347
  
• Barbara König:
  A general framework for types in graph rewriting. 349-388
  

Volume 42, Number 6-7, March 2006

• Mila E. Majster-Cederbaum, Jinzhao Wu, Houguang Yue:
  Refinement of actions for real-time concurrent systems with causal ambiguity. 389-418
  
• Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
  Embedding linear orders in grids. 419-428
  
• Francesca Levi:
  A typed encoding of boxed into safe ambients. 429-500
  
• Leah Epstein, Tamir Tassa:
  Vector assignment schemes for asymmetric settings. 501-514
  
• Alberto Trombetta, Danilo Montesi:
  Equivalences and optimizations in an expressive XSLT subset. 515-539
  

Volume 42, Number 8-9, April 2006

• Alexander Meduna:
  Deep pushdown automata. 541-552
  
• Symeon Bozapalidis, Antonios Kalampakas:
  Recognizability of graph and pattern languages. 553-581
  
• Wim H. Hesselink:
  Splitting forward simulations to copewith liveness. 583-602
  
• Srecko Brlek, Elisa Pergola, Olivier Roques:
  Non uniform random generation of generalized Motzkin paths. 603-616
  
• Nikolaj Tatti:
  Safe projections of binary data sets. 617-638
  
• Ferucio Laurentiu Tiplea, Constantin Enea:
  Abstractions of data types. 639-671