Gerd Wechsung - RankMe

55 papers A* 1A 2B 10C 1Misc 1Journal 35Unranked 5

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