Algorithms and Complexity (Distributed Algorithms)
University of Liverpool, UK
Applications are invited for a Postdoctoral Researcher to work on an EPSRC
"Reliable Distributed Algorithms for Dynamic Communication in Ad Hoc Networks"
under the supervision of Dr Dariusz Kowalski. The aim of the project is to
develop new algorithmic techniques, accompanied by a comprehensive theoretical
analysis and simulations, for coping with unreliable dynamic communication,
faulty devices, and malicious disruption in ad hoc networks.
The successful applicant will join the Algorithms and Complexity Group (see
http://www.csc.liv.ac.uk/~ctag). The group is particularly active in the areas
of distributed/network algorithms, game theory, randomised and approximation
algorithms, bioinformatics, and computability theory.
The candidate should have (or be about to obtain) a PhD in Computer
Science or Mathematics, preferably in the area of distributed/network
algorithms or a related subject. Experience in algorithms and complexity
analysis is essential. Programming skills would be an advantage.
The post is available for 1 YEAR. Preferred starting date is 1 June 2011
(it could be delayed by up to 3 months if necessary).
The salary is GBP 30,870 pa.
Informal enquiries may be sent to:
Dr Dariusz Kowalski, email: [log in to unmask]
Closing Date: 15 April 2011
Job Ref: R-568542/WWW
For full details, or to request an application pack,
[log in to unmask]
(please quote Job Ref in all enquiries)