When submitting the application, the doctoral student applies for a specific topic. Each of the tutors can train a maximum of 5 doctoral students at a time, so many tutors do not list the topic each year. The easiest way to make sure that the topic you like is available is to contact a potential tutor no later than early February of the year you want to begin your doctoral studies.
doc. & nbsp; RNDr. & nbsp; Ing. & nbsp; Bajla, & nbsp; PhD | SAV / ÚM | image processing, visual recognition objects |
Mgr. & nbsp; Broňa & nbsp; Brejová, & nbsp; PhD | KI | bioinformatics |
Mgr. & nbsp; Stefan & nbsp; Dobrev, & nbsp; PhD | SAS / MÚ | distributed algorithms, graph-theoretical methods |
doc. & nbsp; RNDr. & nbsp; Roman & nbsp; Ďurikovič, & nbsp; PhD td > | KAI | computer graphics, materials modeling, simulations of natural phenomena, human-computer interaction |
Doc. & nbsp; RNDr. & nbsp; Ďuriš, & nbsp; CSc a > | KI | computational complexity, communication complexity |
doc. & nbsp; Ing. & nbsp; Igor & nbsp; Farkaš, & nbsp; PhD < / td> | KAI | neural networks, cognitive science, natural language processing |
Doc. & nbsp; RNDr. & nbsp; Damas & nbsp; Gruska, & nbsp; PhD < / td> | KAI | parallel, distributed and competitive systems, formal methods |
Doc. & nbsp; RNDr. Rastislav & nbsp; Královič, & nbsp; PhD < / td> | KI | graphical network models, algorithms |
doc. & nbsp; RNDr. & nbsp; Mária & nbsp; Markošová, & nbsp; PhD < / td> | KAI | network theory (growing networks, small world networks, applications), language modeling |
Doc. & nbsp; Daniel & nbsp; Olejár, & nbsp; PhD a > | KI | information security, cryptology, discrete mathematics |
doc. & nbsp; RNDr. Dana & nbsp; Pardubská, & nbsp; PhD < / td> | KI | computational complexity, parallel and distributed computations, formal languages |
Prof. & nbsp; Branislav & nbsp; Rovan, & nbsp; PhD < / td> | KI | calculation models and complexity |
doc. & nbsp; RNDr. & nbsp; Martin & nbsp; Stanek, & nbsp; PhD < / td> | KI | information security, cryptology |
doc. & nbsp; PhDr. & nbsp; Ján & nbsp; Šefránek, & nbsp; CSc < / td> | KAI | knowledge representation, non-monotonic reasoning, cognitive semantics |
Prof. & nbsp; Martin & nbsp; Škoviera, & nbsp; PhD a > | KI | graph theory, combinatorics |
doc. & nbsp; Ing. & nbsp; Miloš & nbsp; Šrámek, & nbsp; PhD < / td> | KAI | visualization and processing of volumetric data |
Doc. & nbsp; RNDr. & nbsp; Toman, & nbsp; CSc a > | KI | discrete mathematics, logic |
Mgr. & nbsp; Vinař, & nbsp; PhD | KAI | bioinformatics |
RNDr. & nbsp; Imrich & nbsp; Vrťo, & nbsp; DrSc. | SAS / MU | distributed algorithms, graph-theoretical methods |
It is also possible to cooperate with an external supervisor (eg at SAS), as long as it meets the qualification requirements (scientific-pedagogical title of associate professor or scientific qualification level IIa), but such a supervisor must be approved in advance by the scientific council of the faculty. You can get more information by consulting with the guarantor of the doctoral study of informatics, prof. Branislav Rovan.
Note: The above-mentioned employees meet the relevant qualification criteria, not all of them are currently necessarily approved as supervisors of doctoral studies in informatics. The scientific council of the faculty usually performs this task only after the topic has been announced. Some of the above-mentioned potential trainers may already have a full training capacity.