Loading AI tools
Slovak theoretical computer scientist From Wikipedia, the free encyclopedia
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.
Viliam Geffert | |
---|---|
Born | 1955 (age 68–69) |
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 |
Geffert did his undergraduate studies at the P. J. Šafárik University, graduating in 1979. He earned his PhD degree in 1988 from the Comenius University in Bratislava. Since 2003, he is a full professor of the P. J. Šafárik University.
Seamless Wikipedia browsing. On steroids.
Every time you click a link to Wikipedia, Wiktionary or Wikiquote in your browser's search results, it will show the modern Wikiwand interface.
Wikiwand extension is a five stars, simple, with minimum permission required to keep your browsing private, safe and transparent.