default search action
Bulletin of the EATCS, Volume 114
Volume 114, October 2014
- Luca Aceto:
Letter from the President. - Kazuo Iwama:
Letter from the Bulletin Editor. - Vladimiro Sassone:
The EATCS Award 2015 - Call for Nominations. - Peter Widmayer:
The Presburger Award 2015 - Call for Nominations. - Dorothea Wagner:
EATCS Fellows 2015 - Call for Nominations. - Giuseppe Persiano:
EATCS Distinguished Dissertation Award 2014 - Call for Nominations. - John Corcoran, Paliath Narendran, Wolfgang Thomas:
Obituary Robert McNaughton 1924 - 2014.
- Laurent Bulteau, Falk Hüffner, Christian Komusiewicz, Rolf Niedermeier:
Multivariate Algorithmics for NP-Hard String Problems. - Ramprasad Saptharishi:
Recent Progress on Arithmetic Circuit Lower Bounds. - Ivan Lanese, Claudio Antares Mezzina, Francesco Tiezzi:
Causal-Consistent Reversibility. - Maria Couceiro, Vincent Gramoli, Paolo Romano:
6th Workshop on Theory of Transactional Memory. - André Platzer:
Analog and Hybrid Computation: Dynamical Systems and Programming Languages.
- Luca Aceto:
Foreword to the contributions by two EATCS award-recipients. - David P. Woodruff:
Data Streams and Applications in Computer Science. - Andrea Marino:
Algorithms for Biological Graphs: Analysis and Enumeration.
- Cristian S. Calude:
News from New Zealand. - Tiziana Calamoneri:
Report from the Italian Chapter. - Ryuhei Uehara:
Report from the Japanese Chapter. - Luca Aceto:
Report on ICALP 2014. - Marco Bernardo, Daniel Gebler, Michele Loreti:
Report on OPCT 2014. - Luca Aceto, Magnús M. Halldórsson, Anna Ingólfsdóttir:
Report on Two events at ICE-TCS, Reykjavik University. - Hava T. Siegelmann, Rudolf Freund:
Report on UCNC 2014.
- Jan Friso Groote, Mohammad Reza Mousavi:
Book Announcement: Modeling and Analysis of Communicating Systems.
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.