[Proof Complexity] Postdoc and PhD Positions at Imperial College London in Complexity (apply by 31 March 2021)

[Iddo Tzameret]

 Dear Colleagues,

At least two PhD studentships and at least one Postdoc post in
computational complexity is available in my group at Imperial College
London in the context of an ERC grant. See more details below. Anyone who
is interested is more than welcome to inquire about these posts via email
(if you know of anyone who may be interested, please let them know of
course).

Best wishes,
--- Iddo Tzameret


*****************************************************
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 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 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), among others.

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 of some
relevance,
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.

************************************************
 PHD STUDENTSHIPS IN COMPUTATIONAL COMPLEXITY
 IMPERIAL COLLEGE LONDON
 DEPARTMENT OF COMPUTING
************************************************

 Two PhD positions
 START DATE: Autumn 2021 (may be flexible)
 CLOSING DATE FOR APPLICATIONS: 31st Mar 2021 (by midnight)
 Open to all nationals.

Imperial's Computing is seeking up to two strong and motivated
PhD students with a background in Theoretical Computer Science
or Mathematics, interested in computational complexity. The
positions are based at the South Kensington campus at the heart
of London, and include a generous stipend, as well as funding
for equipment and travel. The topic revolves around fundamental
lower bound questions in computational complexity. The
successful candidate will join the complexity group at Imperial
College led by Professor Iddo Tzameret.

Imperial College London Department of Computing is a
world-leading department of computer science which is
consistently ranked among the best computer science departments
in major international league tables.

The PhD will be carried out in the context of an ERC
(European Research Council) funded project EPRICOT (Efficient
Proofs and Computation) which has the goal to push forward the
frontiers of the fundamental questions in computational
complexity theory, such as new lower bounds on concrete
computational models, structure (reductions between different
computational problems) and meta-mathematics of complexity.
However, students will have the freedom to pursue their own
ideas within complexity if they choose so. Apart from generous
funding for equipment and travel covered, 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.

Candidates with a firm (undergraduate) background in the
following areas are good fit:

 - The theory of computing and computational complexity;
 - Knowledge of basic algebra, combinatorics, and possibly logic;
   with more advanced experience or knowledge in these areas being
   an advantage.


The successful applicant will have an MSc (or equivalent) in an
area pertinent to the subject area, ideally computer science or
mathematics (with some background in the theory of computing).

For further information on 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 of some
relevance,
or email: iddo.tzameret at gmail.com


HOW TO APPLY

To be considered, candidates should send their full CV 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.





-- 
Professor Iddo Tzameret
http://www.cs.rhul.ac.uk/home/tzameret
Email: iddo.tzameret at gmail.com