An utterly unique opportunity to work on fundamental questions at the intersection of disciplines.
The fellowship offers:
-unparalleled intellectual freedom
-transdisciplinary collaboration with leading researchers worldwide -up to 3 years in residence at SFI
-dedicated funds for research & collaboration
-a structured leadership training program
-competitive salary and paid family leave
Email: Hilary Skolnik
1 postdoc position for up to 4 years is available at IDSIA as part of the SNSF Grant “Ideal Membership Problems and the Bit Complexity of Sum of Squares Proofs”. The gross salary is around 80K CHF per year, with low taxes. Candidates with strong background in math or theoretical computer science will be considered. The position will be filled as soon as an eligible candidate apply.
Two postdoc positions are available at Oxford as part of the UKRI Consolidator Grant “New Approaches to Approximability of Satisfiable Problems” led by Standa Zivny. Strong candidates with any background in maths or theoretical computer science will be considered. Background in approximation algorithms, universal algebra, category theory, combinatorics, or topology would be particularly useful.
We are looking for three assistant professors (T&R) in Computer Science. The vacancy is not restricted to applicants working in any specific area, but the research of the successful candidate will fall into at least one of three themes the department organises itself around: interactive systems, intelligent systems, and rigorous systems.
We invite outstanding applicants from all areas of computer science, including the Foundations of Computer Science. Salary and working conditions are internationally very competitive and come with civil servant status. Full professorships are chair positions with administrative staff. We offer dual-career & relocation support and a family-friendly environment. Knowledge of German is not required.
A postdoc position in theoretical computer sciece, algorithms and data structures or algorithmic data analysis is available in the Algorithmic Data Analysis group led by Prof. Dr. Christian Sohler in the department of mathematics/computer science at University of Cologne.
All candidates interested in working in logics and complexity theory utilising numerical features and real valued data are encouraged to apply.
The project topics range from logical foundations of probabilistic data and complexity theory utilising real numbers to logical approach to quantum information theory utilising the newly discovered connections to probabilistic team semantics.
DTU Compute’s section for Algorithms, Logic, and Graphs (AlgoLoG) invites applications for our next assistant or associate professor within logic and logic-based artificial intelligence or algorithms and data structures. The AlgoLoG section focuses on research in the foundations of computer science and discrete mathematics and application in industry.
We are looking for excellent candidates for 2 years postdoc positions in either complexity theory or quantum algorithms. The deadline and start dates are flexible. See details in the link below.
Informal enquiries are welcome and may be sent to Tom Gur.
Do you have a PhD and are you interested in researching the law and regulation of cybersecurity, and in combining this with insights from ethics and economics? If you are excited about doing this kind of research in an interdisciplinary environment, with a team of friendly and enthusiastic colleagues, and with partners from the financial and governmental sectors, then you may want to join us.