Call for Papers: FSTTCS 2026

[Kohei SUENAGA]

皆様，

京都大学の末永です．

12月にインドのデリーで行われる
FSTTCS の論文募集をお送りします．
アブストラクトの締め切りが 7月4日で
論文締め切りが7月11日の予定です．
どうぞふるってご投稿ください．

末永

==
December 15-20, 2026 at IIT Delhi, India

Website: https://www.fsttcs.org.in/2026/

FSTTCS 2026 is the 46th conference on Foundations of Software
Technology and Theoretical Computer Science. It is organised by IARCS,
the Indian Association for Research in Computing Science, in
association with ACM India. It is a forum for presenting original
results in foundational aspects of Computer Science and Software
Technology.

IMPORTANT DATES (all dates are AoE)

Abstract Submission: July 4, 2026

Paper Submission: July 11, 2026

Rebuttal phase: August 26-28, 2026

Notification: September 15, 2026

Conference and workshops: December 15-20, 2026


PAPER SUBMISSION

Submissions must be in electronic form via EasyChair using the LIPIcs
LaTeX style file available here. 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.

Reviewing for FSTTCS 2026 is double-blind.

Accepted papers will be published as proceedings of the conference in
the Leibniz International Proceedings in Informatics (LIPIcs) 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 CC-BY license. 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.


TOPICS

Track A

Algebraic Complexity
Algorithms and Data Structures
Algorithmic Graph Theory and Combinatorics
Approximation Algorithms
Combinatorial Optimization
Communication Complexity
Computational Geometry
Computational Learning Theory
Cryptography and Security
Data Streaming and Sublinear algorithms
Economics and Computation
Foundations of Machine Learning
Parallel, Distributed and Online Algorithms
Parameterized Complexity
Proof Complexity
Quantum Computing
Randomness in Computing
Theoretical Aspects of Computational Biology
Theoretical Aspects of Mobile and High-Performance Computing

Track B

Automata, Games and Formal Languages
Logic in Computer Science
Modal and Temporal Logics
Models of Concurrent, Distributed and Mobile Systems
Models of Timed, Reactive, Hybrid and Stochastic and Quantum Systems
Finite Model Theory and Database Theory
Formal Methods
Principles and Semantics of Programming Languages
Program Analysis and Transformation
Specification, Verification and Synthesis
Analysis and Verification of AI
Theorem Proving and Decision Procedures
SAT and SMT solving
Formal Analysis of Security and Privacy


--
Kohei Suenaga (末永幸平), Ph.D
Associate professor (准教授)
Graduate School of Informatics, Kyoto University
(京都大学情報学研究科)
ksue...@gmail.com
http://www.fos.kuis.kyoto-u.ac.jp/~ksuenaga/