|
Email:
|
viliam.geffert@upjs.sk | |
|
Homepage:
|
https://www.upjs.sk/PF/zamestnanec/viliam.geffert | |
|
Faculty:
|
PF UPJŠ
-
Pavol Jozef Šafárik University in Košice, Faculty of Science
|
|
|
Department:
|
ÚINF
-
Institute of Computer Science
|
|
|
Office:
|
SJ1O83 | |
|
Phone:
|
+421 55 234 2588 | |
|
ORCID ID:
|
0000-0001-9143-1476 |
|
Overview of the responsibility for
the delivery, development and quality assurance of the study programme or its part
at the university in the current academic year
|
|
Study programme: Ib – Informatics, study field: 18. – informatics, bachelor 1st deg. degree
|
|
Study programme: Im – Informatics, study field: 18. - informatics, master 2nd deg. degree
|
|
Study programme: BIb - Biológy - Informatics, study field: Interdisciplinary study, bachelor 1st deg. degree
|
|
Study programme: BImu - Biology - Informatics, study field: teachers' study, master 2nd deg. degree
|
|
Study programme: ADUIm - Data Analysis and Artificial Intelligence, study field: Interdisciplinary study, aster 2nd deg. degree
|
|
Profile courses
|
|
AFJ1a Automata and formal languages - Ib – Informatics, bachelor 1st deg. degree
|
|
AFJ1b Automata and formal languages II - Ib – Informatics, bachelor 1st deg. degree
|
|
VYZ1 Computational complexity - Im – Informatics, master 2nd deg. degree
|
|
AFJ1a Automata and formal languages - BIb - Biology - Informatics, bachelor 1st deg.. degree
|
|
VYMD Computational complexity and Models of Computation - Id – informatics, Phd. study 3rd deg. degree
|
|
Overview of the responsibility for
the development and quality of the field of habilitation procedure and inaugural procedure
in the current academic year
|
|
Name of the field of habilitation procedure and inaugural procedure:
Informatics, study field to which it is assigned: Informatics
|
|
Selected publications
|
|
ADC – Z.Bednárová, V.Geffert, K.Reinhardt, A.Yakaryilmaz: New results on the minimum amount of useful space, International Journal of Foundations of Computer Science, World Scientific, 2016, Vol.27, No.2, pp.259-281
|
|
ADC – V.Geffert, Z.Bednárová, C.Mereghetti, B.Palano: Boolean language operations on nondeterministic automata with a pushdown of constant height, Journal of Computer and System Sciences, Elsevier, 2017, Vol.90, pp.99-114
|
|
ADC – Z.Bednárová, V.Geffert: Two double-exponential gaps for automata with a limited pushdown, Information and Computation, Elsevier, 2017, Vol.253, pt.3, pp.381-398
|
|
AFC – V.Geffert, Z.Bednárová, A.Szabari: Input-driven pushdown automata for edit distance neighborhood, Proc. of DLT 2019 (Developments in Language Theory), Lecture Notes in Computer Science 11647, Springer-Verlag, 2019, pp. 113-126
|
|
ADC – V.Geffert: Unary coded PSPACE-complete languages in ASPACE(loglog n), Theory of Computing Systems, Springer-Verlag, 2019, Vol.63, No.4, pp.688-714
|
|
Selected projects
|
|
VEGA 1/0479/12 „Combinatorial structures and complexity of algorithms“, 2012-2014, principal investigator |
|
VEGA 1/0177/21 "Decsriptional and Computational Complexity of Automata and Algorithms", 2021-2023, pricipal investigator. Project summary: Efficient representation of languages by transducers and automata, as well as state complexity analysis for alternating automata and combined language operations. Design of time-efficient algorithms in the area of matching and resource allocation problems, and for k-path vertex cover for special types of graphs and their applications. |
|
VEGA 1/0142/15 „Combinatorial structures and complexity of algorithms“, 2015-2017, principal investigator |
|
VEGA 1/0056/18 „Descriptional and computational complexity of automata and algorithms“, 2018-2020, principal investigator |
|
APVV-15-0091 „Efficient algoritms, automata, and data structures“, 2016-2020, principal investigator |
