A Machine Independent Description of Complexity Classes, Definable by Nondeterministic as well as Determinsitic Turing Machines with Primitive Pecursove Tape or Time Bounds. - Hagen Huwig (MFCS, 1976)

Das Äquivalenzproblem für spezielle klassen von Loop-1-programmen. - Hagen Huwig; Volker Claus (Theoretical Computer Science, 1977)

A criterion common to various continuous completions of albegras and X-categories. - Hagen Huwig; Axel Poigné (CLAAP, 1980)

Das P=NP-Problem in der Kategorie der partiellen Ordnungen mit 2-stelligen Suprema. - Hagen Huwig (GI Jahrestagung, 1980)

A Definition of the P=NP-Problem in Categories. - Hagen Huwig (FCT, 1981)

Ein Modell des P=NP -Problems mit einer positiven Lösung. - Hagen Huwig (Acta Informatica, 1982)

Diagonalizing over Deterministic Polynomial Time. - Klaus Ambos-Spies; Hans Fleischhack; Hagen Huwig (CSL, 1987)

Diagonalizations over Polynomial Time Computable Sets. - Klaus Ambos-Spies; Hans Fleischhack; Hagen Huwig (Theor. Comput. Sci., 1987)

A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category. - Hagen Huwig; Axel Poigné (Theor. Comput. Sci., 1990)