{"id":1382,"date":"2023-03-02T08:51:43","date_gmt":"2023-03-02T08:51:43","guid":{"rendered":"https:\/\/ieeecsfocs.wpengine.com\/2023\/?page_id=1382"},"modified":"2023-10-09T03:16:08","modified_gmt":"2023-10-09T03:16:08","slug":"call-for-papers","status":"publish","type":"page","link":"https:\/\/focs.computer.org\/2023\/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\t

The 64th Annual Symposium on Foundations of Computer Science (FOCS 2023), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in <\/span>Santa Cruz, CA, USA November 6\u2014November 9, 2023 <\/b>at the Hotel Paradox<\/a>. <\/b>Information about previous conferences can be found at the FOCS Conference Archive<\/a>.<\/p>

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, algorithms and data structures, analysis of Boolean functions, approximation algorithms, computational applications of logic, combinatorics, computational complexity including communication complexity and circuit complexity, computational game theory, computational geometry, computational learning theory, cryptography, foundations of machine learning, online algorithms, optimization, parallel and distributed algorithms, parameterized algorithms, sublinear algorithms, streaming algorithms, quantum computing, randomness in computing, and theoretical aspects of areas such as networks, privacy, 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.<\/span><\/p>

Please submit using this link:\u00a0https:\/\/focs23.hotcrp.com\/<\/a><\/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

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<\/colgroup>

Abstract submission deadline<\/span><\/p><\/td>

March 28, 2023 at 16:59 PDT<\/span><\/p><\/td><\/tr>

Full paper submission deadline<\/span><\/p><\/td>

April 3, 2023 at 16:59 PDT<\/span><\/p><\/td><\/tr>

Notification<\/span><\/p><\/td>

July 1, 2023<\/span><\/p><\/td><\/tr>

Conference<\/span><\/p><\/td>

November 6 \u2014 November 9, 2023<\/span><\/p><\/td><\/tr><\/tbody><\/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

Abstracts, to be submitted by the abstract submission deadline, should consist of the title of the paper, and a brief abstract summarizing the paper’s contributions. Full submissions, submitted by the full paper submission deadline, should contain the complete paper. There is no page limit and authors are encouraged to use the “full version” 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’s 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’s discretion. Authors 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.<\/span><\/p>

FOCS 2023 will use double-blind reviewing<\/span>, 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 but rather \u201cWe build on the work of \u2026\u201d).<\/span><\/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.<\/span><\/p>

Submissions by PC members 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.<\/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

Conjecture track<\/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

Submissions to FOCS 2023 can be marked for the \u201cMain Track\u201d or the \u201cConjectures Track\u201d. Submissions to the new Conjectures Track will be evaluated completely separately from submissions to the Main Track. There is no a priori acceptance quota for either track, or desired number of accepted papers: it will all depend on the quality of submissions only.<\/span><\/p>

Papers submitted to the Conjectures Track should be focused on one or more conjectures, describe evidence for and against them, and motivate them through potential implications. The conjecture(s) can be novel to the paper, or they can be conjectures that have been formed in the past within a certain community. In the latter case, the origin of the conjecture(s) should be described in the submission: it is not required that authors of the paper are also at the origin of the conjecture(s), but if they are not, they should attribute them appropriately to the extent possible.\u00a0<\/span><\/p>

Papers submitted to the Conjectures Track will be evaluated based on the importance of the conjecture(s) to the relevant field within theoretical computer science and beyond, as argued in the submission. Evidence for the conjecture(s) and implications of the conjecture(s) should be provided to support this importance. Of course, conjectures that may open up a new field within theoretical computer science would also be very welcome.<\/span><\/p>

FAQ on the conjecture track<\/span><\/a><\/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). <\/span><\/p>\n

Please submit using this link: https:\/\/focs23.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>\n

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

    If an author believes that they have a valid reason for a conflict of interest not listed above, then he or she can contact the PC chair or any ToC advocate affiliated with this conference directly. 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.<\/span><\/p>\n

    Authors are encouraged to also make full versions of their submissions freely accessible in an online repository such as the<\/span> arXiv<\/span><\/a>,<\/span> ECCC<\/span><\/a>, or the<\/span> Cryptology ePrint archive<\/span><\/a>. (Papers that are not written well enough for public dissemination are probably also not ready for submission to FOCS.) It is expected that authors of accepted papers will make their full papers, with proofs, publicly available by the camera-ready deadline.<\/span><\/p>\n

    <\/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’s 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 2023, will not be considered for acceptance at FOCS 2023. Simultaneous submission of the same (or essentially the same) abstract to FOCS 2023 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’s 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 Awards<\/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>

    \u00a0<\/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

    Amir Abboud<\/p><\/td>

    Weizmann Institute of Science<\/p><\/td><\/tr>

    Pankaj K. Agarwal<\/p><\/td>

    Duke University<\/p><\/td><\/tr>

    Sepehr Assadi<\/p><\/td>

    Rutgers University & University of Waterloo<\/p><\/td><\/tr>

    Nikhil Bansal<\/p><\/td>

    University of Michigan<\/p><\/td><\/tr>

    Arnab Bhattacharyya<\/p><\/td>

    National University of Singapore<\/p><\/td><\/tr>

    Antonio Blanca<\/p><\/td>

    Penn State University<\/p><\/td><\/tr>

    Arkadev Chattopadhyay<\/p><\/td>

    Tata Institute of Fundamental Research<\/p><\/td><\/tr>

    Shuchi Chawla<\/p><\/td>

    UT Austin<\/p><\/td><\/tr>

    Shiri Chechik<\/p><\/td>

    Tel-Aviv University<\/p><\/td><\/tr>

    Gil Cohen<\/p><\/td>

    Tel-Aviv University<\/p><\/td><\/tr>

    Vincent Cohen-Addad<\/p><\/td>

    Google Research<\/p><\/td><\/tr>

    Costis Daskalakis<\/p><\/td>

    MIT & Archimedes AI<\/p><\/td><\/tr>

    Yuval Filmus<\/p><\/td>

    Technion<\/p><\/td><\/tr>

    Sebastian Forster<\/p><\/td>

    University of Salzburg<\/p><\/td><\/tr>

    Andr\u00e1s Gily\u00e9n<\/p><\/td>

    Alfr\u00e9d R\u00e9nyi Institute of Mathematics, Budapest, Hungary<\/p><\/td><\/tr>

    Mohsen Ghaffari<\/p><\/td>

    MIT<\/p><\/td><\/tr>

    Yannai Gonczarowski<\/p><\/td>

    Harvard University<\/p><\/td><\/tr>

    Rishab Goyal<\/p><\/td>

    University of Wisconsin-Madison<\/p><\/td><\/tr>

    Martin Grohe<\/p><\/td>

    RWTH Aachen University<\/p><\/td><\/tr>

    Aayush Jain<\/p><\/td>

    Carnegie Mellon University<\/p><\/td><\/tr>

    Valentine Kabanets<\/p><\/td>

    Simon Fraser University<\/p><\/td><\/tr>

    Gautam Kamath<\/p><\/td>

    University of Waterloo<\/p><\/td><\/tr>

    Thomas Kesselheim<\/p><\/td>

    University of Bonn<\/p><\/td><\/tr>

    Valerie King<\/p><\/td>

    University of Victoria<\/p><\/td><\/tr>

    Gillat Kol<\/p><\/td>

    Princeton University<\/p><\/td><\/tr>

    Pravesh Kothari<\/p><\/td>

    Carnegie Mellon University<\/p><\/td><\/tr>

    Michal Koucky<\/p><\/td>

    Charles University<\/p><\/td><\/tr>

    Katrina Ligett<\/p><\/td>

    Hebrew University<\/p><\/td><\/tr>

    Nutan Limaye<\/p><\/td>

    IT University of Copenhagen<\/p><\/td><\/tr>

    Huijia Lin<\/p><\/td>

    University of Washington<\/p><\/td><\/tr>

    Alex Lombardi<\/p><\/td>

    Simons Institute and UC Berkeley<\/p><\/td><\/tr>

    Shachar Lovett<\/p><\/td>

    UC San Diego<\/p><\/td><\/tr>

    D\u00e1niel Marx<\/p><\/td>

    CISPA Helmholtz Center for Information Security<\/p><\/td><\/tr>

    Raghu Meka<\/p><\/td>

    UC Los Angeles<\/p><\/td><\/tr>

    Dieter van Melkebeek<\/p><\/td>

    University of Wisconsin-Madison<\/p><\/td><\/tr>

    Ankur Moitra<\/p><\/td>

    MIT<\/p><\/td><\/tr>

    Shay Moran<\/p><\/td>

    Technion, Google Research<\/p><\/td><\/tr>

    Danupon Nanongkai<\/p><\/td>

    Max Planck Institute for Informatics<\/p><\/td><\/tr>

    Aleksandar Nikolov<\/p><\/td>

    University of Toronto<\/p><\/td><\/tr>

    Ryan O’Donnell<\/p><\/td>

    Carnegie Mellon University<\/p><\/td><\/tr>

    Rafael Oliveira<\/p><\/td>

    University of Waterloo<\/p><\/td><\/tr>

    Shayan Oveis Gharan<\/p><\/td>

    UW Seattle<\/p><\/td><\/tr>

    Debmalya Panigrahi<\/p><\/td>

    Duke University<\/p><\/td><\/tr>

    Chris Peikert<\/p><\/td>

    University of Michigan<\/p><\/td><\/tr>

    Richard Peng<\/p><\/td>

    University of Waterloo<\/p><\/td><\/tr>

    Seth Pettie<\/p><\/td>

    University of Michigan<\/p><\/td><\/tr>

    Sofya Raskhodnikova<\/p><\/td>

    Boston University<\/p><\/td><\/tr>

    Bhaskar Ray Chaudhury<\/p><\/td>

    UIUC<\/p><\/td><\/tr>

    Dana Ron<\/p><\/td>

    Tel Aviv University<\/p><\/td><\/tr>

    Noga Ron-Zewi<\/p><\/td>

    University of Haifa<\/p><\/td><\/tr>

    Thomas Rothvoss<\/p><\/td>

    University of Washington<\/p><\/td><\/tr>

    Aviad Rubinstein<\/p><\/td>

    Stanford<\/p><\/td><\/tr>

    Sushant Sachdeva<\/p><\/td>

    University of Toronto<\/p><\/td><\/tr>

    Barna Saha<\/p><\/td>

    UC San Diego<\/p><\/td><\/tr>

    Amit Sahai<\/p><\/td>

    UC Los Angeles<\/p><\/td><\/tr>

    Shubhangi Saraf<\/p><\/td>

    University of Toronto<\/p><\/td><\/tr>

    Aaron Sidford<\/p><\/td>

    Stanford<\/p><\/td><\/tr>

    Noah Stephens-Davidowitz<\/p><\/td>

    Cornell<\/p><\/td><\/tr>

    Madhu Sudan<\/p><\/td>

    Harvard University<\/p><\/td><\/tr>

    Thomas Vidick<\/p><\/td>

    California Institute of Technology & Weizmann Institute of Science<\/p><\/td><\/tr>

    Aravindan Vijayaraghavan<\/p><\/td>

    Northwestern University<\/p><\/td><\/tr>

    Omri Weinstein<\/p><\/td>

    Hebrew University<\/p><\/td><\/tr>

    Daniel Wichs<\/p><\/td>

    Northeastern University & NTT Research<\/p><\/td><\/tr>

    Andreas Wiese<\/p><\/td>

    Technical University of Munich<\/p><\/td><\/tr>

    Ronald de Wolf<\/p><\/td>

    QuSoft, CWI & University of Amsterdam<\/p><\/td><\/tr>

    Mark Zhandry<\/p><\/td>

    NTT Research<\/p><\/td><\/tr><\/tbody><\/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 64th Annual Symposium on Foundations of Computer Science (FOCS 2023), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing, will be held in Santa Cruz, CA, USA November 6\u2014November 9, 2023 at the Hotel Paradox. Information about previous conferences can be found at the FOCS […]<\/p>\n","protected":false},"author":6,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"class_list":["post-1382","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/focs.computer.org\/2023\/wp-json\/wp\/v2\/pages\/1382","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/focs.computer.org\/2023\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/focs.computer.org\/2023\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/focs.computer.org\/2023\/wp-json\/wp\/v2\/users\/6"}],"replies":[{"embeddable":true,"href":"https:\/\/focs.computer.org\/2023\/wp-json\/wp\/v2\/comments?post=1382"}],"version-history":[{"count":0,"href":"https:\/\/focs.computer.org\/2023\/wp-json\/wp\/v2\/pages\/1382\/revisions"}],"wp:attachment":[{"href":"https:\/\/focs.computer.org\/2023\/wp-json\/wp\/v2\/media?parent=1382"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}