Viliam Geffert
From Wikipedia, the free encyclopedia
Born1955 (age 69–70)
AlmamaterP. J. Šafárik University, Comenius University
Knownforstate complexity, small-space complexity
Viliam Geffert | |
|---|---|
| Born | 1955 (age 69–70) |
| Alma mater | P. J. Šafárik University, Comenius University |
| Known for | state complexity, small-space complexity |
| Scientific career | |
| Fields | Automata theory, computational complexity |
| Institutions | P. J. Šafárik University |
Viliam Geffert (born 1955) is a Slovak theoretical computer scientist known for his contributions to the computational complexity theory in sublogarithmic space[1][2] and to the state complexity of two-way finite automata.[3][4] He has also developed new in-place sorting algorithms.[5][6] He is a professor and the head of the computer science department at the P. J. Šafárik University in Košice.
