Gerd Wechsung

Publication Activity (10 Years)

Years Active: 1972-2018
Publications (10 Years): 1

Top Topics

Optimal Control

Arbitrary Length

Top Venues

J. Graph Theory

Publications

Burkhard Monien, Gerd Wechsung
Balanced caterpillars of maximum degree 3 and with hairs of arbitrary length are subgraphs of their optimal hypercube. J. Graph Theory 87 (4) (2018)
André Große, Jörg Rothe, Gerd Wechsung
On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Inf. Process. Lett. 99 (6) (2006)
Christian Glaßer, Gerd Wechsung
Relativizing Function Classes. J. Univers. Comput. Sci. 9 (1) (2003)
André Große, Jörg Rothe, Gerd Wechsung
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. Theory Comput. Syst. 35 (1) (2002)
Edith Hemaspaandra, Gerd Wechsung
The Minimization Problem for Boolean Formulas. SIAM J. Comput. 31 (6) (2002)
Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung
Reducing the Number of Solutions of NP Functions. J. Comput. Syst. Sci. 64 (2) (2002)
André Große, Jörg Rothe, Gerd Wechsung
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. ICTCS (2001)
André Große, Jörg Rothe, Gerd Wechsung
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones CoRR (2001)
André Große, Jörg Rothe, Gerd Wechsung
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs CoRR (2001)
Lane A. Hemaspaandra, Mitsunori Ogihara, Gerd Wechsung
Reducing the Number of Solutions of NP Functions. MFCS (2000)
Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy. Int. J. Found. Comput. Sci. 11 (2) (2000)
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Self-Specifying Machines. Int. J. Found. Comput. Sci. 10 (3) (1999)
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Self-Specifying Machines CoRR (1999)
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Query Order CoRR (1999)
Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
Easy Sets and Hard Certificate Schemes CoRR (1999)
Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
Robust Reductions CoRR (1999)
Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
Robust Reductions. Theory Comput. Syst. 32 (6) (1999)
Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung
Robust Reductions. COCOON (1998)
Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung
Query Order. SIAM J. Comput. 28 (2) (1998)
Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung
Embedding ladders and caterpillars into the hypercube. Discret. Appl. Math. 83 (1-3) (1998)
Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
On Sets with Easy Certificates and the Existence of One-Way Permutations. CIAC (1997)
Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy Electron. Colloquium Comput. Complex. 4 (25) (1997)
Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
Easy Sets and Hard Certificate Schemes. Acta Informatica 34 (11) (1997)
Maren Hinrichs, Gerd Wechsung
Time Bounded Frequency Computations. Computational Complexity Conference (1997)
Maren Hinrichs, Gerd Wechsung
Time Bounded Frequency Computations. Inf. Comput. 139 (2) (1997)
Edith Hemaspaandra, Gerd Wechsung
The Minimization Problem for Boolean Formulas. FOCS (1997)
Harald Hempel, Gerd Wechsung
The Operators min and max on the Polynomial Hierarchy. STACS (1997)
Waldemar Preilowski, Elias Dahlhaus, Gerd Wechsung
New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. MFCS (1992)
Lane A. Hemachandra, Gerd Wechsung
Kolmogorov Characterizations of Complexity Classes. Theor. Comput. Sci. 83 (2) (1991)
Richard Beigel, Lane A. Hemachandra, Gerd Wechsung
Probabilistic Polynomial Time is Closed under Parity Reductions. Inf. Process. Lett. 37 (2) (1991)
Thomas Gundermann, Nasser Ali Nasser, Gerd Wechsung
A Survey on Counting Classes. Computational Complexity Conference (1990)
Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
The Boolean Hierarchy II: Applications. SIAM J. Comput. 18 (1) (1989)
Richard Beigel, Lane A. Hemachandra, Gerd Wechsung
subseteq PP. Computational Complexity Conference (1989)
Lane A. Hemachandra, Gerd Wechsung
Using Randomness to Characterize the Complexity of Computation. IFIP Congress (1989)
Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner, Gerd Wechsung
The Boolean Hierarchy I: Structural Properties. SIAM J. Comput. 17 (6) (1988)
Thomas Gundermann, Gerd Wechsung
Nondeterministic Turing Machines with Modified Acceptance. MFCS (1986)
Gerd Wechsung
On the Boolean closure of NP. FCT (1985)
Gerd Wechsung
On Sparse Complete Sets. J. Inf. Process. Cybern. 21 (4/5) (1985)
Gerd Wechsung
On Sparse Complete Sets. Math. Log. Q. 31 (14-18) (1985)
Gerd Wechsung
A Note on the Return Complexity. J. Inf. Process. Cybern. 16 (4) (1980)
Gerd Wechsung, Andreas Brandstädt
A Relation Between Space, Return and Dual Return Complexities. Theor. Comput. Sci. 9 (1979)
Gerd Wechsung
The oscillation complexity and a hierarchy of context-free languages. FCT (1979)
Gerd Wechsung
A Crossing Measure for 2-Tape Turing Machines. MFCS (1979)
Gerd Wechsung
A Nonlinear Lower Bound for the Formula Complexity of Certain Boolean Functions. IFIP Congress (1977)
Gerd Wechsung
Properties of Complexity Classes: A Short Survey. MFCS (1977)
Klaus W. Wagner, Gerd Wechsung
Complexity Hierarchies of Oracles. MFCS (1977)
Gerd Wechsung
Kompliziertheitstheoretische Charakterisierung der kontextfreien und linearen Sprachen. J. Inf. Process. Cybern. 12 (6) (1976)
Gerd Wechsung
Eine algebraische Charakterisierung der linearen Sprachen. J. Inf. Process. Cybern. 11 (1/2) (1975)
Gerd Wechsung
Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes. MFCS (1975)
Gerd Wechsung
Minimale und optimale Blumsche Maße. J. Inf. Process. Cybern. 11 (10-12) (1975)
Gerd Wechsung
The Axiomatization Problem of a Theory of Linear Languages. MFCS (1974)
Gerd Wechsung
Quasisequentielle Funktionen. Acta Cybern. 2 (1) (1973)
Gerd Wechsung
Eine verbandstheoretische Klassifikation der längentreuen Wortfunktionen. Acta Cybern. 2 (1) (1973)
Gerd Wechsung
Funktionen, die von pushdown-Automaten berechnet werden. Acta Cybern. 2 (2) (1973)
Gerd Wechsung
Die Gruppe der eineindeutigen längentreuen sequentiellen Funktionen. J. Inf. Process. Cybern. 8 (6/7) (1972)