Ingo Wegener
{{short description|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.{{r|eatcs|lance|evco|algo}}
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.{{r|eatcs}} His doctoral dissertation, Boolesche Funktionen, deren monotone Komplexität fast quadratisch ist, was jointly supervised by {{ill|Wolfgang Paul (computer scientist)|de|Wolfgang Paul (Informatiker)|lt=Wolfgang Paul}} and Rudolf Ahlswede.{{r|mg}}
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.{{r|eatcs}}
Contributions
Wegener's dissertation research concerned circuit complexity, and he was known for his research on Boolean functions and binary decision diagrams.{{r|eatcs|lance}}
He wrote two books on related topics, The Complexity of Boolean Functions (Wiley, 1987, also called "the blue book"){{r|cbf}} and Branching Programs and Binary Decision Diagrams: Theory and Applications (SIAM Press, 2000).{{r|bb}}
Beginning in the 1990s, his research interests shifted towards the theoretical analysis of metaheuristics and evolutionary computation.{{r|eatcs|lance}}
Awards and honors
Wegener was elected as a fellow of the German society for computer science, the Gesellschaft für Informatik, in 2004.{{r|gif}} 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.{{r|eatcs}}
References
{{reflist|refs=
{{citation|last1=Doerr|first1=Benjamin|last2=Neumann|first2=Frank|date=November 2009|doi=10.1007/s00453-009-9372-6|issue=3|journal=Algorithmica|pages=541–542|title=In Memoriam: Ingo Wegener|volume=58|doi-access=free}}
Reviews of Branching Programs and Binary Decision Diagrams:
- {{citation|title=none|year=2001|journal=Mathematical Reviews|first=Christoph|last=Meinel|mr=1775233|doi=10.1137/1.9780898719789|isbn=978-0-89871-458-6}}
- {{citation|title=none|first=Lance|last=Fortnow|authorlink=Lance Fortnow|journal=SIAM Review|volume=44|issue=2|date=June 2002|pages=284–285|jstor=4148360}}
- {{citation|last=Johnson|first=Samuel|date=September 2010|doi=10.1145/1855118.1855126|issue=3|journal=ACM SIGACT News|page=36|publisher=Association for Computing Machinery|title=none|volume=41|s2cid=14574179}}
Review of The Complexity of Boolean Functions:
- {{citation|title=none|year=1989|journal=Mathematical Reviews|first=Juraj|last=Hromkovič|mr=0905473}}
{{citation|publisher=European Association for Theoretical Computer Science|url=http://www.eatcs.org/index.php/component/content/article/1-news/545-in-memoriam-of-prof-dr-ingo-wegener|title=In memoriam of Prof. Dr. Ingo Wegener, 1950—2008}}
}}
{{Authority control}}
{{DEFAULTSORT:Wegener, Ingo}}
Category:German computer scientists
Category:Bielefeld University alumni
Category:Academic staff of Goethe University Frankfurt
Category:Academic staff of the Technical University of Dortmund