<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>Prizes on ACM SIGACT</title>
    <link>https://sigact.org/prizes.html</link>
    <description>Recent content in Prizes on ACM SIGACT</description>
    <generator>Hugo</generator>
    <language>en-us</language>
    <lastBuildDate>Fri, 01 Aug 2025 00:00:00 +0000</lastBuildDate>
    <atom:link href="https://sigact.org/prizes/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Gödel Prize</title>
      <link>https://sigact.org/prizes/g%C3%B6del.html</link>
      <pubDate>Wed, 05 Jan 2022 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/g%C3%B6del.html</guid>
      <description>Gödel Prize The 2025 Gödel Prize has been awarded to Eshan Chattopadhyay and David Zuckerman.&#xA;About the Prize The Gödel Prize for outstanding papers in the area of theoretical computer science is sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and the Special Interest Group on Algorithms and Computation Theory of the Association for Computing Machinery (ACM SIGACT). This award is presented annually, with the presentation taking place alternately at the EATCS International Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Theory of Computing (STOC).</description>
    </item>
    <item>
      <title>Gödel Prize Ad Hoc Committee</title>
      <link>https://sigact.org/prizes/g%C3%B6del/adhoc.html</link>
      <pubDate>Sat, 31 Dec 2016 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/g%C3%B6del/adhoc.html</guid>
      <description>Gödel Prize Ad Hoc Committee The new (November 2004) eligibility rules for the 2004 Gödel Prize were recommended by the following ad hoc committee:&#xA;Giorgio Ausiello, Universita di Roma &amp;ldquo;La Sapienza&amp;rdquo; László Babai, University of Chicago Pierre-Louis Curien, Universite Paris 7 Hal Gabow, University of Colorado, Boulder (SIGACT Chair) Zvi Galil, Columbia University, New York Juhani Karhumaki, University of Turku, Finland Mogens Nielsen, University of Aarhus, Denmark (EATCS President) John Reif, Duke University Jeffrey Ullman, Stanford University Paul Vitanyi, CWI, Amsterdam </description>
    </item>
    <item>
      <title>Trevisan Award</title>
      <link>https://sigact.org/prizes/trevisan.html</link>
      <pubDate>Fri, 01 Aug 2025 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/trevisan.html</guid>
      <description>Trevisan Award The Luca Trevisan Award for Expository Work is intended to promote and recognize high-impact work expositing ideas and results from the Theory of Computation. The exposition can have various target audiences, e.g. people in this field, people in adjacent or remote academic fields, as well as the general public. The form of exposition can vary, and can include books, surveys, lectures, course materials, video, audio (e.g. podcasts), blogs and other media products.</description>
    </item>
    <item>
      <title>Knuth Prize</title>
      <link>https://sigact.org/prizes/knuth.html</link>
      <pubDate>Mon, 17 May 2021 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/knuth.html</guid>
      <description>Knuth Prize The Donald E. Knuth Prize for outstanding contributions to the foundations of computer science is awarded for major research accomplishments and contributions to the foundations of computer science over an extended period of time. The Prize is awarded annually by the ACM Special Interest Group on Algorithms and Computation Theory (SIGACT) and the IEEE Technical Committee on the Mathematical Foundations of Computing (TCMF).&#xA;Nomination Procedure.&#xA;Anyone in the Theoretical Computer Science community may nominate a candidate.</description>
    </item>
    <item>
      <title>SIGACT Distinguished Service Award</title>
      <link>https://sigact.org/prizes/service.html</link>
      <pubDate>Thu, 15 Jun 2017 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/service.html</guid>
      <description>SIGACT Distinguished Service Award The Theory community benefits in many ways from the dedicated service, above and beyond the call of duty, of many of its members. Among other contributions, the field&amp;rsquo;s members underpin the operation of conferences, journals, prizes, funding agencies, and other community activities, help ensure funding for the field, and promote the recognition of the field by external communities. The SIGACT Distinguished Service Award is intended to recognize and promote their contributions, as well as to raise awareness of the need for and importance of such service, for the health of our community.</description>
    </item>
    <item>
      <title>Danny Lewin Best Student Paper Award</title>
      <link>https://sigact.org/prizes/student.html</link>
      <pubDate>Mon, 17 May 2021 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/student.html</guid>
      <description>Danny Lewin Best Student Paper Award SIGACT awards a prize for the best student paper each year at the ACM Symposium on Theory of Computing, as judged by the Program Committee. A prize of $500 will be given to the author(s) of the best student-authored paper (or split between more than one paper if there is a tie). A paper is eligible if all of its authors are full-time students at the time of submission.</description>
    </item>
    <item>
      <title>Remarks made by Tom Leighton to commemorate the naming of the STOC Best Student Paper Award in honor of the late Daniel Lewin</title>
      <link>https://sigact.org/prizes/student/remarks.html</link>
      <pubDate>Sat, 31 Dec 2016 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/student/remarks.html</guid>
      <description>Remarks made by Tom Leighton to commemorate the naming of the STOC Best Student Paper Award in honor of the late Daniel Lewin May 19, 2002. Montreal, Canada.&#xA;Danny Lewin grew up in Denver, Colorado. At the age of 14, he moved with his family to Jerusalem. After graduating from high school, Danny joined the Israeli Defense Forces. During his three years in the army, Danny applied for and was selected into one of the IDF&amp;rsquo;s most challenging and elite army units, where he was promoted to the rank of Captain.</description>
    </item>
    <item>
      <title>STOC Best Paper Award</title>
      <link>https://sigact.org/prizes/best_paper.html</link>
      <pubDate>Sat, 19 Feb 2022 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/best_paper.html</guid>
      <description>STOC Best Paper Award The following rules for the Best Paper Award at the ACM Symposium on Theory of Computing (STOC) were developed by a committee consisting of Paul Beame, David Johnson, Prabhakar Raghavan, Eva Tardos and David Williamson (Chair). The committee developed the policy for FOCS. The same policy was adopted for STOC by the SIGACT Executive Committee, as announced in the STOC 2002 Business Meeting.&#xA;The Program Committee may designate up to four papers accepted to the conference as STOC Best Papers.</description>
    </item>
    <item>
      <title>STOC Test of Time Award</title>
      <link>https://sigact.org/prizes/stoc_tot.html</link>
      <pubDate>Wed, 08 Mar 2023 00:00:00 +0000</pubDate>
      <guid>https://sigact.org/prizes/stoc_tot.html</guid>
      <description>STOC Test of Time Award The 2026 STOC Test of Time Award recognizes papers published in the Proceedings of the Annual ACM Symposium on Theory of Computing. This is the sixth year of this annual award. There are three awards, targeting the STOC conferences 10, 20, and 30 years prior to the year in which the award is given. While there is a preference for papers in the target years (and nominations from those years are encouraged), in each of these award categories it is also possible to nominate STOC conference papers published up to four conferences earlier than the targeted conference.</description>
    </item>
  </channel>
</rss>
