Algorithms group in the Department for Computer Science and Automation
at the Technische Universität Ilmenau (Head: Prof. Dr. Martin
Dietzfelbinger, see https://www.tu-ilmenau.de/ktea/forschung/publikationen).
The position is to be filled at the earliest possible date. The fixed
term is two years.
The Postdoc is expected to define their own research agenda within the area
of algorithms (and complexity theory).
Essential requirements are:
- Very good skills in theoretical computer science, in particular in the
area of efficient algorithms and complexity theory, in the design and
analysis of algorithms as well as the relevant mathematical methods
- Teaching in German must be possible.
For further details see:
https://jobundkarriere.tu-ilmenau.de/jobposting/eb50d7e4f7188b216467ea36a91bcda3a60afea50?ref=homepage
If interested, please apply as soon as possible. The deadline mentioned
in the official announcement will be extended to August 30.
For further information please contact Prof. Dietzfelbinger
(martin.dietzfelbinger@tu-ilmenau.de, phone: +49 3677-69-2656).
**********************************************************
*
* 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
