[Proof Complexity] Position in St.Petersburg: Math Logic and/or TCS

Edward A. Hirsch edward.a.hirsch at gmail.com
Tue Jan 5 14:49:38 CET 2021

Dear Colleagues,

This year we have a rare opportunity to open an Associate Professor
(Docent) position in St.Petersburg
*exclusively* for Mathematical Logic and/or Theoretical Computer Science

The students of our new Dept of Mathematics and Computer Science in
St.Petersburg State University
are absolutely the best (even this proof complexity seminar has already
seen a talk by one of those).

The position includes teaching both in English and Russian,
but *we can discuss this* (please do let me know if you have any

Please spread the news to potentially interested colleagues.

Best regards,
Edward A. Hirsch
Steklov Institute of Mathematics at St.Petersburg
Web: http://logic.pdmi.ras.ru/~hirsch/

Saint Petersburg State University
*Position Title:* Associate Professor
*Position Type:* Tenured/Tenure-track faculty
*Subject Area:* Mathematical Logic and Theoretical Computer Science
*Starting Date:* September 1, 2021
*Application Deadline:* February 12, 2021
*Position Description:*

The St.Petersburg State University invites applications for a full-time
position of Associate Professor (Docent) in

*    Mathematical Logic and Theoretical Computer Science*
for advanced teaching within the Department of Mathematics and Computer

This position includes teaching both in Russian and in English.

The undergraduate program in Mathematics and TCS is very selective, with
students being some of the best in the world. In particular, every year
more winners of the all-Russian mathematical Olympiad are joining our
program than any other similar program in Russia. The department has also
graduate programs. The well-known Chebyshev Laboratory (
http://chebyshev.spbu.ru/en/) is a part of our new Department.

Applicants are expected to have a strong research record and to be able to
teach both in Russian and in English. Appointees are expected to carry out
research of high level, to teach well, and to perform customary
administrative duties such as advising students, participating in
committees, organizing admissions, etc. The teaching load is up to 8
academic hours (= 6 astronomic hours) per week.

The salary level for this position is 189,471 rub. per month.  Initial
contract is normally signed for a period of up to five years, and can be
renewed by further 5 year terms.

The link for the details of the formal application procedure will be posted
here later.

In addition to the formal application sent according to the above link, all
applicants are invited to send a copy of their CV to Alina Zagorodnyuk <
chebyshev.msc at gmail.com> mentioning any detail that could be relevant to
the work of the selection committee, such as, for instance, the names of
students they supervised, if any, etc.

The minimum requirements for the position are as follows:

- the degree of Ph. D. (foreign) or Cand. Sci. (Russian);
- at least four refereed publications indexed simultaneously in MathSciNet
and Scopus in 2015-2020;
- at least three years of experience in research or teaching (excluding
Ph.D. studies but including work on research projects/grants).

Applications and questions on formalities should be sent to personnel
officer Aurelia Smorodintseva. Less formal questions should be sent to
Alina Zagorodnyuk <chebyshev.msc at gmail.com> who can also provide templates
for the formal documents to be submitted to the personnel officer, so we
recommend to contact Alina first and then send the official application.

The applications are accepted starting January 11, 2021.
*Deadline: *February 12, 2021.
Teaching starts: September 1, 2021.

*TCS and Logic group at the department includes*
Elena Arseneva (computational geometry, formerly at Universite Libre de
Edward A. Hirsch (proof complexity, jointly with Steklov Institute at
Alexander S. Kulikov (computational complexity, jointly with Steklov
Institute at St.Petersburg),
Alexander Okhotin (complexity of automata, formerly University of Turku),
Svetlana Puzynina (combinatorics, formerly at Universite Paris Diderot),
Saswata Shannigrahi (discrete geometry, formerly at IIT Guwahati),
Dmitry Sokolov (proof complexity, formerly at Lund University and
University of Copenhagen),
Stanislav Speranski (mathematical logic, formerly at Novosibirsk State
Alexander Tiskin (algorithms, formerly at University of Warwick).

The news on the department page:

More information about the Proof-Complexity mailing list