Stop the war!
Остановите войну!
for scientists:
default search action
Bulletin of the EATCS, Volume 66
Volume 66, October 1998
- Eric Allender:
News from the Isomorphism Front. Bull. EATCS 66: 73 (1998)
- Hartmut Ehrig:
EATCS Mini-Track of FM'99. Bull. EATCS 66: 83-84 (1998) - Julia Padberg:
Classification of Petri Nets Using Adjoint Functors. Bull. EATCS 66: 85-91 (1998)
- Bent Thomsen, Lone Leth Thomsen:
Towards Global Computations Guided by Concurrency Theory. Bull. EATCS 66: 92-99 (1998)
- Mika Hirvensalo:
An Introduction to Quantum Computing. Bull. EATCS 66: 100-121 (1998)
- Erzsébet Csuhaj-Varjú, Arto Salomaa:
Networks of Language Processors: Parallel Communicating Systems. Bull. EATCS 66: 122-138 (1998)
- Cristian Calude, Elena Calude, Catalina Stefanescu:
Computational Complementarity for Mealy Automata. Bull. EATCS 66: 139-149 (1998) - Ann Q. Gates, Vladik Kreinovich, Luc Longpré:
Kolmogorov Complexity Justifies Software Engineering Heuristics. Bull. EATCS 66: 150-154 (1998) - Ekkart Kindler, Michael Weber:
The Dimensions of Petri Nets: The Petri Net Cube. Bull. EATCS 66: 155-165 (1998) - Misha Koshelev:
Towards the Use of Aesthetics in Decision Making: Kolmogorov Complexity Formalizes Birkhoff's Idea. Bull. EATCS 66: 166-170 (1998) - Enno Ohlebusch:
Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. Bull. EATCS 66: 171-177 (1998) - Ludwig Staiger:
The Hausdorff Measure of Regular omega-languages is Computable. Bull. EATCS 66: 178-182 (1998)
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.