[DMANET] Postdoc position in algorithms and complexity at University of Edinburgh

A postdoc position in algorithms and complexity is available at the
School of Informatics, University of Edinburgh. The position is funded
by the ERC Consolidator Grant ALUnif (Algorithms and Lower Bounds: A
Unified Approach), held by Rahul Santhanam.

The goal of the project is to use recently discovered connections between
complexity lower bound techniques and algorithmic design and analysis to
design new and improved algorithms for SAT and other NP-complete problems, as
well as to prove new complexity lower bounds.

Candidates should have a strong background in theoretical computer
science, preferably in complexity theory and/or exact algorithms for
NP-hard problems. Candidates should also have a PhD, or be close to
completion of a PhD.

The application deadline is March 12, 2014, and the application link is
here:
https://www.vacancies.ed.ac.uk/pls/corehrrecruit/erq_jobspec_version_4.jobspec?p_id=026229

Informal queries may be directed to Rahul Santhanam
at the e-mail address rsanthan@inf.ed.ac.uk

------------------------------------------------




--
The University of Edinburgh is a charitable body, registered in
Scotland, with registration number SC005336.

**********************************************************
*
* 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/
*
**********************************************************