EATCS Bulletin Issue 129 is available online

The 129th issue of the EATCS Bulletin, is now available online at featuring

- "Enumeration Complexity" by Y. Strozecki,
- "Hardness-Randomness Tradeoffs for Algebraic Computation" by M. Kumar, R. Saptharishi
- "Relative expressiveness of calculi for reversible concurrency" by D. Medic
- "Exploring the Borderlands of the Gathering Problem" by E. M. E. Mhamdi, R. Guerraoui, A. Maurer, V. Tempez
- "An Informal Visit to the Wonderful Land of Consensus Numbers and Beyond" by M. Raynal
- "Teaching Recursion and Dynamic Programming Before College" by M. Anderle, M. Forišek, M. Steinová
- "Circuit pedantry" by A. Blass, Y. Gurevich

You can download a pdf with the printed version of the bulletin from

We would also like to remind you that as an EATCS member, you have access to the members area which contains news and related articles. Young researchers can find announcements of open positions, news and related articles.

To find out the latest information on EATCS news, activities, conferences, and much more, find us via social media:

facebook page:
youtube channel:
Linkedin EATCS group:
EATCS - Young researchers Linkedin group: your social media marketing partner
European Association for Theoretical Computer Science - Maintained and hosted by RU1 / CTI.