Bednárová, Zuzana; Geffert, Viliam; Mereghetti, Carlo; Palano, Beatrice The size-cost of Boolean operations on constant height deterministic pushdown automata. (English) Zbl 1272.68205 Theor. Comput. Sci. 449, 23-36 (2012). MSC: 68Q45 68Q19 PDF BibTeX XML Cite \textit{Z. Bednárová} et al., Theor. Comput. Sci. 449, 23--36 (2012; Zbl 1272.68205) Full Text: DOI
Geffert, Viliam An alternating hierarchy for finite automata. (English) Zbl 1255.68095 Theor. Comput. Sci. 445, 1-24 (2012). Reviewer: Giovanni Pighizzini (Milano) MSC: 68Q45 68Q15 PDF BibTeX XML Cite \textit{V. Geffert}, Theor. Comput. Sci. 445, 1--24 (2012; Zbl 1255.68095) Full Text: DOI
Geffert, Viliam; Gajdoš, Jozef Multiway in-place merging. (English) Zbl 1191.68223 Theor. Comput. Sci. 411, No. 16-18, 1793-1808 (2010). MSC: 68P10 68W05 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{J. Gajdoš}, Theor. Comput. Sci. 411, No. 16--18, 1793--1808 (2010; Zbl 1191.68223) Full Text: DOI
Geffert, Viliam; Mereghetti, Carlo; Pighizzini, Giovanni Converting two-way nondeterministic unary automata into simpler automata. (English) Zbl 1045.68080 Theor. Comput. Sci. 295, No. 1-3, 189-203 (2003). MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Geffert} et al., Theor. Comput. Sci. 295, No. 1--3, 189--203 (2003; Zbl 1045.68080) Full Text: DOI
Geffert, Viliam Space hierarchy theorem revised. (English) Zbl 1038.68053 Theor. Comput. Sci. 295, No. 1-3, 171-187 (2003). MSC: 68Q25 PDF BibTeX XML Cite \textit{V. Geffert}, Theor. Comput. Sci. 295, No. 1--3, 171--187 (2003; Zbl 1038.68053) Full Text: DOI
Geffert, V. A variant of inductive counting. (English) Zbl 0939.68050 Theor. Comput. Sci. 237, No. 1-2, 465-475 (2000). MSC: 68Q25 PDF BibTeX XML Cite \textit{V. Geffert}, Theor. Comput. Sci. 237, No. 1--2, 465--475 (2000; Zbl 0939.68050) Full Text: DOI
Geffert, V.; Katajainen, J.; Pasanen, T. Asymptotically efficient in-place merging. (English) Zbl 0939.68160 Theor. Comput. Sci. 237, No. 1-2, 159-181 (2000). MSC: 68W05 68P10 PDF BibTeX XML Cite \textit{V. Geffert} et al., Theor. Comput. Sci. 237, No. 1--2, 159--181 (2000; Zbl 0939.68160) Full Text: DOI
Geffert, Viliam A communication hierarchy of parallel computations. (English) Zbl 0902.68074 Theor. Comput. Sci. 198, No. 1-2, 99-130 (1998). MSC: 68Q10 PDF BibTeX XML Cite \textit{V. Geffert}, Theor. Comput. Sci. 198, No. 1--2, 99--130 (1998; Zbl 0902.68074) Full Text: DOI
Geffert, Viliam A speed-up theorem without tape compression. (English) Zbl 0796.68087 Theor. Comput. Sci. 118, No. 1, 49-65 (1993). Reviewer: P.van Emde Boas (Amsterdam) MSC: 68Q05 68Q10 68Q25 PDF BibTeX XML Cite \textit{V. Geffert}, Theor. Comput. Sci. 118, No. 1, 49--65 (1993; Zbl 0796.68087) Full Text: DOI
Geffert, Viliam A representation of recursively enumerable languages by two homomorphisms and a quotient. (English) Zbl 0664.68075 Theor. Comput. Sci. 62, No. 3, 235-249 (1988). Reviewer: G.Slutzki MSC: 68Q45 PDF BibTeX XML Cite \textit{V. Geffert}, Theor. Comput. Sci. 62, No. 3, 235--249 (1988; Zbl 0664.68075) Full Text: DOI