new Graph Algorithms Library for full 3 years. The position begins as
soon as possible and comes with social security and the competitive
salary TV-L E13 100% according to the German public sector (about
50.000-73.000 Euro/year gross, depending on the applicant's qualifications).
The PhD-position will be hosted at the Institute for Computer Science at
the University of Rostock and be supervised by Jens M. Schmidt.
We want to design and implement a new library specialized on very basic
graph algorithms with a focus on speed and highly optimized and scalable
platform-independent code. This shall be done from an algorithm
engineering perspective, be supported by continuous testing and
profiling of the written code, and adaptive to the particular algorithm
that is called. Hence, candidates should have an excellent background in
algorithm engineering, graphs and C++17-programming (ideally
stackoverflow is your regular friend). The position comes with a
teaching load of 4 SWS, which is generally conducted in German, so that
a basic knowledge of the German language is required. Solid English
mathematical writing skills are desirable.
Applicants should submit their application until September 9th on the
official application portal [1] containing
- a curriculum vitae
- a list of publications (if there are any)
- a summary of the (possibly preliminary) thesis (max. 1 page)
- a list of courses and grades, and
- names and emails of one or two references (including thesis advisor)
Informal inquiries about the position can be made by writing to
jens.schmidt (ät) udo.edu.
[1]
https://jobs.uni-rostock.de/jobposting/1149e54dcf5ada9106c3b679b33ee09633deb0e80?ref=homepage
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
