Logic List Mailing Archive

Two postdoctoral positions in "The parameterized complexity of reasoning problems", Vienna (Austria), Deadline: 19 Dec 2009

TU Wien
2 Postdoc Positions in Computer Science

at the Faculty of Informatics, Vienna University of Technology, Austria.

Within the ERC-funded project "The Parameterized Complexity of Reasoning 
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.