FSTTC 2021

From ConfIDent
Revision as of 14:12, 6 September 2022 by WikiSysop (talk | contribs) (mobo import Concept___Events-migrated)

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
Cookies help us deliver our services. By using our services, you agree to our use of cookies.