Bulletin of the EATCS, Volume 81

Volume 81, October 2003

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

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