STACS 2019 - 36th International Symposium on Theoretical Aspects of Computer Science
Topics/Call fo Papers
The 36th International Symposium on Theoretical Aspects of Computer Science (STACS'19)
will be held in Berlin, Germany, March 13–16, 2019.
The conference will take place in the math building of TU Berlin.
Scope
Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science.
Typical areas include (but are not limited to):
algorithms and data structures, including: design of parallel, distributed, approximation, parameterized and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory;
automata and formal languages, including: algebraic and categorical methods, coding theory;
complexity and computability, including: computational and structural complexity theory, parameterized complexity, randomness in computation;
logic in computer science, including: finite model theory, database theory, semantics, specification verification, rewriting and deduction;
current challenges, for example: natural computing, quantum computing, mobile and net computing, computational social choice.
will be held in Berlin, Germany, March 13–16, 2019.
The conference will take place in the math building of TU Berlin.
Scope
Authors are invited to submit papers presenting original and unpublished research on theoretical aspects of computer science.
Typical areas include (but are not limited to):
algorithms and data structures, including: design of parallel, distributed, approximation, parameterized and randomized algorithms; analysis of algorithms and combinatorics of data structures; computational geometry, cryptography, algorithmic learning theory, algorithmic game theory;
automata and formal languages, including: algebraic and categorical methods, coding theory;
complexity and computability, including: computational and structural complexity theory, parameterized complexity, randomness in computation;
logic in computer science, including: finite model theory, database theory, semantics, specification verification, rewriting and deduction;
current challenges, for example: natural computing, quantum computing, mobile and net computing, computational social choice.
Other CFPs
- Teaching your Front-line How to Ask BSA Questions?
- International Conference on Social Responsibility, Social Science Innovations, Business and Economic Research (SSBE)
- International Conference on Business Economics, Social Science and Corporate Social Responsibility. (BESS)
- International Conference on Disaster Management, Business Economics and Social Sciences (DBES)
- International Conference on Academic Research in Economics, Business, Social Sciences and Humanities (AREB)
Last modified: 2018-07-04 22:10:46