Academic Career and Research Areas
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 bioinformatic 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.
- Curriculum Vitae
Kühnle K, Mayr EW: „Exponential space computations of Gröbner bases“. In: Proceedings of the 1996 Int. Symposium on Symbolic and algebraic computation. 1996: 63-71.Abstract
Heun V, Mayr EW: „A New Efficient Algorithm for Embedding an Arbitrary Binary Tree into Its Optimal Hypercube“. J. Algorithms. 1996; 20: 375-399.Abstract
Helmbold D, Mayr EW: „Two Processor Scheduling is in NC“. SIAM J. on Computing. 1987; 16: 747-759.Abstract
Mayr EW: „An algorithm for the general Petri net reachability problem“. SIAM J. on Computing. 1984; 13(3): 441-460.Abstract
Mayr EW, Meyer AR: „The complexity of the word problems for commutative semigroups and polynomial ideals“. Advances in Mathematics. 1982; 46(3): 305-329.Abstract