Acta Informatica, Volume 40

Volume 40, Number 1, September 2003

• Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Morten N. Nielsen:
  Extending the accommodating function. 3-35
  Electronic Edition (link) BibTeX
• Ernst-Erich Doberkat:
  Pipelines: Modelling a software architecture through relations. 37-79
  Electronic Edition (link) BibTeX

Volume 40, Number 2, October 2003

• Amir M. Ben-Amram, Omer Berkman, Holger Petersen:
  Element distinctness on one-tape Turing machines: a complete solution. 81-94
  Electronic Edition (link) BibTeX
• Victor Khomenko, Maciej Koutny, Walter Vogler:
  Canonical prefixes of Petri net unfoldings. 95-118
  Electronic Edition (link) BibTeX
• Lila Kari, Stavros Konstantinidis, Elena Losseva, Geoff Wozniak:
  Sticky-free and overhang-free DNA languages. 119-157
  Electronic Edition (link) BibTeX

Volume 40, Number 3, November 2003

• Nicole Lesley, Alan Fekete:
  Providing view synchrony for group communication services. 159-210
  Electronic Edition (link) BibTeX
• Li Layuan, Li Chunlin:
  A distributed QoS-Aware multicast routing protocol. 211-233
  Electronic Edition (link) BibTeX

Volume 40, Number 4, February 2004

• Andrea Walther:
  Program reversals for evolutions with non-uniform step costs. 235-263
  Electronic Edition (link) BibTeX
• Michel Charpentier, K. Mani Chandy:
  Specification transformers: a predicate transformer approach to composition. 265-301
  Electronic Edition (link) BibTeX
• Wen-Chiung Lee, Chin-Chia Wu, Hua-Jung Sung:
  A bi-criterion single-machine scheduling problem with learning considerations. 303-315
  Electronic Edition (link) BibTeX

Volume 40, Number 5, March 2004

• Roberto Barbuti, Luca Tesei:
  Timed automata with urgent transitions. 317-347
  Electronic Edition (link) BibTeX
• Stefan Andrei, Wei-Ngan Chin, Salvador Valerio Cavadini:
  Self-embedded context-free grammars with regular counterparts. 349-365
  Electronic Edition (link) BibTeX
• Yong He, Yiwei Jiang:
  Optimal algorithms for semi-online preemptive scheduling problems on two uniform machines. 367-383
  Electronic Edition (link) BibTeX

Volume 40, Number 6-7, May 2004

• Joost Engelfriet, Tjalling Gelsema:
  A new natural structural congruence in the pi-calculus with replication. 385-430
  Electronic Edition (link) BibTeX
• Nicolas Markey:
  Past is for free: on the complexity of verifying linear temporal properties with past. 431-458
  Electronic Edition (link) BibTeX
• Elizabeth Scott, Adrian Johnstone:
  Reducing non-determinism in right nulled GLR parsers. 459-489
  Electronic Edition (link) BibTeX
• Michael Domaratzki:
  Trajectory-based codes. 491-527
  Electronic Edition (link) BibTeX

Volume 40, Number 8, July 2004

• Stéphane Grumbach, Maurizio Rafanelli, Leonardo Tininini:
  On the equivalence and rewriting of aggregate queries. 529-584
  Electronic Edition (link) BibTeX
• Silvia Bacchelli, Elena Barcucci, Elisabetta Grazzini, Elisa Pergola:
  Exhaustive generation of combinatorial objects by ECO. 585-602
  Electronic Edition (link) BibTeX
• Thorsten Akkerman, Christoph Buchheim, Michael Jünger, Daniel Teske:
  On the complexity of drawing trees nicely: corrigendum. 603-607
  Electronic Edition (link) BibTeX

Volume 40, Number 9, September 2004

• Shlomi Dolev, Elad Schiller:
  Self-stabilizing group communication in directed networks. 609-636
  Electronic Edition (link) BibTeX
• Steven Delvaux, Leon Horsten:
  On best transitive approximations to simple graphs. 637-655
  Electronic Edition (link) BibTeX
• Leah Epstein, Tamir Tassa:
  Approximation schemes for the Min-Max Starting Time Problem. 657-674
  Electronic Edition (link) BibTeX