[Proof Complexity] Fwd: Postdoc and Ph.D. Student Positions in Symbolic Algorithms - University of Bergen (Norway) - Deadline 14/Nov/2021

Mateus de Oliveira Oliveira mateus.oliveira at gmail.com
Thu Sep 30 07:30:59 CEST 2021


Dear all,

I would be glad if you can forward the announcements below to possible
interested candidates.
Candidates with a strong background in TCS are eligible.

Best regards,

Mateus



---------- Forwarded message ---------
From: Mateus de Oliveira Oliveira <mateus.oliveira at gmail.com>
Date: Thu, 30 Sept 2021 at 01:12
Subject: Postdoc and Ph.D. Student Positions in Symbolic Algorithms -
University of Bergen (Norway) - Deadline 14/Nov/2021
To: <DMANET at zpr.uni-koeln.de>


Symbolic algorithms are algorithms where the input data is represented
implicitly. Such algorithms are particularly relevant in contexts where the
data to be processed is too large to be specified in an explicit form. The
Algorithms Group at the University of Bergen (Norway) has currently two
open positions in the field of symbolic algorithms. These positions are
financed by the project "Symbolic Algorithms: A Parameterized Approach", a
12 Million NOK research project funded by the Research Council of Norway
under the Ground Breaking Research framework.

Postdoc Position
<https://www.jobbnorge.no/en/available-jobs/job/212553/postdoctoral-research-fellow-position-within-informatics-symbolic-algorithms>
- 3 years position with an initial salary of 535,500 NOK per year (approx
52,500 EUR per year) before taxes.
Ph.D. Position
<https://www.jobbnorge.no/en/available-jobs/job/212570/phd-research-fellow-in-informatics-symbolic-algorithms>
- 3 years position, with the possibility of a fourth year, if teaching is
involved. Initial salary: 491,200 NOK per year (approx 48,000 EUR per year)
before taxes.

Applicants for the Ph.D. student position should have a master degree (or
obtain a master degree before 31/01/2022) and a strong background in a
related subfield of theoretical computer science. Applicants for the
Postdoc position should have, in addition, a PhD degree (or obtain a PhD
degree before 31/01/2022) and a strong publication record in some related
subfield of theoretical computer science.  Examples of fields of relevance
to the position are: algorithms, graph theory, combinatorics, automata
theory, type theory, etc.

All applications received until the deadline (14/Nov/2021) will receive
equal consideration.

For more information, please contact the project leader, Mateus de Oliveira
Oliveira (mateus.oliveira at uib.no).

Best Regards,

Mateus de Oliveira Oliveira
Researcher
Department of Informatics - University of Bergen
mateus.oliveira at uib.no
autoproving.org/mateus-de-oliveira-oliveira


More information about the Proof-Complexity mailing list