The European Association for Theoretical Computer Science (EATCS) is an international organization with a European focus, founded in 1972. Its aim is to facilitate the exchange of ideas and results among theoretical computer scientists as well as to stimulate cooperation between the theoretical and the practical community in computer science.
Professor Dines Bjørner is a Danish computer scientist.
Leslie Gabriel Valiant is a British American computer scientist and computational theorist. He was born to a chemical engineer father and a translator mother. He is currently the T. Jefferson Coolidge Professor of Computer Science and Applied Mathematics at Harvard University. Valiant was awarded the Turing Award in 2010, having been described by the A.C.M. as a heroic figure in theoretical computer science and a role model for his courage and creativity in addressing some of the deepest unsolved problems in science; in particular for his "striking combination of depth and breadth".
ICALP, the International Colloquium on Automata, Languages, and Programming is an academic conference organized annually by the European Association for Theoretical Computer Science and held in different locations around Europe. Like most theoretical computer science conferences its contributions are strongly peer-reviewed. The articles have appeared in proceedings published by Springer in their Lecture Notes in Computer Science, but beginning in 2016 they are instead published by the Leibniz International Proceedings in Informatics.
Mojżesz Presburger, or Prezburger, was a Polish Jewish mathematician, logician, and philosopher. He was a student of Alfred Tarski, Jan Łukasiewicz, Kazimierz Ajdukiewicz, and Kazimierz Kuratowski. He is known for, among other things, having invented Presburger arithmetic as a student in 1929 – a form of arithmetic in which one allows induction but removes multiplication, to obtain a decidable theory.
Yoav Freund is an Israeli professor of computer science at the University of California San Diego who mainly works on machine learning, probability theory and related fields and applications.
Arto Kustaa Salomaa is a Finnish mathematician and computer scientist. His research career, which spans over forty years, is focused on formal languages and automata theory.
Venkatesan Guruswami is a senior scientist at the Simons Institute for the Theory of Computing and Professor of EECS and Mathematics at the University of California, Berkeley. He did his high schooling at Padma Seshadri Bala Bhavan in Chennai, India. He completed his undergraduate in Computer Science from IIT Madras and his doctorate from Massachusetts Institute of Technology under the supervision of Madhu Sudan in 2001. After receiving his PhD, he spent a year at UC Berkeley as a Miller Fellow, and then was a member of the faculty at the University of Washington from 2002 to 2009. His primary area of research is computer science, and in particular on error-correcting codes. During 2007–2008, he visited the Institute for Advanced Study as a Member of School of Mathematics. He also visited SCS at Carnegie Mellon University during 2008–09 as a visiting faculty. From July 2009 through December 2020 he was a faculty member in the Computer Science Department in the School of Computer Science at Carnegie Mellon University.
Richard Ryan Williams, known as Ryan Williams, is an American theoretical computer scientist working in computational complexity theory and algorithms.
Toniann Pitassi is a Canadian-American mathematician and computer scientist specializing in computational complexity theory. She is currently Jeffrey L. and Brenda Bleustein Professor of Engineering at Columbia University and was Bell Research Chair at the University of Toronto.
Hans Leo Bodlaender is a Dutch computer scientist, a professor of computer science at Utrecht University. Bodlaender is known for his work on graph algorithms and parameterized complexity and in particular for algorithms relating to tree decomposition of graphs.
Mihai Pătrașcu was a Romanian-American computer scientist at AT&T Labs in Florham Park, New Jersey, USA.
The EATCS–IPEC Nerode Prize is a theoretical computer science prize awarded for outstanding research in the area of multivariate algorithmics. It is awarded by the European Association for Theoretical Computer Science and the International Symposium on Parameterized and Exact Computation. The prize was offered for the first time in 2013.
András Sebő is a Hungarian-French mathematician working in the areas of combinatorial optimization and discrete mathematics. Sebő is a French National Centre for Scientific Research (CNRS) Director of Research and the head of the Combinatorial Optimization. group in Laboratory G-SCOP, affiliated with the University of Grenoble and the CNRS.
Fedor V. Fomin is a professor of Computer Science at the University of Bergen. He is known for his work in algorithms and graph theory. He received his PhD in 1997 at St. Petersburg State University under Nikolai Nikolaevich Petrov.
Mark Braverman is an Israeli mathematician and theoretical computer scientist. He was awarded an EMS Prize in 2016 as well as Presburger Award in the same year. In 2019, he was awarded the Alan T. Waterman Award. In 2022, he won the IMU Abacus Medal.
Patricia Bouyer-Decitre is a French theoretical computer scientist known for her research on timed automata, model checking, and temporal logic. She is a senior researcher for the French National Centre for Scientific Research (CNRS), and director of the Laboratoire Méthodes Formelles of CNRS and the École normale supérieure Paris-Saclay.
Xi Chen is a computer scientist. He is a professor of computer science at Columbia University. Chen won the 2021 Gödel Prize and Fulkerson Prize for his co-authored paper "Complexity of Counting CSP with Complex Weights" with Jin-Yi Cai.
Mary Katherine Wootters is an American coding theorist, information theorist, and theoretical computer scientist. She is an assistant professor of computer science and electrical engineering and a member of the Institute for Computational and Mathematical Engineering at Stanford University.
Vera Traub is a German applied mathematician and theoretical computer scientist known for her research on approximation algorithms for combinatorial optimization problems including the travelling salesperson problem and the Steiner tree problem. She is a junior professor in the Institute for Discrete Mathematics at the University of Bonn.
