Bulletin of the EATCS, Volume 80

Volume 80, June 2003

• Michael Drmota, Wojciech Szpankowski: Analysis of Algorithms (AofA) Part II: 1998-2000 ("Princeton-Barcelona-Gdansk"). 61-76 BibTeX
• Milan Urbásek: Net Transformations for Petri Net Technology. 77-94 BibTeX
• Lance Fortnow, Steven Homer: A Short History of Computational Complexity. 95-133 BibTeX
• Pablo Arrighi: Quantum Computation Explained to My Mother. 134-142 BibTeX
• Juha Honkala: The DF0L Language Equivalence Problem. 143-152 BibTeX

• Martin Dietzfelbinger, Manfred Kunde: A case against using Stirling's formula (unless you really need it). 153-158 BibTeX
• Michael Domaratzki: On Iterated Scattered Deletion. 159-161 BibTeX
• Tero Harju, Dirk Nowotka: Periodicity and Unbordered Segments of Words. 162-167 BibTeX
• Kamala Krithivasan, Sandeep V. Varma: On Minimising P Finite State Automata. 168-173 BibTeX

• Wil M. P. van der Aalst: Challenges in Business Process Management: Verification of Business Processing Using Petri Nets. 174-199 BibTeX
• Yannis C. Stamatiou: Threshold Phenomena: The Computer Scientist's Viewpoint. 199-234 BibTeX

• Henning Fernau: Education(al) matters: teaching P versus NP. 237-246 BibTeX