![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Bulletin 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)
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.