Bulletin of the EATCS, Volume 81

Volume 81, October 2003

• Elias Koutsoupias: Selfish Task Allocation. 79-88 BibTeX
• Luca Aceto: Some of My Favourite Results in Classic Process Algebra. 90-108 BibTeX
• Scott Aaronson: Is P Versus NP Formally Independent? 109-136 BibTeX
• Rainer Feldmann, Martin Gairing, Thomas Lücking, Burkhard Monien, Manuel Rode: Selfish Routing in Non-Cooperative Networks: A Survey. 137-164 BibTeX
• Arto Salomaa: Counting (scattered) Subwords. 165-179 BibTeX
• Juan de Lara: Meta-Modelling and Graph Transformation for the Simulation of Systems. 180-194 BibTeX
• Andreas Blass, Yuri Gurevich: Algorithms: A Quest for Absolute Definitions. 195-225 BibTeX
• David Harel: A Grand Challenge for Computing: Towards Full Reactive Modeling of A Multi-Cellular Animal. 226-235 BibTeX
• Tero Harju, Ion Petre, Grzegorz Rozenberg: Gene Assembly in Ciliates Part I. Molecular Operations. 236-249 BibTeX

• Samee Ullah Khan: Plays, Values, Analysis and The Complexity of Chinese Chess. 253-263 BibTeX
• Martin Böhme, Bodo Manthey: The Computational Power of Compiling C++. 264-270 BibTeX
• Rodrigo Readi Nasser: A Note on First Order Unification. 271-278 BibTeX
• Eugene Eberbach, Peter Wegner: Beyond Turing Machines. 279-304 BibTeX
• Elena Losseva: Building Reliable Systems from Unreliable Components and the DNA Computing Paradigm. 305-317 BibTeX