This article includes a list of general references, but it lacks sufficient corresponding inline citations .(January 2011) |
The European Association for Theoretical Computer Science (EATCS [1] ) 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.
The major activities of the EATCS are:
Each year, the EATCS Award [6] is awarded in recognition of a distinguished career in theoretical computer science. The first award was assigned to Richard Karp in 2000; the complete list of the winners is given below:
Year | Awarded | Place |
---|---|---|
2023 | Amos Fiat | ICALP (Paderborn) |
2022 | Patrick Cousot | ICALP (Paris) |
2021 | Toniann Pitassi | ICALP (Glasgow) |
2020 | Mihalis Yannakakis | ICALP (Saarbrücken) |
2019 | Thomas Henzinger | ICALP (Patras) |
2018 | Noam Nisan | ICALP (Prague) |
2017 | Éva Tardos | ICALP (Warsaw) |
2016 | Dexter Kozen | ICALP (Rome) |
2015 | Christos Papadimitriou | ICALP (Kyoto) |
2014 | Gordon Plotkin | ICALP (Copenhagen) |
2013 | Martin Dyer | ICALP (Riga) |
2012 | Moshe Vardi | ICALP (Warwick) |
2011 | Boris Trakhtenbrot | ICALP (Zurich) |
2010 | Kurt Mehlhorn | ICALP (Bordeaux) |
2009 | Gérard Huet | ICALP (Rhodes) |
2008 | Leslie G. Valiant | ICALP (Reykjavík) |
2007 | Dana S. Scott | ICALP (Wroclaw) |
2006 | Mike Paterson | ICALP (Venice) |
2005 | Robin Milner | ICALP (Lisboa) |
2004 | Arto Salomaa | ICALP (Turku) |
2003 | Grzegorz Rozenberg | ICALP (Eindhoven) |
2002 | Maurice Nivat | ICALP (Málaga) |
2001 | Corrado Böhm | ICALP (Creta) |
2000 | Richard Karp | ICALP (Geneva) |
Starting in 2010, the European Association of Theoretical Computer Science (EATCS) confers each year at the conference ICALP the Presburger Award to a young scientist (in exceptional cases to several young scientists) for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers. The award is named after Mojzesz Presburger who accomplished his path-breaking work on decidability of the theory of addition (which today is called Presburger arithmetic) as a student in 1929. The complete list of the winners [7] is given below:
Year | Awarded | Place |
---|---|---|
2021 | Shayan Oveis Gharan | ICALP (Glasgow) |
2020 | Dmitriy Zhuk | ICALP (Saarbrücken/online) |
2019 | Karl Bringmann, Kasper Green Larsen | ICALP (Patras) |
2018 | Aleksander Mądry | ICALP (Prague) |
2017 | Alexandra Silva | ICALP (Warsaw) |
2016 | Mark Braverman | ICALP (Rome) |
2015 | Xi Chen | ICALP (Kyoto) |
2014 | David Woodruff | ICALP (Copenhagen) |
2013 | Erik Demaine | ICALP (Riga) |
2012 | Venkatesan Guruswami, Mihai Patrascu | ICALP (Warwick) |
2011 | Patricia Bouyer-Decitre | ICALP (Zurich) |
2010 | Mikołaj Bojańczyk | ICALP (Bordeaux) |
The EATCS Fellows Program [8] has been 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.
Awarded | Recognized Year |
---|---|
Luca Aceto | 2021 |
Jiri Adamek | 2018 |
Susanne Albers | 2014 |
Rajeev Alur | 2021 |
Giorgio Ausiello | 2014 |
Wilfried Brauer | 2014 |
Artur Czumaj | 2015 |
Pierpaolo Degano | 2020 |
Mariangiola Dezani-Ciancaglini | 2015 |
Josep Diaz | 2017 |
Herbert Edelsbrunner | 2014 |
Zoltán Ésik | 2016 |
Mike Fellows | 2014 |
Fedor Fomin | 2019 |
Yuri Gurevich | 2014 |
Mohammad Hajiaghayi | 2020 |
Magnús M. Halldórsson | 2020 |
David Harel | 2016 |
Monika Henzinger | 2014 |
Thomas A. Henzinger | 2015 |
Giuseppe F. Italiano | 2016 |
Samir Khuller | 2021 |
Dexter Kozen | 2015 |
Marta Kwiatkowska | 2017 |
Stefano Leonardi | 2018 |
Kurt Mehlhorn | 2016 |
Rocco de Nicola | 2019 |
David Peleg | 2021 |
Jean-Éric Pin | 2014 |
Dana Ron | 2019 |
Davide Sangiorgi | 2021 |
Saket Saurabh | 2021 |
Scott A. Smolka | 2016 |
Paul Spirakis | 2014 |
Aravind Srinivasan | 2017 |
Wolfgang Thomas | 2014 |
Moshe Y. Vardi | 2015 |
Moti Yung | 2017 |
This section needs expansion. You can help by adding to it. (September 2011) |
The EATCS Bulletin is a newsletter of the EATCS, published online three times annually in February, June, and October respectively. The Bulletin is a medium for rapid publication and wide distribution of material such as:
Since 2021 its editor-in-chief has been Stefan Schmid (TU Berlin).
Beginning in 2014, the European Association for Theoretical Computer Science (EATCS) established a series of Young Researcher Schools on TCS topics. A brief history of the schools follows below.
Year | Type | Place |
---|---|---|
2017 | ProbProgSchool 2017 – 1st School on Foundations of Programming and Software systems. Probabilistic programming | Braga, Portugal |
2015 | 2nd EATCS Young Researchers School – Understanding COMPLEXITY and CONCURRENCY through TOPOLOGY of DATA | Camerino, Italy |
2014 | 1st EATCS Young Researchers School – Automata, Logic and Games | Telč, Czech Republic |
Professor Dines Bjørner is a Danish computer scientist.
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.
Christos Charilaos Papadimitriou is a Greek theoretical computer scientist and the Donovan Family Professor of Computer Science at Columbia University.
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.
Arto K. 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.
Kurt Mehlhorn is a German theoretical computer scientist. He has been a vice president of the Max Planck Society and is director of the Max Planck Institute for Computer Science.
Michael Stewart Paterson, is a British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007, and chair of the department of computer science in 2005.
Michael Ralph Fellows AC HFRSNZ MAE is a computer scientist and the Elite Professor of Computer Science in the Department of Informatics at the University of Bergen, Norway as of January 2016.
Wilfried Brauer was a German computer scientist and professor emeritus at Technical University of Munich.
Grzegorz Rozenberg is a Polish and Dutch computer scientist.
Maurice Paul Nivat was a French computer scientist. His research in computer science spanned the areas of formal languages, programming language semantics, and discrete geometry. A 2006 citation for an honorary doctorate (Ph.D.) called Nivat one of the fathers of theoretical computer science. He was a professor at the University Paris Diderot until 2001.
Richard Ryan Williams, known as Ryan Williams, is an American theoretical computer scientist working in computational complexity theory and algorithms.
The Presburger Award, started in 2010, is awarded each year by the European Association for Theoretical Computer Science (EATCS) to "a young scientist for outstanding contributions in theoretical computer science, documented by a published paper or a series of published papers." The award is named after Mojżesz Presburger who accomplished his path-breaking work on decidability of the theory of addition as a student in 1929.
Hans-Jörg Kreowski is a professor for computer science at the University of Bremen in North West Germany. His primary research area is theoretical computer science with an emphasis on graph transformation, algebraic specification, and syntactic picture processing. He is also a member of the Forum of Computer Scientists for Peace and Social Responsibility (FIfF).
Prakash Panangaden is an American/Canadian computer scientist noted for his research in programming language theory, concurrency theory, Markov processes and duality theory. Earlier he worked on quantum field theory in curved space-time and radiation from black holes. He is the founding Chair of the ACM Special Interest Group on Logic and Computation.
Mohammad Taghi Hajiaghayi is a computer scientist known for his work in algorithms, game theory, social networks, network design, graph theory, and big data. He has over 200 publications with over 185 collaborators and 10 issued patents.
Mikołaj Bojańczyk is a Polish theoretical computer scientist and logician known for settling open problems on tree walking automata jointly with Thomas Colcombet, and for contributions to logic in automata theory. He is a professor at Warsaw University.
Alexandra Silva is a Portuguese computer scientist and Professor at Cornell University. She was previously Professor of Algebra, Semantics, and Computation at University College London.
Xi Chen is a computer scientist. He is an associate 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.