m (Text replacement - "Homepage=" to "Official Website=") |
Curator 91 (talk | contribs) |
||
| Line 3: | Line 3: | ||
|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 | ||
|Ordinal=41 | |Ordinal=41 | ||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
|In Event Series=Event Series:FSTTCS | |In Event Series=Event Series:FSTTCS | ||
|Single Day Event=no | |Single Day Event=no | ||
| Line 16: | Line 9: | ||
|Event Status=as scheduled | |Event Status=as scheduled | ||
|Event Mode=on site | |Event Mode=on site | ||
| + | |City=Goa | ||
| + | |Country=Country:IN | ||
| + | |Official Website=https://www.fsttcs.org.in/2021/index.php | ||
| + | |DOI=10.25798/zjmx-zg11 | ||
| + | |Type=Conference | ||
| + | |pageCreator=User:Curator 27 | ||
| + | |pageEditor=User:Curator 27 | ||
| + | |contributionType=1 | ||
}} | }} | ||
{{Event Deadline | {{Event Deadline | ||
|Submission Deadline=2020/12/18 | |Submission Deadline=2020/12/18 | ||
}} | }} | ||
| − | |||
{{Organizer | {{Organizer | ||
| + | |Contributor Type=organization | ||
|Organization=Indian Association for Research in Computing Science, IARCS | |Organization=Indian Association for Research in Computing Science, IARCS | ||
| − | |||
}} | }} | ||
| + | {{Event Metric}} | ||
| + | {{S Event}} | ||
==Topics== | ==Topics== | ||
Track A | Track A | ||
Revision as of 09:47, 7 July 2023
Deadlines
|
||
| Submission |
|
||
| Notification |
|
||
| Camera-Ready |
Metrics
Venue
Warning: Venue is missing. The map might not show the exact location.
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
