Difference between revisions of "FSTTCS 2021"
Jump to navigation
Jump to search
(modified through wikirestore by Th) |
(modified through wikirestore by orapi) |
||
(5 intermediate revisions by 2 users not shown) | |||
Line 3: | Line 3: | ||
|Has host organization=Indian Association for Research in Computing Science, IARCS | |Has host organization=Indian Association for Research in Computing Science, IARCS | ||
|Acronym =FSTTC 2021 | |Acronym =FSTTC 2021 | ||
− | |End date=2021 | + | |End date=2021-12-18 |
|Series =FSTTCS | |Series =FSTTCS | ||
|presence=presence | |presence=presence | ||
Line 10: | Line 10: | ||
|State =PH/05 | |State =PH/05 | ||
|City =PH/05/Goa | |City =PH/05/Goa | ||
+ | |Year =2021 | ||
|Homepage=https://www.fsttcs.org.in/2021/index.php | |Homepage=https://www.fsttcs.org.in/2021/index.php | ||
|Ordinal =41 | |Ordinal =41 | ||
− | |Start date=2021 | + | |Start date=2021-12-15 |
− | |Title =41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}} | + | |Title =41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science |
+ | }} | ||
==Topics== | ==Topics== | ||
Track A | Track A |
Latest revision as of 03:08, 6 December 2021
Event Rating
median | worst |
---|---|
List of all ratings can be found at FSTTCS 2021/rating
FSTTCS 2021 | |
---|---|
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
| |
Ordinal | 41 |
Event in series | FSTTCS |
Dates | 2021-12-15 (iCal) - 2021-12-18 |
Presence | presence |
Homepage: | https://www.fsttcs.org.in/2021/index.php |
Location | |
Location: | PH/05/Goa, PH/05, PH |
Important dates | |
Submissions: | 2020/12/18 |
Table of Contents | |
Topics
Track A
Algebraic Complexity Algorithms and Data Structures Algorithmic Graph Theory and Combinatorics Approximation Algorithms Combinatorial Optimization Communication Complexity Computational Biology Computational Complexity Computational Geometry Computational Learning Theory Cryptography and Security Data Streaming and Sublinear algorithms Game Theory and Mechanism Design Parallel, Distributed and Online Algorithms Parameterized Complexity Proof Complexity Quantum Computing Randomness in Computing Theoretical Aspects of Mobile and High-Performance Computing
Track B
Automata, Games and Formal Languages Logic in Computer Science Modal and Temporal Logics Model Checking and Reactive Synthesis Models of Concurrent, Distributed and Mobile Systems Models of Timed, Reactive, Hybrid and Stochastic Systems Model Theory Principles and Semantics of Programming Languages Program Analysis and Transformation Security protocols Specification, Verification and Synthesis Theorem Proving and Decision Procedures