Ingo Wegener

from Wikipedia, the free encyclopedia

Ingo Wegener (full name Ingo Werner Wegener; * December 4, 1950 in Bremen ; † November 26 or 27, 2008 in Bielefeld ) was a German computer scientist who worked in the field of theoretical computer science . In 1990 he introduced BottomUp Heapsort, a modified sorting algorithm that sorts faster on average than the well-known quicksort .

Life

After graduating from high school on May 16, 1969 in Bremen , Ingo Wegener began studying mathematics and sociology at Bielefeld University , graduating with honors on January 15, 1976. The title of his thesis is “Discrete Search Problems ”.

Wegener received his doctorate with distinction on February 23, 1978 in Bielefeld with Wolfgang Jakob Paul and Rudolf Ahlswede . The title of his dissertation is " Boolean functions , the monotonous complexity of which is almost quadratic". He completed his habilitation on February 5, 1981, also in Bielefeld.

From October 1, 1980 to August 13, 1987, he held a visiting professorship and then a C3 professorship at the Johann Wolfgang Goethe University in Frankfurt am Main . Since August 14, 1987 Ingo Wegener has been researching and teaching at the Technical University of Dortmund on the Chair of Computer Science 2 in the field of efficient algorithms and complexity theory .

In 1992 he was elected expert reviewer for theoretical computer science at the DFG . In 1996 he was confirmed in office and held it until 2000. From 1996 to 2000 he was also chairman of the technical committee for computer science.

From 1989 to 1991 he was the spokesman for the “Theoretical Computer Science Section” of the Society for Computer Science (GI). Subsequently, he was a member and deputy chairman of the "Technical Committee Theoretical Computer Science" until 1994 and from 1994 to 1996 spokesman for the "Theoretical Computer Science Department" as well as a member of the GI Presidium.

Wegener was also a member of the "Federal Mathematics / Computer Science Jury" of Jugend forscht from 1989 to 1998 and was chairman from 1993 to 1996 and then again since 2003. From 1995 to 2001 he was chairman of the selection committee for the national computer science competition and from 2002 to 2005 a member of the scientific directorate of the “ International Meeting and Research Center Schloss Dagstuhl ” (IBFI).

Since 2003 he has published the textbook series “Leitfäden der Informatik”.

In 2000 he was elected deputy spokesman for Collaborative Research Center 531, and in 2004 as its spokesman. He was elected a member of the Science Council for the term from 2004 to 2007 . In February 2007 he was appointed to the Science Council by Federal President Horst Köhler for a further three years.

Wegener died in Bielefeld on the night of November 26th to 27th, 2008.

Wegener's academic legacy can be found in the university archive of the Technical University of Dortmund.

Honors

Wegener has received various honors for his services to teaching and research in the field of theoretical computer science.

Publications

  • Efficient Algorithms for Basic Functions , 1989, Teubner, ISBN 3519022761
  • Compendium Theoretical Computer Science - A Collection of Ideas , 1996, BG Teubner Verlag, ISBN 3519021455
  • Theoretical computer science - an algorithm- oriented introduction , 3rd edition, 2005, BG Teubner Verlag, ISBN 3835100335
  • Complexity Theory - Limits to the Efficiency of Algorithms , 2003, Springer Verlag, ISBN 3540001611

literature

  • Christa Wegener-Mürbe: Ingo Wegener . In: Valentin Wehefritz (Hrsg.): CVs from your own hand . Biographical archive of Dortmund university professors. No. 15 . Dortmund 2009 ( tu-dortmund.de [PDF; accessed on November 17, 2010]).

Web links

Individual evidence

  1. ^ Theoretical Computer Science - An Algorithm-Oriented Introduction , 2nd Edition, p. IV
  2. Ingo Wegener . In: The Mathematics Genealogy Project . Department of Mathematics, North Dakota State University ( online [accessed October 19, 2010]).
  3. ^ Obituary notice on the website of the Technical University of Dortmund