default search action
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"). Bull. EATCS 80: 61-76 (2003) - Milan Urbásek:
Net Transformations for Petri Net Technology. Bull. EATCS 80: 77-94 (2003) - Lance Fortnow, Steven Homer:
A Short History of Computational Complexity. Bull. EATCS 80: 95-133 (2003) - Pablo Arrighi:
Quantum Computation Explained to My Mother. Bull. EATCS 80: 134-142 (2003) - Juha Honkala:
The DF0L Language Equivalence Problem. Bull. EATCS 80: 143-152 (2003)
- Martin Dietzfelbinger, Manfred Kunde:
A case against using Stirling's formula (unless you really need it). Bull. EATCS 80: 153-158 (2003) - Michael Domaratzki:
On Iterated Scattered Deletion. Bull. EATCS 80: 159-161 (2003) - Tero Harju, Dirk Nowotka:
Periodicity and Unbordered Segments of Words. Bull. EATCS 80: 162-167 (2003) - Kamala Krithivasan, Sandeep V. Varma:
On Minimising P Finite State Automata. Bull. EATCS 80: 168-173 (2003)
- Wil M. P. van der Aalst:
Challenges in Business Process Management: Verification of Business Processing Using Petri Nets. Bull. EATCS 80: 174-199 (2003) - Yannis C. Stamatiou:
Threshold Phenomena: The Computer Scientist's Viewpoint. Bull. EATCS 80: 199-234 (2003)
- Henning Fernau:
Education(al) matters: teaching P versus NP. Bull. EATCS 80: 237-246 (2003)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.