Use this form to post an ad on cstheory-jobs.org. If something is not clear, see an example. Ads should be for academic positions such as faculty, postdocs, teaching fellows, or researchers in universities or research labs. This website is maintained by the Committee for the Advancement of Theoretical Computer Science (CATCS).
The Department of Computer Science at the University of Warwick and the Warwick Mathematics Institute invite applications for a full Professor post in the areas on the interface of Computer Science and Mathematics, including Algorithms and Complexity, Theoretical Computer Science, and Discrete Mathematics.
The CS department at the University of Copenhagen invites applications for postdoc positions in TCS and/or combinatorial optimization. The application deadline is June 29. See http://www.jakobnordstrom.se/openings/Postdoc-UCPH-220629.html for the full announcement with more information and instructions for how to apply. Informal enquiries are welcome and may be sent to firstname.lastname@example.org.
Applicants with background in one of the following fields are invited to apply: discrete and convex geometry, algebraic algorithms, convex optimization, randomized numerical analysis, average case complexity theory. One year research only position. Please send your CV, a letter on your technical background and research interests, and two references for recommendation letters to Alperen Ergur.
We invite applications for multiple visiting scholar positions in any of the following areas:
* parallel and distributed algorithms/optimization, convex and non-convex optimization
* machine learning, graphical models, information theory
* network theory and graph matching
* deep learning, robustness in machine learning
Start and end dates flexible. Duration up to 4 months.
Applications are invited for a 4-year PhD studentship on Game Theory and Computational Social Choice on Blockchain at the University of Liverpool, in collaboration with the blockchain technology company IOHK. The selected candidate will be advised by Aris Filos-Ratsikas and Rahul Savani from the University of Liverpool, and Philip Lazos from IOHK.
We seek two early-career top candidates working in any subfield of TCS, preferably in algorithms and data structures, probabilistic computation, quantum and algorithmic information theory, computational biology, and computational complexity.
The Institute for Algorithms and Complexity at Hamburg University of Technology is seeking a postdoc to work on algorithms for combinatorial optimization and operations research (pay level TV-L 14). These can be approximation algorithms, parameterized algorithms, dynamic algorithms, streaming algorithms, or related. Join our international team to solve some of the most intractable problems!
If you are a student/scholar affected by the war in Ukraine, BGU offers an emergency scholarship, furthermore, I also have immediately available funds for those who are interested in doing research in Theoretical computer science or Error-Correcting Codes.
Website: https://www.tfaforms.com/399172?fbclid=IwAR1AW_tvfxoC6yA7EXcptO5tr3SjOM0dAgngz6v6WtlMfHr1ghDwXC0MMt4, https://www.cs.bgu.ac.il/~klim/
Sandia Labs is seeking a postdoc to work on quantum or quantum-inspired classical approximation, sublinear, or streaming algorithms, as part of a DOE-funded collaboration among several national labs and universities. We encourage theoretical computer scientists interested in quantum information but without prior expertise to apply.
Tel Aviv University offers emergency scholarship for research students from Ukraine (see attached). Further, I (Gil Cohen) have immediately available senior / students research fellows in theoretical computer science, coding theory, spectral graph theory, and adjacent mathematical branches.