Die Gruppe der eineindeutigen längentreuen sequentiellen Funktionen. - Gerd Wechsung (J. Inf. Process. Cybern., 1972)

Quasisequentielle Funktionen. - Gerd Wechsung (Acta Cybern., 1973)

Eine verbandstheoretische Klassifikation der längentreuen Wortfunktionen. - Gerd Wechsung (Acta Cybern., 1973)

Funktionen, die von pushdown-Automaten berechnet werden. - Gerd Wechsung (Acta Cybern., 1973)

The Axiomatization Problem of a Theory of Linear Languages. - Gerd Wechsung (MFCS, 1974)

Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes. - Gerd Wechsung (MFCS, 1975)

Eine algebraische Charakterisierung der linearen Sprachen. - Gerd Wechsung (J. Inf. Process. Cybern., 1975)

Minimale und optimale Blumsche Maße. - Gerd Wechsung (J. Inf. Process. Cybern., 1975)

Kompliziertheitstheoretische Charakterisierung der kontextfreien und linearen Sprachen. - Gerd Wechsung (J. Inf. Process. Cybern., 1976)

A Nonlinear Lower Bound for the Formula Complexity of Certain Boolean Functions. - Gerd Wechsung (IFIP Congress, 1977)

Complexity Hierarchies of Oracles. - Klaus W. Wagner; Gerd Wechsung (MFCS, 1977)

Properties of Complexity Classes: A Short Survey. - Gerd Wechsung (MFCS, 1977)

The oscillation complexity and a hierarchy of context-free languages. - Gerd Wechsung (FCT, 1979)

A Crossing Measure for 2-Tape Turing Machines. - Gerd Wechsung (MFCS, 1979)

A Relation Between Space, Return and Dual Return Complexities. - Gerd Wechsung; Andreas Brandstädt (Theor. Comput. Sci., 1979)

A Note on the Return Complexity. - Gerd Wechsung (J. Inf. Process. Cybern., 1980)

On the Boolean closure of NP. - Gerd Wechsung (FCT, 1985)

On Sparse Complete Sets. - Gerd Wechsung (J. Inf. Process. Cybern., 1985)

Nondeterministic Turing Machines with Modified Acceptance. - Thomas Gundermann; Gerd Wechsung (MFCS, 1986)

The Boolean Hierarchy I: Structural Properties. - Jin-yi Cai; Thomas Gundermann; Juris Hartmanis; Lane A. Hemachandra; Vivian Sewelson; Klaus W. Wagner; Gerd Wechsung (SIAM J. Comput., 1988)

On the Power of Probabilistic Polynomial Time: PNP[log] subseteq PP. - Richard Beigel; Lane A. Hemachandra; Gerd Wechsung (SCT, 1989)

Using Randomness to Characterize the Complexity of Computation. - Lane A. Hemachandra; Gerd Wechsung (IFIP Congress, 1989)

The Boolean Hierarchy II: Applications. - Jin-yi Cai; Thomas Gundermann; Juris Hartmanis; Lane A. Hemachandra; Vivian Sewelson; Klaus W. Wagner; Gerd Wechsung (SIAM J. Comput., 1989)

A Survey on Counting Classes. - Thomas Gundermann; Nasser Ali Nasser; Gerd Wechsung (SCT, 1990)

Probabilistic Polynomial Time is Closed under Parity Reductions. - Richard Beigel; Lane A. Hemachandra; Gerd Wechsung (Inf. Process. Lett., 1991)

Kolmogorov Characterizations of Complexity Classes. - Lane A. Hemachandra; Gerd Wechsung (Theor. Comput. Sci., 1991)

New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. - Waldemar Preilowski; Elias Dahlhaus; Gerd Wechsung (MFCS, 1992)

On Sets with Easy Certificates and the Existence of One-Way Permutations. - Lane A. Hemaspaandra; Jörg Rothe; Gerd Wechsung (CIAC, 1997)

Easy Sets and Hard Certificate Schemes. - Lane A. Hemaspaandra; Jörg Rothe; Gerd Wechsung (Acta Informatica, 1997)

The Operators min and max on the Polynomial Hierarchy - Harald Hempel; Gerd Wechsung (Electron. Colloquium Comput. Complex., 1997)

Time Bounded Frequency Computations. - Maren Hinrichs; Gerd Wechsung (Inf. Comput., 1997)

Embedding ladders and caterpillars into the hypercube. - Sergei L. Bezrukov; Burkhard Monien; Walter Unger; Gerd Wechsung (Discret. Appl. Math., 1998)

Query Order. - Lane A. Hemaspaandra; Harald Hempel; Gerd Wechsung (SIAM J. Comput., 1998)

Self-Specifying Machines. - Lane A. Hemaspaandra; Harald Hempel; Gerd Wechsung (Int. J. Found. Comput. Sci., 1999)

Robust Reductions. - Jin-yi Cai; Lane A. Hemaspaandra; Gerd Wechsung (Theory Comput. Syst., 1999)

Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. - André Große; Jörg Rothe; Gerd Wechsung (ICTCS, 2001)

A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs - André Große; Jörg Rothe; Gerd Wechsung (CoRR, 2001)

Reducing the Number of Solutions of NP Functions. - Lane A. Hemaspaandra; Mitsunori Ogihara; Gerd Wechsung (J. Comput. Syst. Sci., 2002)

Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. - André Große; Jörg Rothe; Gerd Wechsung (Theory Comput. Syst., 2002)

The Minimization Problem for Boolean Formulas. - Edith Hemaspaandra; Gerd Wechsung (SIAM J. Comput., 2002)

Relativizing Function Classes. - Christian Glaßer; Gerd Wechsung (J. Univers. Comput. Sci., 2003)

On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. - André Große; Jörg Rothe; Gerd Wechsung (Inf. Process. Lett., 2006)

Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube. - Burkhard Monien; Gerd Wechsung (J. Graph Theory, 2018)