I specialize in algorithms (procedures for doing computations): I strive to design algorithms that can be proven to yield correct results fast, even when a large amount of data needs to be processed. More specifically, I focus on algorithms that process geometric data (such as found in geographic information systems) and algorithms that work with such amounts of data that they cannot be cached in main memory (or smaller caches) all at once—so that the transfer of data to and from caches becomes the bottleneck in the computation.
You are welcome to check out my advice on how to give a typical talk or lecture in an algorithms seminar.
The Eindhoven University of Technology asks their academic staff to sign a code of scientific conduct. I refuse to sign this code (read here why).
The Foundation for Refugee Students UAF provides financial and other support to refugees and asylum seekers who plan to study in the Netherlands. They need money.
I believe that the fruits of publicly funded research (such as my own) should be available to the public. However, commercial publishers of scientific journals charge prohibitively high fees. Therefore I prefer to publish in and review for non-profit journals whenever possible. I recommend submitting your best papers on computational geometry to the free, open-access Journal of Computational Geometry.
If you are a Master student of the TUE CSE programme and are looking for a graduation project, you may be interested in seeing what kind of projects I tend to supervise. You are welcome to make an appointment to discuss what kind of project you would like to do.
If you are a student from another university: note that I cannot accept any applications for summer internships, and I do not respond to them.
| Herman Haverkort
Department of Mathematics and Computer Science
Technische Universiteit Eindhoven
5600 MB Eindhoven
|Office||Building 5 (Metaforum), office 4.102|
|Phone||+31 40 247 8363|
My schedule is very irregular. If you would like to see me, please make an appointment by e-mail.