 | 2006 |
|---|
| 53 |       | 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): 215-221 (2006) |
| 2003 |
|---|
| 52 | | Christian Glaßer,
Gerd Wechsung:
Relativizing Function Classes.
J. UCS 9(1): 34-50 (2003) |
| 2002 |
|---|
| 51 | | Lane A. Hemaspaandra,
Mitsunori Ogihara,
Gerd Wechsung:
Reducing the Number of Solutions of NP Functions.
J. Comput. Syst. Sci. 64(2): 311-328 (2002) |
| 50 | | Edith Hemaspaandra,
Gerd Wechsung:
The Minimization Problem for Boolean Formulas.
SIAM J. Comput. 31(6): 1948-1958 (2002) |
| 49 | | André Große,
Jörg Rothe,
Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones.
Theory Comput. Syst. 35(1): 81-93 (2002) |
| 2001 |
|---|
| 48 | | André Große,
Jörg Rothe,
Gerd Wechsung:
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions.
ICTCS 2001: 339-356 |
| 47 | | André Große,
Jörg Rothe,
Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones
CoRR cs.CC/0106041: (2001) |
| 46 | | André Große,
Jörg Rothe,
Gerd Wechsung:
A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs
CoRR cs.CC/0106045: (2001) |
| 2000 |
|---|
| 45 | | Lane A. Hemaspaandra,
Mitsunori Ogihara,
Gerd Wechsung:
Reducing the Number of Solutions of NP Functions.
MFCS 2000: 394-404 |
| 44 |  | Harald Hempel,
Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy.
Int. J. Found. Comput. Sci. 11(2): 315-342 (2000) |
| 1999 |
|---|
| 43 | | Jin-yi Cai,
Lane A. Hemaspaandra,
Gerd Wechsung:
Robust Reductions
CoRR cs.CC/9906033: (1999) |
| 42 | | Lane A. Hemaspaandra,
Jörg Rothe,
Gerd Wechsung:
Easy Sets and Hard Certificate Schemes
CoRR cs.CC/9907035: (1999) |
| 41 | | Lane A. Hemaspaandra,
Harald Hempel,
Gerd Wechsung:
Query Order
CoRR cs.CC/9909020: (1999) |
| 40 | | Lane A. Hemaspaandra,
Harald Hempel,
Gerd Wechsung:
Self-Specifying Machines
CoRR cs.CC/9910006: (1999) |
| 39 | | Lane A. Hemaspaandra,
Harald Hempel,
Gerd Wechsung:
Self-Specifying Machines.
Int. J. Found. Comput. Sci. 10(3): 263-276 (1999) |
| 38 | | Jin-yi Cai,
Lane A. Hemaspaandra,
Gerd Wechsung:
Robust Reductions.
Theory Comput. Syst. 32(6): 625-647 (1999) |
| 1998 |
|---|
| 37 | | Jin-yi Cai,
Lane A. Hemaspaandra,
Gerd Wechsung:
Robust Reductions.
COCOON 1998: 174-183 |
| 36 | | Sergei L. Bezrukov,
Burkhard Monien,
Walter Unger,
Gerd Wechsung:
Embedding ladders and caterpillars into the hypercube.
Discrete Applied Mathematics 83(1-3): 21-29 (1998) |
| 35 | | Lane A. Hemaspaandra,
Harald Hempel,
Gerd Wechsung:
Query Order.
SIAM J. Comput. 28(2): 637-651 (1998) |
| 1997 |
|---|
| 34 | | Lane A. Hemaspaandra,
Jörg Rothe,
Gerd Wechsung:
On Sets with Easy Certificates and the Existence of One-Way Permutations.
CIAC 1997: 264-275 |
| 33 | | Edith Hemaspaandra,
Gerd Wechsung:
The Minimization Problem for Boolean Formulas.
FOCS 1997: 575-584 |
| 32 | | Maren Hinrichs,
Gerd Wechsung:
Time Bounded Frequency Computations.
IEEE Conference on Computational Complexity 1997: 185-192 |
| 31 | | Harald Hempel,
Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy.
STACS 1997: 93-104 |
| 30 | | Lane A. Hemaspaandra,
Jörg Rothe,
Gerd Wechsung:
Easy Sets and Hard Certificate Schemes.
Acta Inf. 34(11): 859-879 (1997) |
| 29 | | Harald Hempel,
Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy
Electronic Colloquium on Computational Complexity (ECCC) 4(25): (1997) |
| 28 | | Maren Hinrichs,
Gerd Wechsung:
Time Bounded Frequency Computations.
Inf. Comput. 139(2): 234-257 (1997) |
| 1992 |
|---|
| 27 | | W. Preilowski,
Elias Dahlhaus,
Gerd Wechsung:
New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space.
MFCS 1992: 442-450 |
| 1991 |
|---|
| 26 | | Richard Beigel,
Lane A. Hemachandra,
Gerd Wechsung:
Probabilistic Polynomial Time is Closed under Parity Reductions.
Inf. Process. Lett. 37(2): 91-94 (1991) |
| 25 | | Lane A. Hemachandra,
Gerd Wechsung:
Kolmogorov Characterizations of Complexity Classes.
Theor. Comput. Sci. 83(2): 313-322 (1991) |
| 1990 |
|---|
| 24 | | Thomas Gundermann,
Nasser Ali Nasser,
Gerd Wechsung:
A Survey on Counting Classes.
Structure in Complexity Theory Conference 1990: 140-153 |
| 1989 |
|---|
| 23 | | Lane A. Hemachandra,
Gerd Wechsung:
Using Randomness to Characterize the Complexity of Computation.
IFIP Congress 1989: 281-286 |
| 22 | | Richard Beigel,
Lane A. Hemachandra,
Gerd Wechsung:
On the Power of Probabilistic Polynomial Time: PNP[log] subseteq PP.
Structure in Complexity Theory Conference 1989: 225-227 |
| 21 | | 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): 95-111 (1989) |
| 1988 |
|---|
| 20 | | 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): 1232-1252 (1988) |
| 1986 |
|---|
| 19 | | Thomas Gundermann,
Gerd Wechsung:
Nondeterministic Turing Machines with Modified Acceptance.
MFCS 1986: 396-404 |
| 1985 |
|---|
| 18 | | Gerd Wechsung:
On the Boolean closure of NP.
FCT 1985: 485-493 |
| 17 | | Gerd Wechsung:
On Sparse Complete Sets.
Elektronische Informationsverarbeitung und Kybernetik 21(4/5): 253-254 (1985) |
| 1980 |
|---|
| 16 | | Gerd Wechsung:
A Note on the Return Complexity.
Elektronische Informationsverarbeitung und Kybernetik 16(4): 139-146 (1980) |
| 1979 |
|---|
| 15 | | Gerd Wechsung:
The oscillation complexity and a hierarchy of context-free languages.
FCT 1979: 508-515 |
| 14 | | Gerd Wechsung:
A Crossing Measure for 2-Tape Turing Machines.
MFCS 1979: 508-516 |
| 13 | | Gerd Wechsung,
Andreas Brandstädt:
A Relation Between Space, Return and Dual Return Complexities.
Theor. Comput. Sci. 9: 127-140 (1979) |
| 1977 |
|---|
| 12 | | Gerd Wechsung:
A Nonlinear Lower Bound for the Formula Complexity of Certain Boolean Functions.
IFIP Congress 1977: 831-833 |
| 11 | | Gerd Wechsung:
Properties of Complexity Classes: A Short Survey.
MFCS 1977: 177-191 |
| 10 | | Klaus W. Wagner,
Gerd Wechsung:
Complexity Hierarchies of Oracles.
MFCS 1977: 543-548 |
| 1976 |
|---|
| 9 | | Gerd Wechsung:
Funktionen, die von pushdown-Automaten berechnet werden.
Acta Cybern. 2: 115-134 (1976) |
| 8 | | Gerd Wechsung:
Quasisequentielle Funktionen.
Acta Cybern. 2: 23-33 (1976) |
| 7 | | Gerd Wechsung:
Eine verbandstheoretische Klassifikation der längentreuen Wortfunktionen.
Acta Cybern. 2: 39-46 (1976) |
| 6 | | Gerd Wechsung:
Kompliziertheitstheoretische Charakterisierung der kontextfreien und linearen Sprachen.
Elektronische Informationsverarbeitung und Kybernetik 12(6): 289-300 (1976) |
| 1975 |
|---|
| 5 | | Gerd Wechsung:
Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes.
MFCS 1975: 457-461 |
| 4 | | Gerd Wechsung:
Eine algebraische Charakterisierung der linearen Sprachen.
Elektronische Informationsverarbeitung und Kybernetik 11(1/2): 19-25 (1975) |
| 3 | | Gerd Wechsung:
Minimale und optimale Blumsche Maße.
Elektronische Informationsverarbeitung und Kybernetik 11(10-12): 673-679 (1975) |
| 1974 |
|---|
| 2 | | Gerd Wechsung:
The Axiomatization Problem of a Theory of Linear Languages.
MFCS 1974: 298-302 |
| 1972 |
|---|
| 1 | | Gerd Wechsung:
Die Gruppe der eineindeutigen längentreuen sequentiellen Funktionen.
Elektronische Informationsverarbeitung und Kybernetik 8(6/7): 335-351 (1972) |
