Bednárová, Zuzana; Geffert, Viliam; Reinhardt, Klaus; Yakaryilmaz, Abuzer New results on the minimum amount of useful space. (English) Zbl 1338.68138 Int. J. Found. Comput. Sci. 27, No. 2, 259-281 (2016). MSC: 68Q45 68Q05 PDF BibTeX XML Cite \textit{Z. Bednárová} et al., Int. J. Found. Comput. Sci. 27, No. 2, 259--281 (2016; Zbl 1338.68138) Full Text: DOI
Geffert, Viliam; Pardubská, Dana Unary coded NP-complete languages in \(\mathrm{ASpace}(\log \log n)\). (English) Zbl 1298.68134 Int. J. Found. Comput. Sci. 24, No. 7, 1167-1182 (2013). MSC: 68Q45 68Q15 68Q17 PDF BibTeX XML Cite \textit{V. Geffert} and \textit{D. Pardubská}, Int. J. Found. Comput. Sci. 24, No. 7, 1167--1182 (2013; Zbl 1298.68134) Full Text: DOI
Geffert, Viliam (ed.); Pighizzini, Giovanni (ed.) Special issue: Descriptional complexity of formal systems (DCFS) 2007. Selected papers based on the presentations at the workshop, Nový Smokovec, Slovakia, July 20–22, 2007. (English) Zbl 1168.68312 Int. J. Found. Comput. Sci. 19, No. 4, 747-1084 (2008). MSC: 68-06 00B25 68Q19 PDF BibTeX XML Cite \textit{V. Geffert} (ed.) and \textit{G. Pighizzini} (ed.), Int. J. Found. Comput. Sci. 19, No. 4, 747--1084 (2008; Zbl 1168.68312)