[Proof Complexity] PhD studentship at Royal Holloway, University of London

Iddo Tzameret iddo.tzameret at gmail.com
Tue Dec 30 02:03:03 CET 2014


Dear Colleagues,

This is to announce that the Department of Computer Science at
Royal Holloway, University of London is offering a three-year
full-time PhD studentship in algorithms and complexity with an
emphasis on satisfiability and proof complexity, starting in
October 2015.

For the full announcement see:
http://www.cs.rhul.ac.uk/home/tzameret/PhD_Post.html

It would also be very helpful if you could advertise this position
further to anyone who might be interested.

Informal inquiries about this post are most welcome.


                     Kind Regards,
                                           Iddo

---
The Official Announcement:

PHD STUDENTSHIP IN ALGORITHMS AND COMPLEXITY

(full tuition-fee waiver, stipend of approximately GBP 16,000
per annum and support for conference travels)

DEPARTMENT OF COMPUTER SCIENCE, ROYAL HOLLOWAY UNIVERSITY OF
LONDON

STARTING DATE: October 1, 2015

The Department of Computer Science at Royal Holloway,
University of London is offering a three-year full-time PhD
studentship in algorithms and complexity starting in October
2015. The studentship includes a full tuition-fee waiver and a
maintenance award in line with the level recommended by
Research Councils UK (exact value to be confirmed, circa GBP
16,000 pa). The student will be hosted in the Center for
Algorithms and Applications and will work under the supervision
of Dr Iddo Tzameret (http://www.cs.rhul.ac.uk/home/tzameret/).

The project is broadly in the area of computational complexity
with an emphasis on satisfiability and the complexity of
proofs. The successful candidate will investigate fundamental
aspects of the Boolean satisfiability problem SAT from possibly
different aspects - combinatorial, algebraic and logical - with
a possibility to engage as well in applied or empirical study
of SAT-solving and other applications related to SAT, depending
on the preferences and qualifications of the candidate.

HOW TO APPLY:

Applications should be made through the online application
system at Royal Holloway, University of London:
https://www.royalholloway.ac.uk/studyhere/researchdegrees/applying/home.aspx 

and will remain open until the position is filled.

REQUIREMENTS:

The successful candidate will have obtained a first-class
Bachelors or Masters degree in Computer Science, Mathematics or
a cognate discipline, have a solid understanding of
foundational aspects of computer science and, specifically,
computational complexity (knowledge of logic will also be
appreciated), meet the requirements for English language (IELTS
or TOEFL), and be highly motivated. Every application will be
analyzed individually.

For any informal inquiries about the position, please contact
Dr Iddo Tzameret at: Iddo.Tzameret at rhul.ac.uk.

ABOUT THE DEPARTMENT

The Computer Science Department at Royal Holloway, University
of London, is one of the UK's leading centers for research into
Computer Science. In the most recent Reference Excellent
Framework (REF 2014), the department ranked 11th in the UK for
the quality of research output, with over 32% of publications
recognized as world leading, and 55% internationally excellent.
The department consists of world-leading researchers in
algorithms and complexity, bioinformatics, distributed and
global computing, machine learning, software language
engineering, and applications of logic in computer science.
Research students enjoy a very lively research culture and are
fully involved in the research activities of the Department
(and share their successes). The Department also funds students
to present their work at international conferences.

For more information see:
http://www.cs.rhul.ac.uk/home/tzameret/PhD_Post.html

-- 
Iddo Tzameret
Computer Science Department
Royal Holloway, University of London
Iddo.Tzameret at rhul.ac.uk
http://www.cs.rhul.ac.uk/home/tzameret/



More information about the Proof-Complexity mailing list