default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBulletin of the EATCS, Volume 67
Volume 67, February 1999
- Neil Immerman:
Progress in Descriptive Complexity. Bull. EATCS 67: 72-81 (1999)
- Felix Cornelius:
An Overview of the Distributed System Classification and Integration Framework DeCIF. Bull. EATCS 67: 82-92 (1999)
- Yuri Gurevich:
The Sequential ASM Thesis. Bull. EATCS 67: 93 (1999)
- Martyn Amos:
Theoretical and Experimental DNA Computation. Bull. EATCS 67 (1999)
- Gheorghe Paun:
Computing with Membranes: An Introduction. Bull. EATCS 67: 139-152 (1999)
- Misha Koshelev, Vladik Kreinovich, Luc Longpré:
Encryption Algorithms Made (Somewhat) More Natural (a pedagogical remark). Bull. EATCS 67: 153-156 (1999) - Andrei Paun:
On Time-Varying H Systems. Bull. EATCS 67: 157-164 (1999) - Ion Petre:
A Normal form for P-Systems. Bull. EATCS 67: 165-172 (1999) - Gwénaël Richomme:
Another Characterization of Sturmian Words. Bull. EATCS 67: 173-175 (1999) - Martin Schmidt:
Time-Bounded Kolmogorov Complexity May Help in Search for Extra Terrestrial Intelligence (SETI). Bull. EATCS 67: 176-180 (1999) - Y. Yam:
Reducing the Number of Rules in Intelligent Control: A New Application Area for Algebraic Complexity Techniques. Bull. EATCS 67: 181-184 (1999)
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.
last updated on 2025-01-30 20:37 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
