default search action
Gerd Wechsung
Person information
- affiliation: Friedrich Schiller University of Jena, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j28]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): 561-580 (2018)
2000 – 2009
- 2006
- [j27]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
- [j26]Christian Glaßer, Gerd Wechsung:
Relativizing Function Classes. J. Univers. Comput. Sci. 9(1): 34-50 (2003) - 2002
- [j25]Lane A. Hemaspaandra
Reducing the Number of Solutions of NP Functions. J. Comput. Syst. Sci. 64(2): 311-328 (2002) - [j24]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) - [j23]Edith Hemaspaandra, Gerd Wechsung:
The Minimization Problem for Boolean Formulas. SIAM J. Comput. 31(6): 1948-1958 (2002) - 2001
- [c20]André Große, Jörg Rothe, Gerd Wechsung:
Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. ICTCS 2001: 339-356 - [i7]André Große, Jörg Rothe, Gerd Wechsung:
Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. CoRR cs.CC/0106041 (2001) - [i6]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
- [j22]Harald Hempel, Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy. Int. J. Found. Comput. Sci. 11(2): 315-342 (2000) - [c19]Lane A. Hemaspaandra
Reducing the Number of Solutions of NP Functions. MFCS 2000: 394-404
1990 – 1999
- 1999
- [j21]Lane A. Hemaspaandra
Self-Specifying Machines. Int. J. Found. Comput. Sci. 10(3): 263-276 (1999) - [j20]Jin-yi Cai, Lane A. Hemaspaandra
Robust Reductions. Theory Comput. Syst. 32(6): 625-647 (1999) - [i5]Jin-yi Cai, Lane A. Hemaspaandra, Gerd Wechsung:
Robust Reductions. CoRR cs.CC/9906033 (1999) - [i4]Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung:
Easy Sets and Hard Certificate Schemes. CoRR cs.CC/9907035 (1999) - [i3]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Query Order. CoRR cs.CC/9909020 (1999) - [i2]Lane A. Hemaspaandra, Harald Hempel, Gerd Wechsung:
Self-Specifying Machines. CoRR cs.CC/9910006 (1999) - 1998
- [j19]Sergei L. Bezrukov, Burkhard Monien, Walter Unger, Gerd Wechsung:
Embedding ladders and caterpillars into the hypercube. Discret. Appl. Math. 83(1-3): 21-29 (1998) - [j18]Lane A. Hemaspaandra
Query Order. SIAM J. Comput. 28(2): 637-651 (1998) - [c18]Jin-yi Cai, Lane A. Hemaspaandra
Robust Reductions. COCOON 1998: 174-183 - 1997
- [j17]Lane A. Hemaspaandra
Easy Sets and Hard Certificate Schemes. Acta Informatica 34(11): 859-879 (1997) - [j16]Maren Hinrichs, Gerd Wechsung:
Time Bounded Frequency Computations. Inf. Comput. 139(2): 234-257 (1997) - [c17]Lane A. Hemaspaandra
On Sets with Easy Certificates and the Existence of One-Way Permutations. CIAC 1997: 264-275 - [c16]Maren Hinrichs, Gerd Wechsung:
Time Bounded Frequency Computations. CCC 1997: 185-192 - [c15]Edith Hemaspaandra, Gerd Wechsung:
The Minimization Problem for Boolean Formulas. FOCS 1997: 575-584 - [c14]Harald Hempel, Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy. STACS 1997: 93-104 - [i1]Harald Hempel, Gerd Wechsung:
The Operators min and max on the Polynomial Hierarchy. Electron. Colloquium Comput. Complex. TR97 (1997) - 1992
- [c13]Waldemar Preilowski, Elias Dahlhaus, Gerd Wechsung:
New Parallel Algorithms for Convex Hull and Triangulation in 3-Dimensional Space. MFCS 1992: 442-450 - 1991
- [j15]Richard Beigel, Lane A. Hemachandra
Probabilistic Polynomial Time is Closed under Parity Reductions. Inf. Process. Lett. 37(2): 91-94 (1991) - [j14]Lane A. Hemachandra
Kolmogorov Characterizations of Complexity Classes. Theor. Comput. Sci. 83(2): 313-322 (1991) - 1990
- [c12]Thomas Gundermann, Nasser Ali Nasser, Gerd Wechsung:
A Survey on Counting Classes. SCT 1990: 140-153
1980 – 1989
- 1989
- [j13]Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra
The Boolean Hierarchy II: Applications. SIAM J. Comput. 18(1): 95-111 (1989) - [c11]Richard Beigel, Lane A. Hemachandra
On the Power of Probabilistic Polynomial Time: PNP[log] subseteq PP. SCT 1989: 225-227 - [c10]Lane A. Hemachandra, Gerd Wechsung:
Using Randomness to Characterize the Complexity of Computation. IFIP Congress 1989: 281-286 - 1988
- [j12]Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra
The Boolean Hierarchy I: Structural Properties. SIAM J. Comput. 17(6): 1232-1252 (1988) - 1986
- [c9]Thomas Gundermann, Gerd Wechsung:
Nondeterministic Turing Machines with Modified Acceptance. MFCS 1986: 396-404 - 1985
- [j11]Gerd Wechsung:
On Sparse Complete Sets. J. Inf. Process. Cybern. 21(4/5): 253-254 (1985) - [j10]Gerd Wechsung:
On Sparse Complete Sets. Math. Log. Q. 31(14-18): 281-287 (1985) - [c8]Gerd Wechsung:
On the Boolean closure of NP. FCT 1985: 485-493 - 1980
- [j9]Gerd Wechsung:
A Note on the Return Complexity. J. Inf. Process. Cybern. 16(4): 139-146 (1980)
1970 – 1979
- 1979
- [j8]Gerd Wechsung, Andreas Brandstädt:
A Relation Between Space, Return and Dual Return Complexities. Theor. Comput. Sci. 9: 127-140 (1979) - [c7]Gerd Wechsung:
The oscillation complexity and a hierarchy of context-free languages. FCT 1979: 508-515 - [c6]Gerd Wechsung:
A Crossing Measure for 2-Tape Turing Machines. MFCS 1979: 508-516 - 1977
- [c5]Gerd Wechsung:
A Nonlinear Lower Bound for the Formula Complexity of Certain Boolean Functions. IFIP Congress 1977: 831-833 - [c4]Gerd Wechsung:
Properties of Complexity Classes: A Short Survey. MFCS 1977: 177-191 - [c3]Klaus W. Wagner, Gerd Wechsung:
Complexity Hierarchies of Oracles. MFCS 1977: 543-548 - 1976
- [j7]Gerd Wechsung:
Kompliziertheitstheoretische Charakterisierung der kontextfreien und linearen Sprachen. J. Inf. Process. Cybern. 12(6): 289-300 (1976) - 1975
- [j6]Gerd Wechsung:
Eine algebraische Charakterisierung der linearen Sprachen. J. Inf. Process. Cybern. 11(1/2): 19-25 (1975) - [j5]Gerd Wechsung:
Minimale und optimale Blumsche Maße. J. Inf. Process. Cybern. 11(10-12): 673-679 (1975) - [c2]Gerd Wechsung:
Characterization of Some Classes of Context-Free Languages in Terms of Complexity Classes. MFCS 1975: 457-461 - 1974
- [c1]Gerd Wechsung:
The Axiomatization Problem of a Theory of Linear Languages. MFCS 1974: 298-302 - 1973
- [j4]Gerd Wechsung:
Quasisequentielle Funktionen. Acta Cybern. 2(1): 23-33 (1973) - [j3]Gerd Wechsung:
Eine verbandstheoretische Klassifikation der längentreuen Wortfunktionen. Acta Cybern. 2(1): 39-46 (1973) - [j2]Gerd Wechsung:
Funktionen, die von pushdown-Automaten berechnet werden. Acta Cybern. 2(2): 115-134 (1973) - 1972
- [j1]Gerd Wechsung:
Die Gruppe der eineindeutigen längentreuen sequentiellen Funktionen. J. Inf. Process. Cybern. 8(6/7): 335-351 (1972)
Coauthor Index
aka: Lane A. Hemachandra
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: