Serving as a program director at the NSF is one of the most impactful ways of serving the TCS community. The Algorithmic Foundations Program in NSF/CISE/CCF is currently accepting applications for a permanent Program Director position. Please consider applying!
Apply here by January 12. Feel free and encouraged to contact the AF group (Tracy Kimbrel, Peter Brass, Funda Ergun) for information.
From chair of the committee, Dan Spielman:
Nominations are now being accepted for the National Academy of Sciences’ 2023 Michael and Sheila Held Prize. The Held Prize honors outstanding, innovative, creative, and influential research in the areas of combinatorial and discrete optimization, or related parts of computer science, such as the design and analysis of algorithms and complexity theory. This $100,000 prize is intended to recognize recent work (defined as published within the last eight years). Additional information, including past recipients, eligibility requirements, and more, can be found at http://www.nasonline.org/held
All nominations must be submitted online. Unless otherwise stated, the following materials must be submitted:
Nominations will be accepted through Monday, October 3, 2022. Please help spread the word that the nomination process is underway.
Call for Participation
54th ACM Symposium on Theory of Computing (STOC 2022) – Theory Fest
June 20-24, 2022
Rome, Italy
The 54th ACM Symposium on Theory of Computing (STOC 2022) is sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and will be held in Rome, Italy, Monday June 20 – Friday, June 24, 2022.
STOC 2022 – Theory Fest will feature technical talk sessions, 6 workshops with introductory tutorials, poster sessions, social events, and a special joint session with “Accademia Nazionale dei Lincei”, the oldest and most prestigious Italian academic institution, followed by a reception and a concert at the Academy historic site.
Registration
STOC 2022 registration is available here.
Early registration deadline: April 30th.
Student Travel Grants
Information for student travel grant applications is available here.
Application deadline: April 20th.
STOC 2022 is sponsored by Algorand, Amazon, Apple, Google, IOHK, Microsoft, Sapienza University of Rome.
The 2022 STOC Test of Time Award recognizes papers published in the Proceedings of the Annual ACM Symposium on Theory of Computing. This is the second 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. Thus, the 2022 STOC Test of Time Awards will be for papers presented at the STOC conferences in 2008-2012, 1998-2002, and 1988-1992. The awards, which will be presented at STOC 2022, include a prize of US $500 per author as well as complimentary registration for all authors who attend the conference at which the award is given.
Nominations should be sent to stoc22.tot.award@gmail.com with a subject line of “STOC Test of Time Award” no later than April 30, 2022. Nominations should contain an explanation of the impact of the nominated paper(s), including references to follow-on work. A nomination may be accompanied by up to three additional endorsement letters, which may be sent by the endorsers directly to the same email address with the same subject line. Self-nominations are disallowed.
The winners will be selected by a committee appointed by the SIGACT Executive Committee. For 2022 the selection committee consists of Toniann Pitassi (Columbia), Satish Rao (Berkeley), Salil Vadhan (Harvard, chair), Avi Wigderson (Institute for Advanced Study).
In selecting the Test of Time Award winners, the Committee will pay particular attention to long-term impact. This impact can come in many forms, including but not limited to:
The committee expects to select exactly one paper for each award. However, when circumstances justify it, up to three may be selected. The committee may consider papers that were not explicitly nominated and gather additional input from experts, but formal nominations are extremely helpful in the committee’s deliberations and strongly encouraged.
Deadline: March 31, 2022.
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 ACMSpecial Interest Group on Algorithms and Computation Theory (SIGACT) and the IEEETechnical Committee on the Mathematical Foundations of Computing (TCMF).
Nomination Procedure. Anyone in the Theoretical Computer Science community may nominate a candidate. To do so, please send nominations to knuth.prize.2022@gmail.com by March 31, 2022. The nomination should state the nominee’s name, summarize their contributions in one or two pages, provide a CV for the nominee or a pointer to the nominee’s web page, and give telephone and email contact information for the nominator. Any supporting letters from other members of the community (up to a limit of 5) should be included in the package that the nominator submits. Supporting letters should contain substantial information not in the nomination. Others may endorse the nomination simply by adding their names to the nomination letter. If you have nominated a candidate in past years, you can re-nominate the candidate by sending a message to that effect to the above email address. (You may revise the nominating materials if you so desire.)
Criteria for Selection. The winner is selected by a Prize Committee consisting of six people appointed by the SIGACT and TCMF Chairs, see below for the composition of the committee.
Previous nominations made or updated in the last 5 years will be considered. Older nominations must be updated for consideration. Note that the Knuth Prize is awarded to a single individual each year. Nominations of groups of researchers will not be considered.
In selecting the Knuth Prize winner, the Committee pays particular attention to a sustained record of high-impact, seminal contributions to the foundations of computer science. The selection may also be based partly on educational accomplishments and contributions such as fundamental textbooks and high-quality students. The award is not given for service to the theoretical computer science community, but service may be included in the citation for a winner if appropriate.
The 2022 prize committee consists of Harold Gabow (U. Colorado), Monika Henzinger (U. Vienna), Kurt Mehlhorn (Max Planck Institute), Dana Randall (Chair, Georgia Tech), Madhu Sudan (Harvard U.), and Andy Yao (Tsinghua U.).
Deadline for nominations extended to March 31st 2022.
https://www.sigact.org/prizes/g%C3%B6del.html
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 International Colloquium on Automata, Languages, and Programming (ICALP) and the ACM Symposium on Theory of Computing (STOC). The thirtieth Gödel Prize will be awarded at the forty-ninth International Colloquium on Automata, Languages and Programming (ICALP), which will be hybrid, happening both physically and virtually. The physical meeting will take place in Paris, France, July 4–8 2022.
The Prize is named in honor of Kurt Gödel in recognition of his major contributions to mathematical logic and of his interest, discovered in a letter he wrote to John von Neumann shortly before von Neumann’s death, in what has become the famous “P versus NP” question. The Prize includes an award of USD 5,000.
Award Committee
The 2022 Award Committee consists of Samson Abramsky (Chair, University College London), Nikhil Bansal (University of Michigan), Irit Dinur (Weizmann Institute), Anca Muscholl (University of Bordeaux), Ronitt Rubinfeld (Massachusetts Institute of Technology), and David Zuckerman (University of Texas at Austin).
Eligibility
The 2022 Prize rules are given below and they supersede any different interpretation of the generic rule to be found on websites of both SIGACT and EATCS. Any research paper or series of papers by a single author or by a team of authors is deemed eligible if:
• The main results were not published (in either preliminary or final form) in a journal or conference proceedings before January 1, 2009.
• The paper was published in a recognized refereed journal no later than December 31, 2021.
The research work nominated for the award should be in the area of theoretical computer science. Nominations are encouraged from the broadest spectrum of the theoretical computer science community so as to ensure that potential award winning papers are not overlooked. The Award Committee shall have the ultimate authority to decide whether a particular paper is eligible for the Prize.
Nominations
Nominations for the award should be submitted by email to the Award Committee Chair: s.abramsky@ucl.ac.uk. Please make sure that the Subject line of all nominations and related messages begin with “Goedel Prize 2022”. To be considered, nominations for the 2022 Prize must be received by March 31, 2022.
A nomination package should include:
• A printable copy (or copies) of the journal paper(s) being nominated, together with a complete citation (or citations) thereof.
• A statement of the date(s) and venue(s) of the first conference or workshop publication(s) of the nominated work(s) or a statement that no such publication has occurred.
• A brief summary of the technical content of the paper(s) and a brief explanation of its significance.
• A support letter or letters signed by at least two members of the scientific community.
Additional support letters may also be received and are generally useful. The nominated paper(s) may be in any language. However, if a nominated publication is not in English, the nomination package must include an extended summary written in English.
Those intending to submit a nomination should contact the Award Committee Chair by email well in advance. The Chair will answer questions about eligibility, encourage coordination among different nominators for the same paper(s), and also accept informal proposals of potential nominees or tentative offers to prepare formal nominations. The committee maintains a database of past nominations for eligible papers, but fresh nominations for the same papers (especially if they highlight new evidence of impact) are always welcome.
From the SIGACT executive committee:
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’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. The award is given annually to an individual or group who has made substantial service contributions to the Theoretical Computer Science community.
Eligibility
The award can be given to an individual or a group of individuals, for a single contribution or for a series of contributions over a career. All living individuals are eligible with the exception of the sitting SIGACT Chair, an individual or a group of individuals who nominated a majority of the current selection committee members, or a member of the current selection committee.
Deadline for Nominations
This year’s nomination deadline is March 21, 2022, 11:59 EDT.
Please see the full call at the SIGACT website at https://www.sigact.org/prizes/service.html for more information.
We are grateful to Paul Beame, Dieter van Melkebeek, and Rebecca Wright (chair) who have kindly agreed to serve as the selection committee.
The Theory Fest workshops committee is soliciting proposals for workshops. Workshops will be held during the STOC conference week, June 20-24, 2022. The (updated) deadline for submitting proposals is Feb 15, 2022. Details on how to submit a proposal can be found at http://acm-stoc.org/stoc2022/callforworkshops.html.
The Computing Research Association (CRA) and Computing Community Consortium (CCC) have announced a new CI Fellows program that will offer 2 year postdoctoral opportunities in computing starting Fall’20.
The deadline for application is yet to be announced but will be around mid-June 2020, with decisions being made around mid-July 2020 for positions beginning this fall or winter. We will update this post once a deadline is announced. In the meantime, further details can be found at https://cifellows2020.org/.
Prof. David Shmoys is chairing the committee to identify a new Editor-in-Chief for ACM Trans. on Algorithms. The deadline for nominations is Jun 8th. Please see details below.
ACM TALG (webpage: http://talg.acm.org/) publishes original research of the highest quality dealing with algorithms. It is a peer-reviewed journal, appearing quarterly. Specific areas of computation covered by the journal are listed at http://talg.acm.org/Aims.html.
We are looking for a well-established person with a strong record of research achievements and service, and with a vision for the future of the field. The term of appointment is three years, to begin late summer 2020, with the possibility of renewal for a second term. The editor-in-chief is responsible for faithfully executing the editorial charter of the journal yet should be proactive in adapting the journal and its charter to changes in the field. A description of the duties of the EiC and evaluation criteria can be found at http://www.acm.org/publications/policies/evaluation.
The Search Committee members are:
David Eppstein – University of California, Irvine
Anna Karlin – University of Washington
Chris Hankin – Imperial College London – ACM Publications Board Liaison
Dana Randall – Georgia Institute of Technology
David Shmoys – Cornell University – Committee Chair.
All nominees, including self-nominees, should send a CV and a Vision Statement for TALG (at least one page), with subject header “EiC nomination” to the committee chair – david.shmoys@cornell.edu .
The deadline for nominations is Monday, June 8, 2020 at 11:59 p.m. (EST).
Theory Matters