Ingo Wegener

Quality 0.50 · 3 views · Updated 2 months ago

German computer scientist

title: "Ingo Wegener" type: doc version: 1 created: 2026-02-28 author: "Wikipedia contributors" status: active scope: public tags: ["1950-births", "german-computer-scientists", "2008-deaths", "bielefeld-university-alumni", "academic-staff-of-goethe-university-frankfurt", "academic-staff-of-the-technical-university-of-dortmund", "members-of-german-academy-of-science-and-engineering-acatech"] description: "German computer scientist" topic_path: "engineering" source: "https://en.wikipedia.org/wiki/Ingo_Wegener" license: "CC BY-SA 4.0" wikipedia_page_id: 0 wikipedia_revision_id: 0

::summary German computer scientist ::

Ingo Wegener (December 4, 1950 in Bremen – November 26, 2008 in Bielefeld) was an influential German computer scientist working in the field of theoretical computer science.

Education and career

Wegener was educated at the Bielefeld University. He earned a diploma in mathematics there in 1976, a doctorate in 1978, and a habilitation in 1981. His doctoral dissertation, Boolesche Funktionen, deren monotone Komplexität fast quadratisch ist, was jointly supervised by and Rudolf Ahlswede.

He was a computer science professor at Goethe University Frankfurt from 1980 until 1987, when he moved to the Technical University of Dortmund. He remained at Dortmund until his death.

Contributions

Wegener's dissertation research concerned circuit complexity, and he was known for his research on Boolean functions and binary decision diagrams. He wrote two books on related topics, The Complexity of Boolean Functions (Wiley, 1987, also called "the blue book") and Branching Programs and Binary Decision Diagrams: Theory and Applications (SIAM Press, 2000).

Beginning in the 1990s, his research interests shifted towards the theoretical analysis of metaheuristics and evolutionary computation.

Awards and honors

Wegener was elected as a fellow of the German society for computer science, the Gesellschaft für Informatik, in 2004. For his merits on teaching and research in the field of theoretical computer science, he earned in 2006 the Konrad Zuse Medal from the Gesellschaft für Informatik.

References

Reviews of Branching Programs and Binary Decision Diagrams:

Review of The Complexity of Boolean Functions:

References

  1. (November 2009). "In Memoriam: Ingo Wegener". [[Algorithmica]].
  2. (March 2009). "Ingo Wegener". Evolutionary Computation.
  3. [http://www.gi.de/fileadmin/redaktion/Wettbewerbe/Fellowship/wegener-fellow2004.pdf GI-Fellow citation]{{Dead link. (September 2025)
  4. "In memoriam of Prof. Dr. Ingo Wegener, 1950—2008". [[European Association for Theoretical Computer Science]].
  5. Fortnow, Lance. (December 9, 2008). "Ingo Wegener (1950-2008)". Computational Complexity.
  6. {{mathgenealogy

::callout[type=info title="Wikipedia Source"] This article was imported from Wikipedia and is available under the Creative Commons Attribution-ShareAlike 4.0 License. Content has been adapted to SurfDoc format. Original contributors can be found on the article history page. ::

1950-birthsgerman-computer-scientists2008-deathsbielefeld-university-alumniacademic-staff-of-goethe-university-frankfurtacademic-staff-of-the-technical-university-of-dortmundmembers-of-german-academy-of-science-and-engineering-acatech