Gerd change

from Wikipedia, the free encyclopedia
Gerd Wechsung, 1985
Gerd Wechsung as Vice Rector of the University of Jena, 1991
In 1998 Gerd Wechsung was awarded the Cross of Merit on Ribbon of the Federal Republic of Germany by Thuringia's Prime Minister Bernhard Vogel
V. l. To the right: Boris Trakhtenbrot, Gerd Wechsung and Jörg Rothe, 1994
Gerd Wechsung and Ludwig Staiger, 2012
Gerd and Maria Wechsung, 2010

Gerd Wechsung (born February 12, 1939 in Berka ) is a German mathematician and computer scientist who was Professor of Theoretical Computer Science at the University of Jena from 1980 to 2004 . In particular, he conducted research in the areas of complexity and predictability theory .

Life

Wechsung completed his mathematics studies at the University of Jena in 1962 with a diploma. The topic of his diploma thesis was "Branched periodic functions and their applications". The mathematician Walter Brödel , who was expelled from Jena for political reasons in December 1961 and was appointed professor in Würzburg after visiting professorships in Munich and Darmstadt , had a great influence during his studies .

This was followed by a PhD A (Dr. rer. Nat.) At the University of Jena in 1966 . His dissertation "On the theory of logarithmic integrals" was supervised by his doctoral supervisor Wilhelm Maier . After Wechsung 1970 for faculty of Mathematical Cybernetics had been appointed and computer engineering at the University of Jena and 1973, an additional study at the Moscow State University had graduated in Moscow, graduated in 1974 at the Humboldt University of Berlin , the Promotion B (Dr. sc. Nat .) with the text "On the theory of sub-recursive computability".

In 1976, Wechsung was visiting professor at the Academy of Sciences of the USSR , in 1977 lecturer at the Banach Center in Warsaw, and in 1980 he was appointed full professor of mathematical cybernetics and computing technology at the University of Jena. Visiting professorships followed in 1986 at the University of Colorado Boulder in the United States and in 1989 at the University of Greifswald .

While he was not party to the GDR, he was politically interested and committed and had defended the members of his research group against reprisals by the regime to the best of his ability. In October 1989 he joined the " Democratic Awakening " (DA) alliance . In May 1989 he was one of 25 election observers who helped Jena to expose the falsifications in the GDR local elections. In December 1989 he was elected chairman of the Jena district board of the DA and actively worked towards the democratization of East Germany and the reunification with West Germany.

In 1990 he was the founding director of the Institute for Theoretical and Practical Computer Science at the University of Jena. In the same year he took up his post as Vice-Rector for Mathematics, Natural Science and Technology at the University of Jena, which he held until 1993 and in which, as chairman of the evaluation commission, he played a major role in the renewal of the university.

Awards

In 1998 , Gottfried Meinhold and Gerd Wechsung were awarded the Cross of Merit of the Federal Republic of Germany for their outstanding commitment to the reconstruction and democratic renewal of the Friedrich Schiller University in Jena .

Academic offspring

Wechsung supervised or enabled a total of 18 young scientists to do doctorates in his working group: Lutz Bernhard (1971), Klaus W. Wagner (1974), Bernhard Goetze (1976), Gerhard Lischke (1976), Andreas Brandstädt (1976), Ludwig Staiger (1977), Werner Nehrlich (1980), Jörg Vogel (1983), Dietrich Meinhardt (1986), Thomas Gundermann (1988), Nasser Ali Nasser (1989), Dieter Kratsch (1989), Haiko Müller (1991), Peter Damaschke ( 1991), Jörg Rothe (1995), Harald Hempel (1998), Maren Hinrichs (2003) and André Große (2004).

These young academics were later appointed to professorships or were active as university lecturers or senior lecturers: Klaus W. Wagner ( University of Augsburg and University of Würzburg ), Andreas Brandstädt ( University of Duisburg and University of Rostock ), Gerhard Lischke ( University of Jena ), Werner Nehrlich ( Technische Fachhochschule Berlin ), Ludwig Staiger ( University of Halle ), Jörg Vogel (University of Jena), Dieter Kratsch ( Université de Lorraine Metz, France ), Haiko Müller ( University of Leeds , UK), Peter Damaschke ( Chalmers University Göteborg, Sweden ), Jörg Rothe ( University of Düsseldorf ), Maren Hinrichs ( West Saxon University of Applied Sciences Zwickau ) and André Große ( Ernst Abbe University of Jena ).

Fonts (selection)

  • Klaus W. Wagner and Gerd Wechsung: Computational Complexity. D. Reidel Publishing Company, Dordrecht (later: Kluwer / Reidel), 1986 and Deutscher Verlag der Wissenschaften, Berlin, 1986.
  • André Große, Jörg Rothe and Gerd Wechsung: On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Information Processing Letters 99 (6), pp. 215–221, 2006.
  • Edith Hemaspaandra and Gerd Wechsung: The Minimization Problem for Boolean Formulas. SIAM Journal on Computing 31 (6), pp. 1948-1958, 2002.
  • André Große, Jörg Rothe and Gerd Wechsung: Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. Theory of Computing Systems 35 (1), pp. 81-93, 2002.
  • Gerd Wechsung: Lectures on complexity theory. Teubner texts on computer science. Springer Vieweg, Berlin and Heidelberg, 2000.
  • Lane A. Hemaspaandra, Harald Hempel and Gerd Wechsung: Query Order. SIAM Journal on Computing 28 (2), pp. 637-651, 1998.
  • Maren Hinrichs and Gerd Wechsung: Time Bounded Frequency Computations. Information and Computation 139 (2), pp. 234-257, 1997.
  • Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner and Gerd Wechsung: The Boolean Hierarchy II: Applications. SIAM Journal on Computing 18 (1), pp. 95-111, 1989.
  • Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner and Gerd Wechsung: The Boolean Hierarchy I: Structural Properties. SIAM Journal on Computing 17 (6), pp. 1232-1252, 1988.
  • Gerd Wechsung and Andreas Brandstädt: A Relation Between Space, Return and Dual Return Complexities. In: Theoretical Computer Science 9, 1979, pp. 127-140.

literature

  • Harald Hempel (Ed.): Change in Jena. An anthology with memories of Gerd Wechsung's work on the alma mater jenensis. Jena 2004 ( excerpts ).

Web links

Commons : Gerd Wechsung  - collection of pictures, videos and audio files

Individual evidence

  1. ^ André Große, Jörg Rothe and Gerd Wechsung: On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. Information Processing Letters 99 (6), pp. 215–221, 2006. http: // www.sciencedirect.com/science/article/pii/S0020019006001402
  2. Edith Hemaspaandra and Gerd Wechsung: The Minimization Problem for Boolean Formulas. SIAM Journal on Computing 31 (6), pp. 1948-1958, 2002. http://epubs.siam.org/doi/abs/10.1137/S0097539799362639
  3. ^ André Große, Jörg Rothe and Gerd Wechsung: Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. Theory of Computing Systems 35 (1), pp. 81-93, 2002. http://link.springer.com/article/10.1007%2Fs00224-001-1048-9
  4. Gerd Wechsung: Lectures on Complexity Theory. Teubner texts on computer science. Springer Vieweg, Berlin and Heidelberg, 2000. http://www.springer.com/in/book/9783519003151
  5. Lane A. Hemaspaandra, Harald Hempel and Gerd Wechsung: Query Order. SIAM Journal on Computing 28 (2), pp. 637-651, 1998. http://epubs.siam.org/doi/abs/10.1137/S0097539796297632
  6. ^ Maren Hinrichs and Gerd Wechsung: Time Bounded Frequency Computations. Information and Computation 139 (2), pp. 234-257, 1997. http://www.sciencedirect.com/science/article/pii/S0890540197926663
  7. Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner and Gerd Wechsung: The Boolean Hierarchy II: Applications. SIAM Journal on Computing 18 (1), pp. 95-111, 1989. http://epubs.siam.org/doi/abs/10.1137/0218007
  8. Jin-yi Cai, Thomas Gundermann, Juris Hartmanis, Lane A. Hemachandra, Vivian Sewelson, Klaus W. Wagner and Gerd Wechsung: The Boolean Hierarchy I: Structural Properties. SIAM Journal on Computing 17 (6), pp. 1232-1252, 1988. http://epubs.siam.org/doi/abs/10.1137/0217078
  9. Gerd Wechsung and Andreas Brandstädt: A Relation Between Space, Return and Dual Return Complexities. Theoretical Computer Science 9, pp. 127-140, 1979. http://www.sciencedirect.com/science/article/pii/0304397579900100