default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBulletin of the EATCS, Volume 131
Volume 131, 2020
- Paul G. Spirakis:
Letter from the President. - Kazuo Iwama:
Letter from the Bulletin Editor. - Artur Czumaj:
The EATCS Award 2020 - Laudatio for Mihalis Yannakakis. - Anca Muscholl:
The Presburger Award 2020 - Laudatio for Dmitriy Zhuk.
- Kathie Cameron, Kristina Vuskovic:
Hadwiger's Conjecture for some hereditary classes of graphs: a survey. - Joshua A. Grochow:
Complexity in ideals of polynomials: questions on algebraic complexity of circuits and proofs. - Luca Aceto:
Interviews with the 2020 CONCUR Test-of-Time Award Recipients. - Luca Prigioniero:
Regular Languages: To Finite Automata and Beyond Succinct Descriptions and Optimal Simulations. - Andreas Blass, Yuri Gurevich:
Circuits: An abstract viewpoint.
- Yukiko Yamauchi:
Report from EATCS Japan Chapter. - Ulrich Berger, Faron Moller:
Report on BCTCS & AlgoUK 2020. - Jean Goubault-Larrecq:
29th EACSL Annual Conference on Computer Science Logic (CSL 2021).
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 2025-03-08 00:49 CET 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:
