Prof. Dr. Ernst W. Mayr

Prof. Mayr’s research in computer science covers algorithms and complexity theory. He also explores symbolic mathematics/computer algebra and methods in bioinformatics. His principal interests lie in describing and modeling parallel and distributed programs and systems, the design and analysis of efficient parallel algorithms and programming paradigms, the design of algorithm solutions for scheduling and load balancing problems and investigation of their complexity theory. He also explores polynomial ideals and their complexity and algorithms as well as algorithms for searching and analyzing extensive bioinformatics data.

After studying mathematics at TUM and computer science at MIT in Boston, Prof. Mayr did his doctorate at TUM in 1980. In 1982, he became assistant professor of computer science at Stanford University.  In 1988, he was appointed to the Chair of Theoretical Computer Science at Johann Wolfgang Goethe University in Frankfurt/Main. Prof. Mayr has held the Chair of Efficient Algorithms at TUM since 1993.


Faculty Members


The students will have a truly unique international experience at KIU with Georgian and international faculty members.

Please REGISTER HERE to receive program brochure with details