The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Gerd Wechsung: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.019secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002