As part of the program Theory of Data Science & Deep Learning, we are searching for several brilliant postdocs. Candidates are required to have a strong background in theory or in Deep Learning.
The postdoctoral researchers will work both with the research group at the Technion and Bar-Ilan.
The duration of the fellowship can be anywhere between 1-3 years.
The positions are open until filled,
The Theory group in BIU at the Department of CS invites applications for several 1-3 years postdocs focusing on the theory of algorithms with the research group of Tsvi Kopelowitz, Ely Porat, and Liam Roditty. Topics include (but are not limited to): dynamic graph algorithms, fine-grained complexity, data structures, pattern matching, distributed computing, and streaming algorithms.
The Theory Group in the Dept. of Computing Science at U. of Alberta invites applications for a postdoc position.
The successful applicant is expected to work closely with Zachary Friggstad and Mohammad Salavatipour in the areas of: approximation algorithms, hardness of approximation, combinatorial optimization. For details see https://webdocs.cs.ualberta.ca/~mreza/pdf-ad7.pdf
Update: The Fellowship has been extended to all IBM Research locations, including the Almaden laboratory. The Mathematical Sciences Council of IBM Research invites applications for the Herman Goldstine Memorial Postdoctoral Fellowship for research in mathematical and computer sciences. Areas of interest include theoretical computer science and optimization.
The Computer Science Department at UT Austin invites applications for a Postdoctoral Fellow in theoretical computer science for the 2020-21 academic year. The Fellow will work with Dana Moshkovitz and David Zuckerman on pseudorandomness and computational complexity. Review of applicants will begin on January 15, but applications will be accepted until the position is filled.
St. Petersburg State University invites applications for four associate professorships within the new Department of Mathematics and Computer Science, where students are some of the best in the world.
All areas of mathematics and TCS will be considered, with preference given to candidates working in probability, mathematical physics, mathematical logic or TCS.
The postdoc position is in the area of computational complexity theory, focusing on questions at the intersection of approximation algorithms and subexponential algorithms. . This is includes both hardness results and algorithmic results. If so desired, up to 20% teaching can be included in the position. The position is for one year with a possible (and likely) extension to a second year.