EATCS Fellows

The EATCS Fellows Program is established by the Association to recognize outstanding EATCS Members for their scientific achievements in the field of Theoretical Computer Science. The Fellow status is conferred by the EATCS Fellows-Selection Committee upon a person having a track record of intellectual and organizational leadership within the EATCS community. Fellows are expected to be “model citizens” of the TCS community, helping to develop the standing of TCS beyond the frontiers of the community.

In order to be considered by the EATCS Fellows-Selection Committee, candidates must be nominated by at least four EATCS Members. Please verify your membership at

The EATCS Fellows-Selection Committee consists of

  • Luca Aceto (chair)
  • Orna Kupferman
  • Stefano Leonardi
  • Paul Spirakis

EATCS Fellows 2024 - Call for nominations

Submit by March 7th, 2024 for Fellow consideration by email to the EATCS Secretary ( This e-mail address is being protected from spambots. You need JavaScript enabled to view it ). The subject line of the email should read "EATCS Fellow Nomination - ".

Samson Abramsky, University College London, United Kingdom, for "fundamental contributions to logic in computer science, including domain theory in logical form, game semantics, and category-theoretic foundations of quantum computing" (recognized in 2022)
Luca AcetoReykjavik University, Iceland, and Gran Sasso Science Institute, Italy for "fundamental contributions to concurrency theory, and outstanding merits for the community of theoretical computer science, in particular as an inspiring president of EATCS" (recognized in 2021)
Jiri AdamekTechnische Universität Braunschweig, Germany for "his fundemantal contributions to algebraic methods in computer science, and and his merits as founder and chief editor of the journal Logical Methods in Computer Science" (recognized in 2018)
Yossi Azar, Blavatnik School of Computer Science, Tel-Aviv University, Israel for "many seminal contributions to the study of online and approximation algorithms, and for his long-standing service to the community." (recognized in 2024)
Susanne AlbersTechnische Universität München, Germany for "her contributions to the design and analysis of algorithms, especially online algorithms, approximation algorithms, algorithmic game theory and algorithm engineering" (recognized in 2014)
Rajeev Alur, University of Pennsylvania, USA, for "fundamental contributions to the theory of verification, especially of timed and hybrid, concurrent and multi-agent, and hierarchical and recursive systems" (recognized in 2021)
Giorgio AusielloUniversità di Roma "La Sapienza", Italy for "the impact of his scientific work in the field of algorithms and computational complexity and for his service to the scientific community" (recognized in 2014)
Michael A. Benderfor "fundamental contributions in bringing theoretical computer science techniques to practical problems and systems" (recognized in 2023)
the late Wilfried BrauerTechnische Universität München, Germany for "outstanding contributions to the foundation and organization of the European TCS community" (recognized in 2014)
Artur CzumajUniversity of Warwick, United Kingdom for "contributions to analysis and design of algorithms, especially to understanding the role of randomization in computer science" (recognized in 2015)
Pierpaolo DeganoUniversita di Pisa, Italy for "his contributions in concurrency theory and applications in security and for biological systems" (recognized in 2020)
Mariangiola Dezani-CiancagliniUniversità di Torino, Italy for "distinguished and seminal achievements in formal methods and foundations of programming languages, introducing or developing new type systems for the lambda-calculus as well as for the pi-calculus and related calculi" (recognized in 2015)
Josep DiazUniversitat Politecnica de Catalunya, Spain for "his important scientific contributions to complexity theory and to the design and analysis of algorithms in sequential, parallel and randomised computation models, and for his service to the theoretical computer science community" (recognized in 2017)
Herbert EdelsbrunnerInstitute of Science and Technology Austria and Duke University, USA for "his tremendous impact on the field of computational geometry" (recognized in 2014)
Zoltan EsikUniversity of Szeged, Hungary for "contributions to the fields of automata and formal languages, iteration theories, algebra and logic in computer science, and in particular to their connections. He has been able to apply deep theorems of some area to problems of other fields, yielding particularly short, beautiful and mathematically concise proofs" (recognized in 2016)
Mike FellowsCharles Darwin University, Australia for "his role in founding the field of parameterized complexity theory, which has become a major subfield of research in theoretical computer science, and for being a leader in computer science education" (recognized in 2014)
Fedor Fomin, Department of Computer Science, University of Bergen, Norway for "his fundamental contributions in the fields of parametrized complexity and exponential algorithms" (recognized in 2019)
Leslie Ann Goldberg, for "fundamental contributions to many areas of theoretical computer science, primarily focusing on randomized algorithms and their limitations" (recognized in 2023)
Yuri GurevichMicrosoft Research, USA for "his development of abstract state machines and for outstanding contributions to algebra, logic, game theory, complexity theory and software engineering" (recognized in 2014)
Magnus Mar HalldorssonReyjavik University, Iceland for "his contributions to the theory of approximation and graph algorithms as well as to the study of wireless algorithmics." (recognized in 2020)
David HarelWeizmann Institute of Science, Israel for "fundamental contributions to program verification, database theory, and software engineering, as well as for exceptional merits as a writer and teacher. The Statecharts model has had profound impact on software and systems engineering" (recognized in 2016)
Friedhelm Meyer auf der Heide, Heinz Nixdorf Institute and Department of Computer Science, Paderborn University, Germany for "influential contributions to algorithmic and complexity-theoretic problems in parallel computing, communication and data management in networks, network dynamics, algorithms in computer graphics, and probabilistic analysis" (recognized in 2024)
Monika HenzingerUniversity of Vienna, Austria for "being one of the pioneers of web algorithms, algorithms that deal with problems of the world wide web" (recognized in 2014)
Thomas A. Henzinger, Institute of Science and Technology Austria for "fundamental contributions to formal verification and synthesis of computer and biological systems" (recognized in 2015)
Giuseppe F. ItalianoUniversity of Rome Tor Vergata, Italy for "fundamental contributions to the design and analysis of algorithms for solving theoretical and applied problems in graphs and massive data sets, and for his role in establishing the field of algorithm engineering" (recognized in 2016)
Samir KhullerNorthwestern University, USA for "fundamental contributions to combinatorial approximation algorithms – specifically for work in graph algorithms and scheduling, and for mentoring and building community" (recognized in 2021)
Dexter KozenCornell University, USA for "pioneering and seminal work in fields as diverse as complexity theory, logics of programs, algebra, computer algebra and probabilistic semantics" (recognized in 2015)
Orna Kupferman Hebrew University, Israel for "fundamental contributions to automata- and game-theoretic techniques aiming at the formal verification and reactive synthesis of computing systems" (recognized in 2021)
Marta KwiatkowskaUniversity of Oxford, UK for "pioneering work in the development of model checking for quantitative systems and in its application to a wide range of areas, also for outstanding mentorship, and serving as a role model for female researchers in Computer Science" (recognized in 2017)
Stefano LeonardiSapienza University of Rome, Italy for "his fundamental contributions to solving theoretical and applied problems in approximation and online algorithms, at the interface of economics and computation, and in Web algorithmics" (recognized in 2018)
Claire Mathieu, "for fundamental contributions to solving theoretical and applied problems in approximation algorithms, online algorithms, and auction theory" (recognized in 2023)
Kurt MehlhornMax-Planck-Institut für Informatik, Germany for "his influential contribution to the whole field of algorithmics over the past decades. In addition to key theoretical contributions, he has brought basic research closer to practice" (recognized in 2016)
Rocco de Nicola, IMT School for Advanced Studies, Luca, Italy for "his seminal contributions to concurrency theory, and to languages and models for describing interaction and mobility in multi-agents systems" (recognized in 2019)
David Peleg, Weizmann Institute of Science, Israel for "fundamental contributions to the areas of distributed graph algorithms, wireless networks, robotics and social networks, and his longstanding support for the development of theoretical computer science in Europe" (recognized in 2021)
Jean-Eric PinLIAFA, CNRS and University Paris Diderot, France for "outstanding contributions to the algebraic theory of automata and languages in connection with logic, topology, and combinatorics and service to the European TCS community" (recognized in 2014)

Dana Ron, Faculty of Engineering, Tel-Aviv University, Israel for "her pioneering work in the fields of sub-linear time algorithms and in combinatorial property testing" (recognized in 2019)

Davide SangiorgiUniversity of Bologna, Italy for "fundamental contributions to concurrency and the foundations of programming languages, contributing notably to the π-calculus and to coinduction-based proofs" (recognized in 2021)

Saket Saurabh, The Institute of Mathematical Sciences, Chennai, India for "fundamental contributions to algorithms, including parameterized algorithms and kernelization" (recognized in 2021)

Scott A. Smolka, Stony Brook University, USA for "fundamental contributions to process algebra, model checking, probabilistic processes, runtime verification, and more recently for the successful application of most of these theories to cardiac-cell modelling and analysis" (recognized in 2016)

Paul Spirakis, University of Liverpool, UK, and University of Patras, Greece for "seminal papers on Random Graphs and Population Protocols, Algorithmic Game Theory, as well as Robust Parallel Distributed Computing" (recognized in 2014)

Aravind Srinivasan, University of Maryland, College Park, USA for "major contributions to algorithms, the uses of randomisation in algorithms, randomness in networks, and the real-world applications of these topics" (recognized in 2017)

Mohammad Taghi, Hajiaghayi, University of Maryland, USA for "his contributions to the theory of algorithms, in particular algorithmic graph theory, game theory, and distributed computing" (recognized in 2020)

Wolfgang Thomas, RWTH Aachen University, Germany for "foundational contributions to the development of automata theory as a framework for modelling, analyzing, verifying and synthesizing information processing systems" (recognized in 2014)

Moshe Y. Vardi, Rice University, USA for "fundamental and lasting contributions to the development of logic in computer science and exceptional services to the community of theoretical computer science" (recognized in 2015)

Moti Yung, Columbia University, Computer Science, USA for "his outstanding innovative contributions to the Foundations of Cryptography and related Theoretical areas as well as to applications of these areas to computer security. In particular, for his tremendous efforts in concretely and decisively demonstrating the value of Theoretical Computer Science research to innovation in technology and by transferring advanced theoretical notions to industrial systems" (recognized in 2017) your social media marketing partner
European Association for Theoretical Computer Science - Maintained and hosted by RU1 / CTI.