The Complexity of Checking Identities over Finite Groups. - Gábor Horváth 004; Csaba A. Szabó (Int. J. Algebra Comput., 2006)

An assertion concerning functionally complete algebras and NP-completeness. - Gábor Horváth 004; Chrystopher L. Nehaniv; Csaba A. Szabó (Theor. Comput. Sci., 2008)

The extended equivalence and equation solvability problems for groups. - Gábor Horváth 004; Csaba A. Szabó (Discret. Math. Theor. Comput. Sci., 2011)

On Free Algebras in Varieties Generated by Iterated Semidirect Products of Semilattices. - Gábor Horváth 004; Kamilla Kátai-Urbán; Péter Pál Pach; Gabriella Pluhár; András Pongrácz; Csaba A. Szabó (Int. J. Algebra Comput., 2012)

Length of polynomials over finite groups. - Gábor Horváth 004; Chrystopher L. Nehaniv (J. Comput. Syst. Sci., 2015)

The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs. - Gábor Horváth 004; Chrystopher L. Nehaniv; Károly Podoski (Int. J. Algebra Comput., 2017)

Congruence preserving expansions of nilpotent algebras. - Erhard Aichinger; Gábor Horváth 004 (Int. J. Algebra Comput., 2020)

The complexity of the equation solvability and equivalence problems over finite groups. - Attila Földvári; Gábor Horváth 004 (Int. J. Algebra Comput., 2020)