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: firstname.lastname@example.org)
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 email@example.com.
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).
We are looking for an excellent researcher to join our project on “Fast Algorithms for a Reactive Network Layer” funded by the Austrian NSF. It will lay the algorithmic foundations of more adaptive networks, using algorithmic tools from many areas of algorithms research. This is a collaboration between the research groups of Monika Henzinger at U Vienna and of Stefan Schmid at TU Berlin.
We seek a Research Fellow (3 yr) to work on an UKRI-funded project on co-evolution. Co-evolutionary algorithms mimick natural selection, e.g. for minmax optimisation or learning game playing strategies.
The postdoc will develop time-complexity analysis of co-evolutionary algorithms, and should have a track record in theory of evolutionary computation, algorithmic game theory, and/or algorithms.
Amazon Advertising is launching a new, 2-year program for recent PhDs. It offers full-time two-year positions, aimed at recent PhD graduates who want to innovate, publish, and have their work impact millions of customers. Key areas include but are not limited to: machine learning, economics, marketing, operations research, and statistics. The application deadline is May 14.
CIFellows is a general CRA/CCC program for matching postdocs with advisors, and supports 2-year postdocs. Applications will open mid-April, and are due early May. It is competitive across all areas of CS.