[Job-offers-cs] Postdoc in Computational Complexity - Imperial College London

[Pekka Orponen]

-------- Forwarded Message --------
Subject: [DMANET] Postdoc in Computational Complexity - Imperial College 
London
Date: Thu, 18 Feb 2021 07:45:00 +0000
From: Iddo Tzameret <iddo.tzameret at gmail.com>
Reply-To: iddo.tzameret at gmail.com
To: DMANET at zpr.uni-koeln.de

*****************************************************
POSTDOC IN COMPUTATIONAL COMPLEXITY
IMPERIAL COLLEGE LONDON
DEPARTMENT OF COMPUTING
*****************************************************

DURATION: Full-time, two years, with a possibility for a one-year extension
START DATE: expected autumn 2021 (flexible)
CLOSING DATE FOR APPLICATIONS: 31st Mar 2021 (by midnight)

The post of Research Associate (postdoc) is to conduct world-leading 
research in computational complexity theory with an emphasis on 
fundamental lower bound questions. The successful candidate will join 
the complexity group at Imperial College led by Professor Iddo Tzameret 
in the context of the ERC (European Research Commission) EPRICOT project.

The post is based in the Department of Computing at Imperial College 
London at the South Kensington Campus. Imperial College London, 
Department of Computing is a world-leading department, one of the 
largest in the UK, and is consistently ranked among the top computer 
science departments in international league tables.

Apart from generous funding for equipment and travel covered by the 
flagship ERC grant scheme, the position offers an exciting opportunity 
to conduct internationally leading and impactful basic research in a 
major computer science department at the heart of London, with many 
leading research groups and other institutions nearby. The postdoc will 
carry out a research programme in the area of computational complexity 
and the theory of computing, and may help supervise or collaborate with 
other group members and students (there are no teaching duties).

To apply for this position, you must have a proven strong publication 
track-record in computational complexity, as may be manifested for 
instance by publications in leading theoretical computer science 
conferences such as STOC, FOCS, CCC, ICALP, ITCS or in leading journals 
such as JACM, Siam J. Comput. (SICOMP), etc.

For further information about the project, see:
https://www.cs.rhul.ac.uk/home/ubac001/index.html, and
http://www.cs.rhul.ac.uk/home/tzameret/siglog.pdf for a survey, or 
email: iddo.tzameret at gmail.com (though candidates will have freedom to 
pursue their own research agenda assuming it aligns with that of the group).


HOW TO APPLY

To be considered, candidates should send their full CV (containing a 
list of all publications) to iddo.tzameret at gmail.com

Informal enquiries related to the position are strongly encouraged and 
should be directed to Iddo Tzameret at the above email.