\n

\n * Algorithms and data structures, incl uding: parallel and distributed algorithms, comput ational geometry, cryptography, algorithmic learni ng theory;

\n * Automata and formal languag es;

\n * Computational and structural compl exity

\n * Logic in computer science, inclu ding: semantics, specification, and verification o f programs, rewriting and deduction;

\n * C urrent challenges, for example: biological computi ng, quantum computing, mobile and net computing.\n \n \n \n

\nhe Symposium on Theoretical Aspects of Computer Scien ce (STACS) takes place each year since 1984, alter nately in Germany and France.\n

\n < p>\n Typical topics of the conference include :\n * Algorithms and data structures, incl uding: parallel and distributed algorithms, comput ational geometry, cryptography, algorithmic learni ng theory;

\n * Automata and formal languag es;

\n * Computational and structural compl exity

\n * Logic in computer science, inclu ding: semantics, specification, and verification o f programs, rewriting and deduction;

\n * C urrent challenges, for example: biological computi ng, quantum computing, mobile and net computing.\n \n \n \n

For more inform ation, see\n http://stacs2011.de/\n < /p>\n

\n

URL:/NewsandEvents/Archives/2011/newsitem/3359/10-
12-March-2011-28th-Symposium-on-Theoretical-Aspect
s-of-Computer-Science-STACS-2011-Dortmund-Germany
END:VEVENT
END:VCALENDAR
\n Authors a re invited to submit papers presenting original an d\n unpublished research on theoretical asp ects of computer\n science.\n Deadli ne for submission: September 24, 2010.\n

\n