K. Rüdiger Reischuk
born 1955 in Germany, married, 3 children
Academic Biography
Education
1974 High School Degree, Ratsgymnasium Bielefeld, Germany
1978 Diploma in Mathematics, Universität Bielefeld
1980 Dr. math. (Ph.D.), Universität Bielefeld
1983 Habilitation in Mathematics, Universität Bielefeld
Profession
1978-81 Research Assistant, Fakultät für Mathematik, Universität Bielefeld
1981-82 Visiting scientist Computer Science Department, IBM Research Laboratory,
San Jose, California
1982-83 temporary professorship for Applied Mathematics and Informatics,
Universität des Saarlandes, Germany
1983-85 Assistant Professor, Fakultät für Mathematik, Universität Bielefeld
1985-94 Associate Professor for Theoretical Computer Science, Technical University Darmstadt,
Germany
since 1994 Full Professor and Director of Institut für Theoretische Informatik,
Universität zu Lübeck
Research Visists
1988 IBM Watson Research Center, Yorktown Heights, New York
1989 IBM Research Almaden, San Jose, and
International Computer Science Institute ICSI, Berkeley, California
1993 Int. Computer Science Institute ICSI, Berkeley, California
1997 Department of Informatics, Kyushu University, Fukuoka, Japan
2001 Department of Computer Science, University of Nevada, Las Vegas
2002 Institute for Mathematical Science IMS, National University of Singapore
2005 School of Informatics, Kyoto University, Japan
Organisation of Conferences
1992 Boolesche Funktionen und ihre Realisierung, Leibniz-Zentrum für Informatik IBFI,
Schloss Dagstuhl
1996 Time Services, IBFI, Schloss Dagstuhl
1997 14. GI Symposium on Theoretical Aspects of Computer Science STACS'97, Lübeck
1997 Complexity of Boolean Functions, IBFI, Schloss Dagstuhl
1999 Complexity of Boolean Functions, IBFI, Schloss Dagstuhl
2002 HLSC-Euroconference Complexity of Boolean Functions, IBFI, Schloss Dagstuhl
2002 13. Int. Conference on Algorithmic Learning Theory ALT'2002, Lübeck
2005 15. Int. Symposium on Fundamentals of Computation Theory FCT '2005, Lübeck
2006 Complexity of Boolean Functions, IBFI, Schloss Dagstuhl
2008 Complexity of Discrete Problems, IBFI, Schloss Dagstuhl
2009 GI-Jahrestagung 2009, Lübeck (annual meeting of German Comp. Science Society)
2011 Complexity of Discrete Problems, IBFI, Schloss Dagstuhl
since 1987 member of program committees of various international conferences
Academic Management
1991-95 Chairman of the Chapter Theoretical Computer Science of the German
Computer Science Society (Gesellschaft für Informatik GI)
1990-92 Dean of the Department of Informatics, Technical University Darmstadt
since 1994 Member of the Editorial Board Electronic Colloquium on Computational Complexity
since 1995 Member of the selection committee for the German Dissertation Award in Informatics
sponsored by GI
2002 -04 Dean of the Faculty for Engineering and Natural Sciences, Universität zu Lübeck
since 2006 Member of the board of Fakultätentag Informatik (the cooperation of all German
Informatics Department), since 2009 Vice-President
2006-11 Member of the board for study programs in Informatics, accreditation agency ASIIN
since 2009 CIO of the Universität zu Lübeck
since 2011 Member of the ASIIN accreditation committee
since 2011 Member of the scientific board for the bibliometry project DBLP,
Leibniz-Zentrum für Informatik Schloß Dagstuhl
since 2012 Member of executive board of 4ING (cooperation of Faculties/Fakultätentage
of Engineering and Informatics of German Universities)
since 1980 various reviews for the German Science Foundation DFG, German Academic Exchance
Service DAAD, Alexander-von-Humboldt-Stiftung, international research organisations,
ASIIN and international conferences and journals in Computer Science and Mathematics
long term member of GI, SIAM, IEEE Computer Society, German JSPS-Club
Research Areas
Complexity Theory, Algorithmics, IT-Security and Reliability, Steganography,
Algorithmic Learning, Bioinformatics, Parallel and Distributed Systems
August 2011