Bulletin of the EATCS, Volume 67

Volume 67, February 1999

• Neil Immerman: Progress in Descriptive Complexity. 72-81 BibTeX

• Felix Cornelius: An Overview of the Distributed System Classification and Integration Framework DeCIF. 82-92 BibTeX

• Yuri Gurevich: The Sequential ASM Thesis. 93 BibTeX

• Martyn Amos: Theoretical and Experimental DNA Computation. BibTeX

• Gheorghe Paun: Computing with Membranes: An Introduction. 139-152 BibTeX

• Misha Koshelev, Vladik Kreinovich, Luc Longpré: Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). 153-156 BibTeX
• Andrei Paun: On Time-Varying H Systems. 157-164 BibTeX
• Ion Petre: A Normal form for P-Systems. 165-172 BibTeX
• Gwénaël Richomme: Another Characterization of Sturmian Words. 173-175 BibTeX
• M. Schmidt: Time-Bounded Kolmogorov Complexity May Help in Search for Extra Terrestrial Intelligence (SETI). 176-180 BibTeX
• Y. Yam: Reducing the Number of Rules in Intelligent Control: A New Application Area for Algebraic Complexity Techniques. 181-184 BibTeX