Problems" lead by Prof. Stefan Szeider applications are invited for two
postdoctoral positions in computer science. The aim of the project is to
study computational reasoning problems in the framework of parameterized
complexity theory. The positions are for the duration of two years with
the possibility to extend. The earliest starting date is January 2010.
The candidates should have a PhD degree in Computer Science or related
area; research experience at postdoctoral level is of advantage.
Successful candidates will have excellent knowledge in some of the
following areas:
* algorithm design and analysis
* computational complexity
* satisfiability and constraints
* nonmonotonic reasoning
* probabilistic reasoning
* discrete optimization
* implementation and testing of algorithms
The review of applicants will begin immediately and continue until the
positions are filled. Applications received by 19 December 2009 will
receive full consideration.
Further details on the requirements and information on how to apply can
be found at http://www.kr.tuwien.ac.at/drm/jobs
**********************************************************
*
* 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
