<!DOCTYPE html>
<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body>
<div><font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(0,0,0)"><br>
</font></div>
<div>
<div style="box-sizing:border-box">
<p
style="box-sizing:border-box;margin:0px 0px 10.5px;color:rgb(44,62,80)"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)"><a
href="https://urldefense.com/v3/__https://www.fsttcs.org.in/2025/__;!!IBzWLUs!TZUj69naZTI6OTFd_5jUg_NgJ60dg9p9ffAeL4PHAlk66fFjtjzoEWXilVSULUpcc9vl0xsHnwLW8UMDM776umXJUUCzWS_OeRg$"
target="_blank" style="font-family:arial,sans-serif"
moz-do-not-send="true">FSTTCS 2025</a> is the 45th
conference on Foundations of Software Technology and
Theoretical Computer Science. It is organized by <a
href="https://urldefense.com/v3/__http://www.iarcs.org.in/__;!!IBzWLUs!TZUj69naZTI6OTFd_5jUg_NgJ60dg9p9ffAeL4PHAlk66fFjtjzoEWXilVSULUpcc9vl0xsHnwLW8UMDM776umXJUUCzAHv34YM$"
style="box-sizing:border-box;background-image:none;background-position:0% 0%;background-size:auto;background-repeat:repeat;background-origin:padding-box;background-clip:border-box;text-decoration:none;font-family:arial,sans-serif;color:rgb(24,188,156)"
target="_blank">IARCS</a>, the Indian Association for
Research in Computing Science, in association with <a
href="https://urldefense.com/v3/__https://india.acm.org/__;!!IBzWLUs!TZUj69naZTI6OTFd_5jUg_NgJ60dg9p9ffAeL4PHAlk66fFjtjzoEWXilVSULUpcc9vl0xsHnwLW8UMDM776umXJUUCzgPvIUfc$"
style="box-sizing:border-box;background-image:none;background-position:0% 0%;background-size:auto;background-repeat:repeat;background-origin:padding-box;background-clip:border-box;text-decoration:none;font-family:arial,sans-serif;color:rgb(24,188,156)"
target="_blank">ACM India</a>. It is a forum for
presenting original results in foundational aspects of
Computer Science and Software Technology.</font></p>
<p
style="box-sizing:border-box;margin:0px 0px 10.5px;color:rgb(44,62,80)"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">FSTTCS
2025 will be held in <a
href="https://urldefense.com/v3/__https://www.bits-pilani.ac.in/goa/__;!!IBzWLUs!TZUj69naZTI6OTFd_5jUg_NgJ60dg9p9ffAeL4PHAlk66fFjtjzoEWXilVSULUpcc9vl0xsHnwLW8UMDM776umXJUUCzHx1yPUQ$"
style="box-sizing:border-box;background-image:none;background-position:0% 0%;background-size:auto;background-repeat:repeat;background-origin:padding-box;background-clip:border-box;text-decoration:none;font-family:arial,sans-serif;color:rgb(24,188,156)"
target="_blank" moz-do-not-send="true">BITS Pilani, K K
Birla Goa Campus</a> during December 17–19, 2025. The
conference is being organized as an in-person event.</font></p>
<p
style="box-sizing:border-box;margin:0px 0px 10.5px;color:rgb(44,62,80)"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(34,34,34)">Important
Dates</font></p>
<ul style="color:rgb(44,62,80)">
<li style="margin-left:15px"><span
style="font-family:arial,sans-serif;box-sizing:border-box">Paper
submission deadline</span><span
style="font-family:arial,sans-serif">: July 11, 2025 AoE</span><br>
</li>
<li style="margin-left:15px"><font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)"><span
style="box-sizing:border-box;font-family:arial,sans-serif">Rebuttal</span>:
August 26–28, 2025</font></li>
<li style="margin-left:15px"><font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)"><span
style="box-sizing:border-box;font-family:arial,sans-serif">Notification
to authors</span>: September 15, 2025</font></li>
<li style="margin-left:15px"><font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)"><span
style="box-sizing:border-box;font-family:arial,sans-serif">Deadline for
camera-ready papers</span>: TBA</font></li>
<li style="margin-left:15px"><font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Pre-conference
workshop(s): <span
style="box-sizing:border-box;font-family:arial,sans-serif">December 15 –
16, 2025</span></font></li>
<li style="margin-left:15px"><font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">FSTTCS
2025: <span
style="box-sizing:border-box;font-family:arial,sans-serif">December 17 –
19, 2025</span></font></li>
<li style="margin-left:15px"><font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Post-conference
workshop(s): <span
style="box-sizing:border-box;font-family:arial,sans-serif">December 20,
2025</span></font></li>
</ul>
<div style="color:rgb(44,62,80)"><font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)"><span
style="box-sizing:border-box;font-family:arial,sans-serif">Submission
link:</span> <a
href="https://urldefense.com/v3/__https://easychair.org/my/conference?conf=fsttcs2025__;!!IBzWLUs!TZUj69naZTI6OTFd_5jUg_NgJ60dg9p9ffAeL4PHAlk66fFjtjzoEWXilVSULUpcc9vl0xsHnwLW8UMDM776umXJUUCzp70W0zY$"
style="background-image:none;background-position:0% 0%;background-size:auto;background-repeat:repeat;background-origin:padding-box;background-clip:border-box;box-sizing:border-box;text-decoration:none;font-family:arial,sans-serif;color:rgb(24,188,156)"
target="_blank" moz-do-not-send="true">https://easychair.org/my/conference?conf=fsttcs2025</a></font></div>
<font face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(0,0,0)"><br>
Submission Guidelines</font>
<p
style="box-sizing:border-box;margin:0px 0px 10.5px;color:rgb(44,62,80)"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Submissions
must be in electronic form via <a
href="https://urldefense.com/v3/__https://easychair.org/conferences?conf=fsttcs2025__;!!IBzWLUs!TZUj69naZTI6OTFd_5jUg_NgJ60dg9p9ffAeL4PHAlk66fFjtjzoEWXilVSULUpcc9vl0xsHnwLW8UMDM776umXJUUCzG7cUrSY$"
style="box-sizing:border-box;background-image:none;background-position:0% 0%;background-size:auto;background-repeat:repeat;background-origin:padding-box;background-clip:border-box;text-decoration:none;font-family:arial,sans-serif;color:rgb(24,188,156)"
target="_blank">EasyChair</a> using the LIPIcs LaTeX style
file available <a href="https://urldefense.com/v3/__https://submission.dagstuhl.de/documentation/authors__;!!IBzWLUs!T8_Nenj_YIwkOcLndUI8ryChEBWEMRQ5cKCA672wNqOp04JaZ5RlP4e1ALp3AtdkIdnmtmvukfZ3cDiYXfCLu98DX7l_jCOsCA$"><span
style="box-sizing:border-box;background-image:none;background-position:0% 0%;background-size:auto;background-repeat:repeat;background-origin:padding-box;background-clip:border-box;text-decoration:none;font-family:arial,sans-serif;color:rgb(24,188,156)">here</span></a>.
Submissions must not exceed 15 pages (excluding
bibliography), but may include a clearly marked appendix
containing technical details. The appendix will be read only
at the discretion of the program committee. Simultaneous
submissions to journals or other conferences with published
proceedings are disallowed.</font></p>
<p
style="box-sizing:border-box;margin:0px 0px 10.5px;color:rgb(44,62,80)"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Reviewing
for FSTTCS 2025 is <span
style="box-sizing:border-box;font-family:arial,sans-serif">double-blind</span>.
Hence, authors must make a reasonable effort to ensure that
their identity is not easily revealed from the submission
itself. Specifically, kindly replace your name and
affiliation on the first page with the submission number and
do not include any acknowledgements in your submission.
Also, authors should cite their prior work in a neutral
manner (i.e., instead of saying “We showed”, please write
“XYZ et al. showed”). Submitting a paper that is available
at a public preprint server (such as, arXiv) is admissible.
In that case, please do not cite that version of your work
in the submission itself. Submissions violating the page
limit or the double-blind policy may face desk rejection.</font></p>
<p
style="box-sizing:border-box;margin:0px 0px 10.5px;color:rgb(44,62,80)"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Accepted
papers will be published as proceedings of the conference in
the <a
href="https://urldefense.com/v3/__https://www.dagstuhl.de/en/publications/lipics/__;!!IBzWLUs!TZUj69naZTI6OTFd_5jUg_NgJ60dg9p9ffAeL4PHAlk66fFjtjzoEWXilVSULUpcc9vl0xsHnwLW8UMDM776umXJUUCzOogzJSU$"
style="box-sizing:border-box;background-image:none;background-position:0% 0%;background-size:auto;background-repeat:repeat;background-origin:padding-box;background-clip:border-box;text-decoration:none;font-family:arial,sans-serif;color:rgb(24,188,156)"
target="_blank" moz-do-not-send="true">Leibniz
International Proceedings in Informatics (LIPIcs)</a> as a
free, open, electronic archive with access to all. Authors
will retain full rights over their work. The accepted papers
will be published under a <a
href="https://urldefense.com/v3/__https://creativecommons.org/licenses/by/3.0/__;!!IBzWLUs!TZUj69naZTI6OTFd_5jUg_NgJ60dg9p9ffAeL4PHAlk66fFjtjzoEWXilVSULUpcc9vl0xsHnwLW8UMDM776umXJUUCzVEkrNSI$"
style="box-sizing:border-box;background-image:none;background-position:0% 0%;background-size:auto;background-repeat:repeat;background-origin:padding-box;background-clip:border-box;text-decoration:none;font-family:arial,sans-serif;color:rgb(24,188,156)"
target="_blank" moz-do-not-send="true">CC-BY license</a>.
For an accepted paper to be included in the proceedings, one
of the authors must commit to presenting the paper in person
at the conference.</font></p>
<hr
style="box-sizing:content-box;height:0px;margin-top:21px;margin-bottom:21px;border-right-width:0px;border-style:solid none none;border-bottom-width:0px;border-left-width:0px;border-color:rgb(236,240,241) currentcolor currentcolor;color:rgb(44,62,80)">
<h2
style="box-sizing:border-box;line-height:1.1;margin-top:21px;margin-bottom:10.5px"><font
face="arial, sans-serif" size="2"
style="font-weight:normal;font-family:arial,sans-serif;color:rgb(0,0,0)">List
of Topics</font></h2>
<h2
style="box-sizing:border-box;line-height:1.1;margin-top:21px;margin-bottom:10.5px"><font
face="arial, sans-serif" size="2"
style="font-weight:normal;font-family:arial,sans-serif;color:rgb(0,0,0)">Track
A</font></h2>
<ul
style="box-sizing:border-box;margin-top:0px;margin-bottom:10.5px;color:rgb(44,62,80)">
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Algebraic
Complexity</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Algorithms
and Data Structures</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Algorithmic
Graph Theory and Combinatorics</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Approximation
Algorithms</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Combinatorial
Optimization</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Communication
Complexity</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Computational
Geometry</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Computational
Learning Theory</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Cryptography
and Security</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Data
Streaming and Sublinear algorithms</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Economics
and Computation</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Foundations
of Machine Learning</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Parallel,
Distributed and Online Algorithms</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Parameterized
Complexity</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Proof
Complexity</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Quantum
Computing</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Randomness
in Computing</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Theoretical
Aspects of Computational Biology</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Theoretical
Aspects of Mobile and High-Performance Computing</font></li>
</ul>
<h3
style="box-sizing:border-box;line-height:1.1;margin-top:21px;margin-bottom:10.5px"><font
face="arial, sans-serif" size="2"
style="font-weight:normal;font-family:arial,sans-serif;color:rgb(0,0,0)">Track
B</font></h3>
<ul
style="box-sizing:border-box;margin-top:0px;margin-bottom:10.5px;color:rgb(44,62,80)">
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Automata,
Games and Formal Languages</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Formal
Methods</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Logic
in Computer Science</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Modal
and Temporal Logics</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Models
of Concurrent, Distributed and Mobile Systems</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Models
of Timed, Reactive, Hybrid and Stochastic and Quantum
Systems</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Model
Theory</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Principles
and Semantics of Programming Languages</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Program
Analysis and Transformation</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">SAT
and SMT solving</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Security
protocols</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Specification,
Verification and Synthesis</font></li>
<li style="margin-left:15px;box-sizing:border-box"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">Theorem
Proving and Decision Procedures</font></li>
</ul>
<p
style="box-sizing:border-box;margin:0px 0px 10.5px;color:rgb(44,62,80)"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">We
particularly welcome papers in Programming Languages and
Formal Methods for Track B.</font></p>
<p
style="box-sizing:border-box;margin:0px 0px 10.5px;color:rgb(44,62,80)"><font
face="arial, sans-serif"
style="font-family:arial,sans-serif;color:rgb(44,62,80)">If
you have any questions, please feel free to contact us at: <a
href="mailto:fsttcs2025.chairs@gmail.com" target="_blank"
style="font-family:arial,sans-serif"
class="moz-txt-link-freetext">fsttcs2025.chairs@gmail.com</a></font></p>
</div>
</div>
<p></p>
</body>
</html>