Volume 331, Number 1, February 2005

• 
  Fernando Orejas, Jan van Leeuwen: Preface: Automata, Languages and Programming . 1-2
• 
  Markus Bläser: Beyond the Alder-Strassen bound. 3-21
• 
  Kunihiko Sadakane, Nadia Takki-Chebihi, Takeshi Tokuyama: Combinatorics and algorithms for low-discrepancy roundings of a real sequence. 23-36
• 
  Artur Czumaj, Christian Sohler: Testing hypergraph colorability. 37-52
• 
  Jop F. Sibeyn: Faster gossiping on butterfly networks. 53-72
• 
  Edith Cohen, Eran Halperin, Haim Kaplan: Performance aspects of distributed caches using TTL-based consistency. 73-96
• 
  Rajeev Alur, Kousha Etessami, Mihalis Yannakakis: Realizability and verification of MSC graphs. 97-114
• 
  Franck van Breugel, James Worrell: A behavioural pseudometric for probabilistic transition systems. 115-142
• 
  Hubert Comon, Véronique Cortier: Tree automata with one memory set constraints and cryptographic protocols. 143-214
• 
  Lutz Schröder, Till Mossakowski, Andrzej Tarlecki, Bartek Klin, Piotr Hoffman: Amalgamation in the semantics of CASL. 215-247

Volume 331, Number 2-3, February 2005

• 
  Erika Ábrahám, Frank S. de Boer, Willem P. de Roever, Martin Steffen: An assertion-based proof system for multithreaded Java. 251-290
• 
  Jozef Hooman, Jaco van de Pol: Semantic models of a timed distributed dataspace architecture. 291-323
• 
  Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto: Coalgebraic minimization of HD-automata for the Pi-calculus using polymorphic types. 325-365
• 
  Franz Achermann, Oscar Nierstrasz: A calculus for reasoning about software composition. 367-396
• 
  Yonit Kesten, Amir Pnueli: A compositional approach to CTL* verification. 397-428
• 
  Emil Sekerinski: Verification and refinement with fine-grained action-based concurrent objects. 429-455
• 
  Dirk Pattinson, Martin Wirsing: A coordination approach to mobile components. 457-483

last updated on Wed May 22 06:13:09 2013 by the dblp team
data released under the ODC-BY 1.0 license
see also our legal information page