Tuesday, April 9, 2019

[DMANET] PhD position in Algorithms at the University of Bergen (Norway)


the Department of Informatics at the University of Bergen (Norway) has
announced a 3 years
PhD position in Algorithms
The focus of the position will be on the algorithmic aspects of automated
reasoning, and in particular, in the algorithms aspects of automated
theorem proving. The position is
part of the project

"Automated Theorem Proving from the Mindset of Parameterized Complexity

which is funded by the Research Council of Norway. The deadline for the
application is* 05/May/2019*.
Later applications will not be accepted. You are recommended to apply as
soon as possible. The starting
date is 01/August/2019, or as soon as possible thereafter. The full
announcement for the position, including
instructions on how to apply, can be found here

If you are interested in the position, please see also the FAQ below.
Please feel free to contact me if you
have any further questions.

Mateus de Oliveira Oliveira

Best regards,



*FAQ: *

*About Bergen: *

*Q:* So how does Bergen look like?
*A:* Like in these pictures

*Q:* Is Bergen Cold?
*A:* Not so much. Please read this article
<https://en.wikipedia.org/wiki/Bergen#Climate>in Wikipedia for a lot
of information about climate in Bergen. The temperatures shown
in the average high and average low feel just right.

*About Requirements: *

*Q:* Do I need to have completed my Master's degree before applying?
*A: *No. But you will need to have it completed before 01/August/2019.
You cannot be employed at a PhD position without a Master degree (or

*Q:* Do I need to have publications to apply for the position?
*A:* Previous publication is not a requirement, but of course, they may be
used to access your
ability to produce scientific work. So you are encouraged to attach any
in which you are a co-author. Please see the formal announcement for more

*Q:* Do I need to know Parameterized Complexity, and or Automated Theorem
*A:* Previous knowledge of parameterized complexity theory and/or automated
theorem proving
is not a requirement, but of course it counts positively. The most
important thing is that the applicant
has a strong background in a relevant subfield of theoretical computer
science. Examples of relevant
fields are: algorithms, type theory, automata theory, computational logic,
combinatorics, graph theory, etc.

*Q:* Do I need to know how to program?
*A:* You will need to be able to program. An estimated workload is about
70% of working on theory and
30% on programming.

*About the application: *

*Q: *What is the most important thing in the application?
*A:* The most important part of the written application will be your
motivation letter, explaining why you are
a great candidate for the position. Statements made on the letter should be
corroborated by objective evidence,
like course grades, publications, etc. Selected candidates may be called
for an interview. Interpersonal skills, such
as the ability to collaborate will have a good weight in the selection

*Q:* Should I attach letters of reference?
*A:* This is not a requirement. But you need to name two references, which
may or may not be contacted.

* 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.
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/