Design and analysis of sequential and parallel algorithms, structural complexity theory, probabilistic algorithms, interactive proof systems, Arthur-Merlin games, NC-algorithms and P-complete problems.
Modal Logics :
Foundation of computability theory, dynamic logic, logic of knowledge and belief (useful for distributed computing), temporal logic, expressibility, logic programming and semantics of programming languages.
Natural languages processing (modern Greek):
Character Sets' Standardization, Text Normalization and Tagging, Automation in Lexicographic work, Morphological Analysis and Generation, Syntactic Analysis and Generation.
You can see something from the list following by clicking on the appropriate word each time:
Back to CSD Page