Viliam Geffert Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. [Citation Graph (0, 0)][DBLP] ICALP, 1990, pp:111-124 [Conf]
Viliam Geffert How to Generate Languages Using Only Two Pairs of Parentheses. [Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1991, v:27, n:5/6, pp:303-315 [Journal]
Viliam Geffert Sublogarithmic Sigma2-Space is not Closed under Complement and Other Separation Results. [Citation Graph (0, 0)][DBLP] ITA, 1993, v:27, n:4, pp:349-366 [Journal]
Viliam Geffert A Hierarchy That Does Not Collapse: Alternations in Low Level Space. [Citation Graph (0, 0)][DBLP] ITA, 1994, v:28, n:5, pp:465-512 [Journal]
Viliam Geffert Translation of binary regular expressions into nondeterministic [epsiv]-free automata with transitions. [Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:66, n:3, pp:451-472 [Journal]
Viliam Geffert Nondeterministic Computations in Sublogarithmic Space and Space Constructibility. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1991, v:20, n:3, pp:484-498 [Journal]
Viliam Geffert Tally Versions of the Savitch and Immerman-Szelepcsenyi Theorems for Sublogarithmic Space. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1993, v:22, n:1, pp:102-113 [Journal]
Viliam Geffert A Representation of Recursively Enumerable Languages by Two Homomorphisms and a Quotient. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1988, v:62, n:3, pp:235-249 [Journal]
Viliam Geffert A Communication Hierarchy of Parallel Computations. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:198, n:1-2, pp:99-130 [Journal]