A postdoc position is available at IRIF, CNRS, located at Paris, France, under the guidance of Amos Korman. The topic concerns the study of algorithmic game theoretical principles with a special focus on animal contexts. The study will include a large purely theoretical component but will also strive to connect to biology experiments, which are performed by collaborating biologists in Israel.
Website: https://amoskorman.com
Email: amos.korman@gmail.com
The two postdoc positions starting in the course of 2019 are funded by Prof. Bürgisser’s ERC Advanced Grant “COCAN: Complexity and Condition in Algebra and Numerics” and do not involve teaching duties. Topics: numerical algorithms in algebraic geometry, random real algebraic varieties, computational (and geometric) invariant theory, complexity theory, convex optimization.
Website: https://mathhire.org/jobs/614
Email: pbuerg@math.tu-berlin.de
IRIF (Paris, France), is seeking excellent candidates for about 10 postdoc positions in all areas of the TCS.
The positions are financed either by the laboratory resources, group or personal grants, or by joint applications of IRIF members and the candidate to outside funding agencies. The starting date of the positions will be in the course of 2019, usually around September-October.
Website: https://www.irif.fr/en/postes/postdoc
Email: announces@irif.fr
The Computer Science and Eng. Dep. of the European University Cyprus and AAI Scientific Cultural Services Ltd. invite applications for 2 positions of Researchers to work on clustering problems using mainly using Graph Theory (for ~2 years). The developed solutions will also be implemented. The Gross Monthly Salary is approx 1,670 – 2,500 euros.
Website: http://ahpc.euc.ac.cy/
Email: v.papadopoulou@euc.ac.cy
TTIC invites applications for the following positions: 3-year research assistant professor, tenure-track assistant professor, tenured full or associate professor, visiting professor.
TTIC/Simons-Berkeley Joint Program.
Applicants for research assistant professor positions (RAP) in theoretical computer science are encouraged to simultaneously apply for the TTIC RAP program and Simons Fellowship.
Website: http://www.ttic.edu/faculty-hiring/
Email: recruiting@ttic.edu
The Algorithms and Complexity group of IRIF (CNRS and University Paris Diderot), Paris, France, is seeking excellent candidates for postdoctoral positions in classical and quantum computing.
Website: https://www.irif.fr/en/equipes/algocomp/index
Email: adiro@irif.fr
The Simons Institute for the Theory of Computing invites applications for Simons-Berkeley Research Fellowships for 2019-2020. Simons-Berkeley Research Fellowships are intended for exceptional young scientists to participate in at least one of the programs at the institute. The Institute will host programs on Proofs, Consensus, & Decentralizing Society; The Quantum Wave in Computing; and Lattices.
Website: https://simons.berkeley.edu/fellows2019-2020
Email: uta@berkeley.edu
The Simons Institute for the Theory of Computing invites applications for Simons-Berkeley Research Fellowships for Summer 2019. Simons-Berkeley Research Fellowships are intended for exceptional young scientists to participate in at least one of the programs at the institute. The Institute will host a program on “Deep Learning: From Practical Challenges to Theoretical Foundations” in Summer 2019.
Website: https://simons.berkeley.edu/fellows2019-2020
Email: uta@berkeley.edu
The College of Engineering & Applied Science at CU Boulder is seeking applications for tenure-track faculty positions at all levels in Quantum Information Science & Engineering, as part of the college’s long-term growth plan. We are especially interested in qualified candidates who can contribute, through research, teaching, & service, to the diversity and excellence of our academic community.
Website: https://jobs.colorado.edu/jobs/JobDetail/?jobId=13232
Email: kelvin.wagner@colorado.edu
The TCS Group at KTH invites applications for a PhD position in CS focusing on algorithms for solving the Boolean satisfiability problem (SAT) very efficiently for large classes of instances, and on analyzing and understanding such algorithms. See http://www.csc.kth.se/~jakobn/openings/J-2018-2101-Eng.php for more information. Informal enquiries are welcome and may be sent to jakobn@kth.se .
Website: http://www.csc.kth.se/~jakobn/openings/J-2018-2101-Eng.php
Email: jakobn@kth.se
Theoretical Computer Science Jobs 