Difference between revisions of "Event:FSTTCS 2021"

Latest revision as of 11:24, 12 September 2023

Deadlines

19
Jul

2021

Submission

20
Sep

2021

Notification

4
Oct

2021

Camera-Ready

Metrics

Submitted Papers

122

Accepted Papers

47

Venue

Loading map...

Warning: Venue is missing. The map might not show the exact location.

@@ Line 1: / Line 1: @@
 {{Event
-|Acronym=FSTTC 2021
+|Acronym=FSTTCS 2021
-|Title=41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
+|Title=IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science
 |Ordinal=41
+|In Event Series=Event Series:FSTTCS
+|Single Day Event=no
+|Start Date=2021/12/15
+|End Date=2021/12/17
+|Event Status=as scheduled
+|Event Mode=online
+|Academic Field=Theory Of Computation
+|Official Website=https://www.fsttcs.org.in/archives/2021/
+|Submission Link=https://easychair.org/conferences/?conf=fsttcs2021
+|Registration Link=https://forms.gle/ZrAKQwRwtPXYGcRA7
+|DOI=10.25798/zjmx-zg11
+|Hashtag=FSTTCS 2021
 |Type=Conference
-|Submission deadline=2020/12/18
-|Homepage=https://www.fsttcs.org.in/2021/index.php
-|City=Goa
-|Country=India
-|presence=presence
-|Has host organization=Indian Association for Research in Computing Science, IARCS
 |pageCreator=User:Curator 27
 |pageEditor=User:Curator 27
 |contributionType=1
-|In Event Series=Event Series:FSTTCS
-|Single Day Event=no
-|Start Date=2021/12/15
-|End Date=2021/12/18
 }}
-==Topics==
+{{Event Deadline
-Track A
+|Notification Deadline=2021/09/20
+|Camera-Ready Deadline=2021/10/04
-    Algebraic Complexity
+|Submission Deadline=2021/07/19
-    Algorithms and Data Structures
+}}
-    Algorithmic Graph Theory and Combinatorics
+{{Organizer
-    Approximation Algorithms
+|Contributor Type=organization
-    Combinatorial Optimization
+|Organization=Indian Association for Research in Computing Science
-    Communication Complexity
+}}
-    Computational Biology
+{{Organizer
-    Computational Complexity
+|Contributor Type=organization
-    Computational Geometry
+|Organization=University of Antwerp
-    Computational Learning Theory
+}}
-    Cryptography and Security
+{{Organizer
-    Data Streaming and Sublinear algorithms
+|Contributor Type=organization
-    Game Theory and Mechanism Design
+|Organization=Tata Institute of Fundamental Research
-    Parallel, Distributed and Online Algorithms
+}}
-    Parameterized Complexity
+{{Event Metric
-    Proof Complexity
+|Number Of Submitted Papers=122
-    Quantum Computing
+|Number Of Accepted Papers=47
-    Randomness in Computing
+}}
-    Theoretical Aspects of Mobile and High-Performance Computing
+{{S Event}}
-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