The Salomaa Prize - Call for nominations
The Salomaa Prize in Automata Theory, Formal Languages, and Related Topics is awarded annually at the conference DLT (Developments in Language Theory). It consists of the diploma and the prize of 2000 Euros donated by the University of Turku. The award is given to a distinguished researcher for their fundamental achievements in automata theory and related topics.
The achievement might be a single article, a series of articles, or broader impact on the theory. The main criterion is the scientific excellence of the work.
The Salomaa Prize 2025 will be awarded at DLT 2025 in Seoul, Korea.
The deadline for nomination is February 28 2025. Nominations, which consist of a description of the nominee's work and rationale for the award, signed by at least two recognized researchers, should be sent by electronic mail to the chair of the selection committee: Jeffrey Shallit, University of Waterloo,
This e-mail address is being protected from spambots. You need JavaScript enabled to view it
For all further information, see the guidelines on the Salomaa Prize website: https://math.utu.fi/salomaaprize/ |
|
EATCS Bulletin Issue 144 is available online
The 144th issue of the EATCS Bulletin, is now available online at http://bulletin.eatcs.org/index.php/beatcs/index featuring
- Know the Person behind the Papers Today: Bruce Maggs - The Interview Column by Chen Avin and Stefan Schmid
- The role of an invited speaker at a conference - Luca Aceto, The Viewpoint Column by Stefan Schmid
- Promoting Theoretical Computer Science on Social Media, A Conversation with Clément Canonne - TCS on the Web by Stefan Neumann
- Minimal Requirements for Bit-Dissemination with Passive Communication - Robin Vacus, The Distributed Computing Column by Seth Gilbert
- Seven Ways of Deciding Whether Most Vertex Sets Cover a Graph - Till Tantau, The Computational Complexity Column by Michal Koucky ́
- Teaching Design of Algorithms in High Schools by Constructive Induction - Juraj Hromkovic, Regula Lacher, The Education Column by Dennis Komm and Thomas Zeume
- On a measure of intelligence - Yuri Gurevich, The Logic in Computer Science Column by Yuri Gurevich
|
|
Read more...
|
EATCS-IPEC Nerode Prize 2024
The EATCS-IPEC Nerode Prize 2024 for outstanding papers in the area of multivariate algorithmics is awarded to
Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, and Dimitrios M. Thilikos
for their paper
(Meta) Kernelization. J. ACM 63(5): 44:1-44:69 (2016), announced at Foundations of Computer Science (FOCS) 2010.
|
|
Read more...
|
2024 Alonzo Church Award for Outstanding Contributions to Logic and Computation
The European Association for Computer Science Logic (EACSL), the European Association for Theoretical Computer Science (EATCS), and the ACM Special Interest Group for Logic and Computation (SIGLOG) are pleased to announce that the 2024 Alonzo Church Award for Outstanding Contributions to Logic and Computation is presented jointly to
Thomas Ehrhard and Laurent Regnier
for giving a logical and computational account of differentiation, bringing Taylor expansion to the Curry-Howard correspondence, which had a major impact on programming language semantics.
|
|
Read more...
|
EATCS honours three outstanding PhD theses with the EATCS Distinguished Dissertation Award for 2023
EATCS is proud to announce that, after examining the nominations received from our research community, the EATCS Distinguished Dissertation Award Committee 2023, consisting of Nikhil Bansal (chair), Petra Berenbrink, Jaroslav Nešetřil, Damian Niwiński, Vladimiro Sassone, Alexandra Silva, David Woodruff and Standa Zivny has selected the following three theses as recipients of the EATCS Distinguished Dissertation Award for 2023:
|
|
Read more...
|
Presburger Award 2024 – Laudatio
The 2024 Presburger Award Committee has chosen Justin Hsu and Pravesh Kothari as joint recipients of the 2024 EATCS Presburger Award for Young Scientists.
|
|
Read more...
|
The 2024 Gödel Prize
The 2024 Gödel Prize is awarded for the following paper:
Ryan Williams: Non-Uniform ACC Circuit Lower Bounds.
Computational Complexity Conference (CCC) 2011.
Journal of the ACM 61(1):1–32 (2014)
|
|
Read more...
|
|
|
|
|
<< Start < Prev 1 2 3 4 5 6 7 8 9 10 Next > End >>
|
|
Page 6 of 68 |