Difference between revisions of "FSTTCS 2021"

From OPENRESEARCH fixed Wiki
Jump to navigation Jump to search
(modified through wikirestore by Th)
(modified through wikirestore by Th)
Line 1: Line 1:
 
{{Event
 
{{Event
|Acronym=FSTTC 2021
+
|Submission deadline=2020/12/18
|Title=41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
+
|Has host organization=Indian Association for Research in Computing Science, IARCS
|Ordinal=41
+
|Acronym =FSTTC 2021
|Series=FSTTCS
 
|Type=Conference
 
|Start date=2021/12/15
 
 
|End date=2021/12/18
 
|End date=2021/12/18
|Submission deadline=2020/12/18
+
|Series  =FSTTCS
 +
|presence=presence
 +
|Type    =Conference
 +
|Country =PH
 +
|State  =PH/05
 +
|City    =PH/05/Goa
 
|Homepage=https://www.fsttcs.org.in/2021/index.php
 
|Homepage=https://www.fsttcs.org.in/2021/index.php
|City=Goa
+
|Ordinal =41
|Country=India
+
|Start date=2021/12/15
|presence=presence
+
|Title  =41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science}}
|Has host organization=Indian Association for Research in Computing Science, IARCS
 
|State=PH/05}}
 
 
==Topics==
 
==Topics==
 
Track A
 
Track A

Revision as of 00:33, 25 October 2021


Event Rating

median worst
Pain1.svg Pain5.svg

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
Loading map...

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