We are looking for strong theory candidates working in the areas of machine learning, optimization, high dimensional statistics, privacy, fairness, and broadly interpreted data science. The postdoc is part of the Data Science fellows program at UCSD.
Apply to be an Assistant Professor, with a focus on Algorithmic Approaches to Socially Innovative Product Architectures and Business Models. This is a joint search by the Computer Science department and the Rady business school.
Postdoctoral Position at the computer science department, CMU. Hosted by Venkatesan Gurusawami and Pravesh Kothari. Start Date: Fall 2019 (Flexible)
Application Deadline: Feb 28, 2019 (earlier applications encouraged).
To apply, send CV, a research statement and arrange for 2 letters of recommendation to be set to be sent to email@example.com with subject line mentioning “CMU theory postdoc.”
Several one‐year post‐doc positions are available at the Computer Science Institute of Charles University, with a possibility of one-year extension. The positions are in areas of algorithms, cryptography, computational complexity, combinatorics and graph theory. Starting date is in Fall 2019, and can be negotiated.
Positions for PhD students are available at the Computer Science Institute of Charles University within the framework of the project “Efficient approximation algorithms and circuit complexity” funded by the Grant Agency of the Czech Republic. Applications are invited from candidates who have strong background in theoretical computer science or discrete mathematics. Starting date: Fall 2019.
The position is supported by a five year project “EPAC: Efficient approximation algorithms and circuit complexity” funded by the Grant Agency of the Czech Republic. The project is focused on approximation algorithms in fine-grained and parameterized complexity and on lower bound techniques. Starting date is in Fall 2019, and can be negotiated.
UT Austin invites applications for a Postdoctoral Fellow in theoretical computer science for the 2019-20 academic year to work with David Zuckerman. Research interests should overlap with his: pseudorandomness, computational complexity, coding theory, and more. Applications will be considered until the position is filled, but review of applicants will begin on February 5.