{"id":84,"date":"2025-01-31T19:43:36","date_gmt":"2025-01-31T19:43:36","guid":{"rendered":"https:\/\/focs.computer.org\/2025\/call-for-papers\/"},"modified":"2025-06-09T01:22:51","modified_gmt":"2025-06-09T01:22:51","slug":"call-for-papers","status":"publish","type":"page","link":"https:\/\/focs.computer.org\/2025\/call-for-papers\/","title":{"rendered":"Call For Papers"},"content":{"rendered":"\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Overview and Call for Papers<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\tThe 66th Annual Symposium on Foundations of Computer Science (FOCS 2025), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in Sydney, Australia, December 14-17<\/b>. Information about previous conferences can be found at the FOCS Conference Archive<\/a>.\n
Papers presenting new and original research on theory of computation are sought. Typical but not exclusive topics of interest include: algorithmic coding theory, algebraic computation, algorithmic graph theory, algorithmic game theory, algorithms and data structures, analysis of Boolean functions, approximation algorithms, average-case complexity, computational applications of logic, combinatorics, computational complexity, communication complexity, circuit complexity, combinatorial optimization, computational game theory, computational geometry, computational learning theory, continuous optimization, cryptography, foundations of machine learning, online algorithms, optimization, parallel and distributed algorithms, parameterized algorithms, randomized algorithms, sublinear algorithms, streaming algorithms, quantum computing, pseudorandomness and derandomization, foundations of fairness and privacy, and theoretical aspects of areas such as networks, information retrieval, computational biology, and databases. Papers that broaden the reach of the theory of computing, or raise important problems that can benefit from theoretical investigation and analysis, are encouraged.<\/div>\n
<\/div>\n
Please submit using this link: https:\/\/focs25.hotcrp.com\/<\/a><\/del> (The submission deadline has now passed)<\/div>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t
\n\t\t\t\t\t
\n\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Important dates<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t\n\n\n\n\n
\n

Submission deadline<\/p>\n<\/td>\n

\n

April 3, 2025 at 8PM ET<\/p>\n<\/td>\n<\/tr>\n

\n

Paper notification<\/p>\n<\/td>\n

\n

July 8, 2025<\/p>\n<\/td>\n<\/tr>\n

\n

Conference dates<\/p>\n<\/td>\n

\n

December 14\u201317, 2025<\/p>\n<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Submission format<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Full submissions, submitted by the full paper submission deadline, should contain the abstract and the complete paper. The abstract should summarize the paper\u2019s contributions. There is no page limit and authors are encouraged to use the \u201cfull version\u201d of their paper as the submission. The submission should contain, within the initial ten pages following the title page, a clear presentation of the merits of the paper, including a discussion of the paper\u2019s importance within the context of prior work and a description of the key technical and conceptual ideas used to achieve its main claims. The submission should be addressed to a broad spectrum of theoretical computer science researchers. Proofs must be provided which can enable the main mathematical claims of the paper to be fully verified. Although there is no bound on the length of a submission, material other than the abstract, references, and the first ten pages will be read at the committee\u2019s discretion. Authors<\/p>

are encouraged to put the references at the very end of the submission. The submission should be typeset using 11-point or larger fonts, in a single-column, single-space (between lines) format with ample spacing throughout and 1-inch margins all around, on letter-size (8 1\/2 x 11 inch) paper. Submissions deviating significantly from these guidelines risk rejection without consideration of their merits.<\/p>

FOCS 2025 will use double-blind reviewing<\/strong>, and as such, submissions should not reveal the identity of the authors in any way. In particular, authors\u2019 names, affiliations, and email addresses should not appear at the beginning or in the body of the submission. Authors should not include obvious references that reveal their own identity, and should ensure that any references to their own related work are in the third person (e.g., not \u201cWe build on our previous work \u2026\u201d<\/i> but rather \u201cWe build on the work of \u2026\u201d<\/i>).<\/p>

The purpose of this double-blind process is to help PC members and external reviewers come to an initial judgment about the paper without bias, and not to make it impossible for them to discover who the authors are if they were to try. Nothing should be done in the name of anonymity that weakens the submission or makes the job of reviewing the paper more difficult. In particular, important references should not be omitted or anonymized. In addition, authors should feel free to disseminate their ideas or draft versions of their paper as they normally would. For example, authors may post drafts of their papers on the web, submit them to arXiv, and give talks on their research ideas.<\/p>

Submissions by PC members (other than the PC chairs) are allowed. If any of the authors of a submission is a PC member, this should be indicated in the submission form by checking the corresponding box.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

\n\t\t\t\t\t\t
\n\t\t\t\t\t
\n\t\t\t
\n\t\t\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t

Submission instructions<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t
<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
\n\t\t\t\t
\n\t\t\t\t\t\t\t\t\t

Authors are required to submit their papers electronically, in PDF (without security restrictions on copying or printing). Please submit using this link: https:\/\/focs25.hotcrp.com\/<\/a><\/p>

The submission process will include a declaration of conflicts of interest, to help manage the double-blind review process. This information can only be seen by the program committee chair and thus cannot be used by the rest of the program committee to deanonymize authors. Please only include conflicts of interest as defined by SafeToC<\/a>:<\/p>

  1. Family member or close friend.<\/li>
  2. Ph.D. advisor or advisee (no time limit), or postdoctoral or undergraduate mentor or mentee within the past five years.<\/li>
  3. Person with the same affiliation.<\/li>
  4. Person involved in an alleged incident of harassment. (It is not required that the incident be reported.)<\/li>
  5. Reviewer owes author a favor (e.g., recently requested a reference letter).<\/li>
  6. Frequent or recent collaborator (within the last 2 years) whom you believe cannot objectively review your work.<\/li><\/ol>

    If an author believes that they have a valid reason for a conflict of interest not listed above, then they can contact the PC chair or any ToC advocate affiliated with this conference directly (as listed on the front page<\/a>). Note that if the program chair has reason to doubt the validity of the claim of conflict of interest, then they may request that a ToC advocate confidentially verify the reason for the conflict. If authors are uncertain, they are encouraged to email the PC chair or a ToC advocate. The submission software asks for conflicts with PC members, and in addition contains a text form in which one can declare additional conflicts.<\/p>

    Authors are encouraged to also make full versions of their submissions freely accessible in an online repository such as the arXiv<\/a>, ECCC<\/a>, or the Cryptology ePrint archive<\/a>. It is expected that authors of accepted papers will make their full papers, with proofs, publicly available by the camera-ready deadline.<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

    \n\t\t\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t

    Prior and simultaneous submission<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t

    The conference will follow SIGACT\u2019s policy on prior publication and simultaneous submissions. Work that has been previously published in another conference proceedings or journal, or which is scheduled for publication prior to December 2025, will not be considered for acceptance at FOCS 2025. Simultaneous submission of the same (or essentially the same) abstract to FOCS 2025 and to another conference with published proceedings or journal is not allowed. The program committee may interact with program chairs of other (past or future) conferences to find out about closely related submissions. Notwithstanding the above, works that were previously published or announced in another journal or conference with a significantly different format, content, and audience than FOCS might still be considered at the PC\u2019s discretion; in such cases authors should contact the program chair prior to submission. <\/span><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

    \n\t\t\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t

    Machtey Award<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t

    The Machtey award will be given to the best paper or papers written solely by one or more students. An abstract is eligible if all authors are full-time students at the time of submission. This should be indicated at the time of submission. All submissions are eligible for the Best Paper award. The committee may decide to split the awards between multiple papers, or to decline to make an award. <\/span><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

    \n\t\t\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t

    Presentation of accepted papers<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t

    One author of each accepted paper will be expected to present the work at the conference. Authors are expected to contact the program chair before submission in case insufficient travel funds, family circumstances or external travel restrictions could prevent them from attending the conference. <\/span><\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t

    \n\t\t\t\t\t\t
    \n\t\t\t\t\t
    \n\t\t\t
    \n\t\t\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t

    Program Committee<\/h2>\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t
    <\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t
    \n\t\t\t\t
    \n\t\t\t\t\t\t\t\t\t\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n
    Andris Ambainis<\/span>\u00a0<\/span><\/td>\nUniversity of Latvia<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Alexandr Andoni<\/span>\u00a0<\/span><\/td>\nColumbia University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Anurag Anshu<\/span>\u00a0<\/span><\/td>\nHarvard University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Sepehr Assadi<\/span>\u00a0<\/span><\/td>\nUniversity of Waterloo<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Ainesh Bakshi<\/span>\u00a0<\/span><\/td>\nMassachusetts Institute of Technology<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Omri Ben-Eliezer<\/span>\u00a0<\/span><\/td>\nTechnion \u2013 Israel Institute of Technology<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Elette Boyle<\/span>\u00a0<\/span><\/td>\nReichman University and NTT Research<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Niv Buchbinder<\/span>\u00a0<\/span><\/td>\nTel-Aviv University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Eshan Chattopadhyay<\/span>\u00a0<\/span><\/td>\nCornell University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Shuchi Chawla<\/span>\u00a0<\/span><\/td>\nUniversity of Texas Austin<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Shiri Chechik<\/span>\u00a0<\/span><\/td>\nTel-Aviv University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Lijie Chen<\/span>\u00a0<\/span><\/td>\nUniversity of California Berkeley<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Sitan Chen<\/span>\u00a0<\/span><\/td>\nHarvard University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Xi Chen<\/span>\u00a0<\/span><\/td>\nColumbia University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Gil Cohen<\/span>\u00a0<\/span><\/td>\nTel-Aviv University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Vincent Cohen-Addad<\/span>\u00a0<\/span><\/td>\nGoogle Research<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Costis Daskalakis<\/span>\u00a0<\/span><\/td>\nMassachusetts Institute of Technology<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Anindya De<\/span>\u00a0<\/span><\/td>\nUniversity of Pennsylvania<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Mahsa Derakhshan\u00a0\u00a0<\/span>\u00a0<\/span><\/td>\nNortheastern University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Alina Ene<\/span>\u00a0<\/span><\/td>\nBoston University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Michal Feldman<\/span>\u00a0<\/span><\/td>\nTel-Aviv University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Michael A. Forbes<\/span>\u00a0<\/span><\/td>\nUniversity of Illinois Urbana-Champaign<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Ankit Garg<\/span>\u00a0<\/span><\/td>\nMicrosoft Research<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Sumegha Garg<\/span>\u00a0<\/span><\/td>\nRutgers University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Yannai Gonczarowski<\/span>\u00a0<\/span><\/td>\nHarvard University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Elena Grigorescu<\/span>\u00a0<\/span><\/td>\nUniversity of Waterloo<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Nika Haghtalab<\/span>\u00a0<\/span><\/td>\nUniversity of California Berkeley<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Pooya Hatami<\/span>\u00a0<\/span><\/td>\nOhio State University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Sam Hopkins<\/span>\u00a0<\/span><\/td>\nMassachusetts Institute of Technology<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Michael Kapralov<\/span>\u00a0<\/span><\/td>\n\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Tali Kaufman<\/span>\u00a0<\/span><\/td>\nBar-Ilan University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Nathan Klein<\/span>\u00a0<\/span><\/td>\nBoston University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Swastik Kopparty<\/span>\u00a0<\/span><\/td>\nUniversity of Toronto<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Robin Kothari<\/span>\u00a0<\/span><\/td>\nGoogle Quantum AI<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Jason Li<\/span>\u00a0<\/span><\/td>\nCarnegie Mellon University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Nutan Limaye<\/span>\u00a0<\/span><\/td>\nIT University of Copenhagen<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Yang Liu<\/span>\u00a0<\/span><\/td>\nCarnegie Mellon University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Shachar Lovett<\/span>\u00a0<\/span><\/td>\nUniversity of California San Diego<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Fermi Ma<\/span>\u00a0<\/span><\/td>\nUniversity of California Berkeley<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Sepideh Mahabadi<\/span>\u00a0<\/span><\/td>\nMicrosoft Research<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Tal Malkin<\/span>\u00a0<\/span><\/td>\nColumbia University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Pasin Manurangsi<\/span>\u00a0<\/span><\/td>\nGoogle Research<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Dor Minzer<\/span>\u00a0<\/span><\/td>\nMassachusetts Institute of Technology<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Christopher Musco<\/span>\u00a0<\/span><\/td>\nNew York University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Alantha Newman<\/span>\u00a0<\/span><\/td>\nUniversit\u00e9 Grenoble Alpes<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Rotem Oshman (co-chair)<\/span>\u00a0<\/span><\/td>\nTel-Aviv University and New York University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Shayan Oveis Gharan<\/span>\u00a0<\/span><\/td>\nUniversity of Washington<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Omer Paneth<\/span>\u00a0<\/span><\/td>\nTel-Aviv University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Richard Peng<\/span>\u00a0<\/span><\/td>\nCarnegie Mellon University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Ran Raz (chair)<\/span>\u00a0<\/span><\/td>\nPrinceton University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Robert Robere<\/span>\u00a0<\/span><\/td>\nMcGill University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Ron Rothblum<\/span>\u00a0<\/span><\/td>\nTechnion \u2013 Israel Institute of Technology<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Sushant Sachdeva<\/span>\u00a0<\/span><\/td>\nUniversity of Toronto<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Rahul Santhanam<\/span>\u00a0<\/span><\/td>\nOxford University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Shubhangi Saraf<\/span>\u00a0<\/span><\/td>\nUniversity of Toronto<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Thatchaphol Saranurak<\/span>\u00a0<\/span><\/td>\nUniversity of Michigan<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Raghuvansh Saxena<\/span>\u00a0<\/span><\/td>\nTata Institute of Fundamental Research<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Mark Sellke<\/span>\u00a0<\/span><\/td>\nHarvard University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Vatsal Sharan<\/span>\u00a0<\/span><\/td>\nUniversity of Southern California<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Mohit Singh<\/span>\u00a0<\/span><\/td>\nGeorgia Institute of Technology<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Nicholas Spooner<\/span>\u00a0<\/span><\/td>\nCornell University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Jukka Suomela<\/span>\u00a0<\/span><\/td>\nAalto University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Ola Svensson<\/span>\u00a0<\/span><\/td>\n\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Avishay Tal<\/span>\u00a0<\/span><\/td>\nUniversity of California Berkeley<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Roei Tell<\/span>\u00a0<\/span><\/td>\nUniversity of Toronto<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Vinod Vaikuntanathan<\/span>\u00a0<\/span><\/td>\nMassachusetts Institute of Technology<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Paul Valiant<\/span>\u00a0<\/span><\/td>\nPurdue University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Thomas Vidick<\/span>\u00a0<\/span><\/td>\n\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne and The Weizmann Institute of Science<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Nicole Wein<\/span>\u00a0<\/span><\/td>\nUniversity of Michigan<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    David Woodruff<\/span>\u00a0<\/span><\/td>\nCarnegie Mellon University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Mary Wootters<\/span>\u00a0<\/span><\/td>\nStanford University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    John Wright<\/span>\u00a0<\/span><\/td>\nUniversity of California Berkeley<\/span>\u00a0<\/span><\/td>\n<\/tr>\n
    Or Zamir<\/span>\u00a0<\/span><\/td>\nTel-Aviv University<\/span>\u00a0<\/span><\/td>\n<\/tr>\n<\/tbody>\n<\/table>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"

    Overview and Call for Papers The 66th Annual Symposium on Foundations of Computer Science (FOCS 2025), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in Sydney, Australia, December 14-17. Information about previous conferences can be found at the FOCS Conference Archive. Papers presenting new and original research […]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-84","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/focs.computer.org\/2025\/wp-json\/wp\/v2\/pages\/84","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/focs.computer.org\/2025\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/focs.computer.org\/2025\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/focs.computer.org\/2025\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/focs.computer.org\/2025\/wp-json\/wp\/v2\/comments?post=84"}],"version-history":[{"count":0,"href":"https:\/\/focs.computer.org\/2025\/wp-json\/wp\/v2\/pages\/84\/revisions"}],"wp:attachment":[{"href":"https:\/\/focs.computer.org\/2025\/wp-json\/wp\/v2\/media?parent=84"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}