Manfred Abelein

Manfred Abelein (20 October 1930, Stuttgart, Württemberg - 17 January 2008) was a German politician. He was a representative of the German Christian Democratic Union.

Manfred Abelein
Member of the Bundestag
In office
19 October 1965  20 December 1990
Personal details
Born(1930-10-20)20 October 1930
Stuttgart, Germany
Died17 January 2008(2008-01-17) (aged 77)
Ellwangen, Germany
NationalityGerman
OccupationPolitician

Education and Work

Abelein graduated with a degree in law, political science and economics. He later worked as a professor at the University of Regensburg, where he taught politics and public law. He was well known for his regular course on "The Current Problems in Fiscal Policy".

Member of Parliament

Abelein was a member of the German Bundestag from 1965, when he succeeded Rudolf Vogel, until 1990. He represented the constituency of Aalen-Heidenheim in Baden-Württemberg, and received over 50% of the votes every time he ran for election.[1] In an article in the German newspaper Die Zeit, he presented himself as a conservative politician.[2] He was replaced in office by Georg Brunnhuber in 1990, who still holds the seat as of 2009.

Abelein was also a member of the NATO Parliamentary Assembly, of which he was Vice-President from 1985-1987.

Mountain Climber and Pilot

Abelein was a passionate mountain climber. In 1977, while on a trip to help set up the Konrad Adenauer Foundation in South America, he climbed Mount Illimani (6,438m) in Bolivia. He also climbed the Hohe Munde (2,662m) in Austria in 1978. Between March and May 1980 he participated in the first European expedition to Tibet for many years, which climbed Mount Shishapangma (8,013m), the fourteenth highest mountain in the world.

A trained pilot, Abelein flew non-stop from New York City to Cologne in 1979.[3]

gollark: Lua does.
gollark: Also, just using `==` to compare ~~a password and hash~~ secret values of some kind is actually somewhat unsafe because timing channel attacks.
gollark: 2 xor 1024?
gollark: Password hashing algorithms generally let you pass the salt as a separate parameter.
gollark: Anyway, good password hashing algorithms are designed to be hard to parallelize, and to require large amounts of memory, so that they're hard to implement on FPGAs/ASICs/GPUs and run fastest on general-purpose CPU hardware (this is what your server has).

See also

References

  1. "Election Results". statistik-portal.de (in German). Archived from the original on 2012-12-03. Retrieved 2009-06-28.
  2. "Hat der Konservatismus noch Chancen?". zeit.de (in German). Retrieved 2009-06-28.
  3. "Nur Freitags". wissen.spiegel.de/ (in German). Retrieved 2009-06-28.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.