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).
Two full-time 3-year postdoc positions in algorithms are available starting Jan 1, 2022 as part of the ERC Advanced Grant “Modern Dynamic Data Structures” to joint the algorithms research group headed by Monika Henzinger. Prior knowledge in fair algorithms and differential privacy is a plus. Please send your CV, a letter of motivation, and the names of 3 references to firstname.lastname@example.org
The researcher will join a rapidly growing department, with strong research sections in the areas of Algorithms and Complexity, Machine Learning, Natural Language Processing, Human-Centered Computing, Software Engineering and Data Management, Programming Languages, and Image Analysis.
The UCSD CSE Fellows Program is intended to support exceptional postdoctoral researchers in computer science. The program seeks to recruit 1-3 fellows a year for a two year postdoctoral appointment working alongside a UCSD CSE faculty mentor.
A postdoc position is available at the Network Computation group
at Bar-Ilan University (Israel). We invite applicants interested in the fields of distributed, online, and approximated computing on graph and network problems; Algorithms in hardware; circuit complexity; communication complexity; coding theory and distributed coding schemes.
The Computer Science department at Boston College invites applications for a postdoctoral position in the area of algebraic complexity under the supervision of Ilya Volkovich.
See attached pamphlet for more information.
Please direct any inquiries to Ilya Volkovich (Email: email@example.com)
The CS department at Lund University invites applications for a tenure-track assistant professorship in algorithms and complexity theory. The application deadline is June 8, 2021. See https://lu.varbi.com/en/what:job/jobID:388991/ 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.
The research group conducts research on fundamental questions of computation and information, is driven by curiosity, and provides a friendly, open-minded, and positive social environment. Potential research topics include algebraic graph algorithms, the theory of machine learning on graphs, circuit complexity, pseudorandomness, fine-grained and parameterized complexity. Includes some teaching.
The Faculty of Information Systems and Applied Computer Sciences invites applications for the position of Full Professor (W3 level) in Algorithms and Complexity Theory with a focus on algorithms and complexity theory for distributed and concurrent software systems as well for the acquisition, processing and visualisation of data in networked systems.
IDSIA opens two 4-year Ph.D. positions, starting on November 2021, in the area of algorithms and complexity, with a focus on approximation algorithms.
The gross year salary is around 50K CHF. Candidates should hold a Master Degree in Computer Science or related areas.
The interested candidates should email Prof. Fabrizio Grandoni a detailed CV and contact details of 2-3 references.
One Post-doctoral position is available under the guidance of Ioannis Panageas. The appointment is for one year and may be renewable if funding permits. Requirement is a Ph.D. in TCS/Theory of ML, or related field. Expertise can be demonstrated by 3 top-tier publications in venues like ICML, NeurIPS, AISTATS, STOC, FOCS, SODA, ICALP, EC. Anticipated starting date is October 1 2021 (negotiable).