A Polynomial Algorithm for Testing Congruence Modularity. - Christian Herrmann 003; Marcel Wild (Int. J. Algebra Comput., 1996)

On the Size of Boolean Combinations of Subgroups of Finite Abelian Groups. - Christian Herrmann 003 (Order, 2000)

Corrigendum to "On the undecidability of implications between embedded multivalued database dependencies" [Inform. and Comput. 122(1995) 221-235]. - Christian Herrmann 003 (Inf. Comput., 2006)

Corrigendum: Gluings of Modular Lattices. - Christian Herrmann 003 (Order, 2006)

Expressiveness and Computational Complexity of Geometric Quantum Logic - Christian Herrmann 003; Martin Ziegler 001 (CoRR, 2010)

On the equational theory of projection lattices of finite von Neumann factors. - Christian Herrmann 003 (J. Symb. Log., 2010)

Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines. - Christian Herrmann 003; Johanna Sokoli; Martin Ziegler 001 (MCU, 2013)

On the consistency problem for modular lattices and related structures. - Christian Herrmann 003; Yasuyuki Tsukamoto; Martin Ziegler 001 (Int. J. Algebra Comput., 2016)

Computational Complexity of Quantum Satisfiability. - Christian Herrmann 003; Martin Ziegler 001 (J. ACM, 2016)

Homogeneous Modular Lattices are Distributive. - Christian Herrmann 003 (Order, 2016)