Difference between revisions of "FSTTCS 2021"
Jump to navigation
Jump to search
Heike.Rohde (talk | contribs) m (Heike.Rohde moved page FSTTIC 2021 to FSTTCS 2021) |
Tim Holzheim (talk | contribs) (Added page provenance(#264) and contribution type(#271)) |
||
| (3 intermediate revisions by one other user not shown) | |||
| Line 12: | Line 12: | ||
|Country=India | |Country=India | ||
|presence=presence | |presence=presence | ||
| + | |Has host organization=Indian Association for Research in Computing Science, IARCS | ||
| + | |pageCreator=Heike.Rohde | ||
| + | |pageEditor=Heike.Rohde | ||
| + | |contributionType=1 | ||
}} | }} | ||
| + | ==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 | ||
Latest revision as of 20:17, 1 April 2022
| 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: | Goa, India |
| 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