Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBulletin of the EATCS, Volume 65
Volume 65, June 1998
- Paul Beame, Toniann Pitassi:
Propositional Proof Complexity: Past, Present and Future. Bull. EATCS 65: 66-89 (1998)
- Hartmut Ehrig, Fernando Orejas:
Integration Paradigm for Data Type and Process Specification Techniques. Bull. EATCS 65: 90-97 (1998)
- Loïc Colson:
The Logic in Computer Science Column Functions versus Algorithms. Bull. EATCS 65: 98-117 (1998)
- Alexandru Mateescu:
Words on Trajectories. Bull. EATCS 65: 118-135 (1998)
- Carsten Damm:
A Note on Spectral Lower Bound Arguments for Decision Trees. Bull. EATCS 65: 136-138 (1998) - Alfons Geser:
On Essential Premises for the Transformation Order. Bull. EATCS 65: 139-142 (1998)
a service of 
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 2024-06-18 21:21 CEST 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:
