Monday, June 28, 2010

[DMANET] Postdoctoral fellowship in Algorithms and Complexity (Computational complexity and finite model theory), University of Edinburgh

The Algorithms and Complexity group at the School of Informatics,
University of Edinburgh, is seeking a post-doctoral researcher to work on
the EPSRC-funded project "Hierarchies, Circuit Lower Bounds and
Pseudorandomness" under the supervision of Dr Rahul Santhanam. The
position is open to researchers who have, or soon expect to have, a PhD in
computer science or a closely related field. Skills in theoretical
computer science, with an emphasis on computational complexity and finite
model theory, will be particularly appreciated.

The post is available from 23rd July 2010 (flexible) for one year with a
possibility of extension.

Informal enquiries may be sent to Dr. Rahul Santhanam (mail to:
rsanthan@inf.ed.ac.uk).

For further details and the application procedure, please visit:
http://www.jobs.ed.ac.uk/vacancies/index.cfm?fuseaction=vacancies.detail&vacancy_ref=3013006&go=GO

-- Rahul Santhanam


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