![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Bulletin of the EATCS, Volume 108
Volume 108, October 2012
- Luca Aceto:
Letter from the President. 11-13 - Maria J. Serna:
Letter from the Bulletin Editor. 14 - Burkhard Monien:
Report form the EATCS General Assembly. 15-23 - Friedhelm Meyer auf der Heide:
The EATCS Award 2013. Call for nominations. 16 - Sanjeev Arora:
The Gödel Price 2013. Call for Nominations. 17-21 - Monika Henzinger:
The Presburger Award 2013: Call for Nominations. 22-23 - Peter van Emde Boas:
In Memoriam Manfred Kudlek (1940-2012). 24-30
- Cristian S. Calude:
News from New Zealand. 37-45
- Arne Meier, Julian-Steffen Müller, Martin Mundhenk, Heribert Vollmer:
Complexity of Model Checking for Logics over Kripke models. 49-89 - Euripides Markou:
Identifying Hostile Nodes in Networks Using Mobile Agents. 93-129 - Boaz Barak:
Truth vs. Proof in Computational Complexity. 130-142
- Maurice Nivat:
40th Anniversary of EATCS. 145-147 - Jirí Wiedermann:
Thirty Years of Collaboration with Jan van Leeuwen: In Search of Understanding Computation. 148-160
- Bill Smyth:
Report from IWOCA 2012. 163-167 - Andreas Malcher:
Report from DCFS 2012. 168-169
- Hugo Hernández Pibernat:
Swarm Intelligence Techniques for Optimization and Management Tasks in Sensor Networks. 173-176
- Bruno Courcelle, Joost Engelfriet:
Book: Graph Structure and Monadic Second-Order Logic. A Language-Theoretic Approach. 179
![](https://dblp.uni-trier.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.