Algorithms for near-rings of non-linear transformations. - Franz Binder; Erhard Aichinger; Jürgen Ecker; Christof Nöbauer; Peter Mayr 001 (ISSAC, 2000)

A Bound on The Number of Unary Polynomial Functions and a Decidability Result for Near-Rings. - Erhard Aichinger (Int. J. Algebra Comput., 2005)

Every (k+1)-affine Complete Nilpotent Group of Class K Is Affine Complete. - Erhard Aichinger; Jürgen Ecker (Int. J. Algebra Comput., 2006)

Sequences of Commutator Operations. - Erhard Aichinger; Nebojsa Mudrinski (Order, 2013)

Independence of algebras with edge term. - Erhard Aichinger; Peter Mayr 001 (Int. J. Algebra Comput., 2015)

Sonata: a GAP tool for nearring computations. - Erhard Aichinger; Rika Yatchak (ACM Commun. Comput. Algebra, 2016)

Complexity of term representations of finitary functions. - Erhard Aichinger; Nebojsa Mudrinski; Jakub Oprsal (Int. J. Algebra Comput., 2018)

Solving Systems of Equations in Supernilpotent Algebras. - Erhard Aichinger (MFCS, 2019)

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

Finite representation of commutator sequences. - Erhard Aichinger; Nebojsa Mudrinski (Int. J. Algebra Comput., 2022)

The Complexity of Checking Quasi-Identities over Finite Algebras with a Mal'cev Term. - Erhard Aichinger; Simon Grünbacher (STACS, 2023)

On NP-Complete Search Problems on Finite Algebras. - Bernardo Rossi; Erhard Aichinger (ISMVL, 2024)

Zero testing and equation solving for sparse polynomials on rectangular domains. - Erhard Aichinger; Simon Grünbacher; Paul Hametner (Finite Fields Their Appl., 2024)

On the complexity of solving equations over the symmetric group S4. - Erhard Aichinger; Simon Grünbacher (CoRR, 2025)