The Complexity of Sparse Polynomial Interpolation over Finite Fields. - Kai Werther (Appl. Algebra Eng. Commun. Comput., 1994)

Exakte Lernbarkeit algebraischer und kombinatorischer Objekte. - Kai Werther (1994)

On real Turing machines that toss coins. - Felipe Cucker; Marek Karpinski; Pascal Koiran; Thomas Lickteig; Kai Werther (STOC, 1995)

How can a Complex Square Root be Computed in an Optimal Way. - Thomas Lickteig; Kai Werther (Comput. Complex., 1995)

Verification of component architectures using mode-based contracts. - Stefan Kugele; Diego Marmsoler; Núria Mata; Kai Werther (MEMOCODE, 2016)