Postdoc Opportunity in Algebraic Complexity at Boston College (apply by July 30, 2021)

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: ilya.volkovich@bc.edu)

Website: https://sites.google.com/site/ilyavv/Postdoc%20add.pdf
Email: ilya.volkovich@bc.edu

Postdoc Opportunity in Algebraic Complexity at Boston College (apply by July 30, 2021)

Tenure-track assistant professorship in algorithms and complexity theory at Lund University (apply by June 8, 2021)

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 jakob.nordstrom@cs.lth.se.

Website: https://lu.varbi.com/en/what:job/jobID:388991/
Email: jakob.nordstrom@cs.lth.se

Tenure-track assistant professorship in algorithms and complexity theory at Lund University (apply by June 8, 2021)

Two PhD/Postdoc Positions in Algorithms and Complexity Theory at Goethe-University of Frankfurt (apply by June 15, 2021)

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.

Website: https://tcs.uni-frankfurt.de/positions/
Email: tcs-applications@dlist.uni-frankfurt.de

Two PhD/Postdoc Positions in Algorithms and Complexity Theory at Goethe-University of Frankfurt (apply by June 15, 2021)

Faculty Full Professor at University of Bamberg, Germany (apply by June 18, 2021)

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.

Website: https://www.uni-bamberg.de/abt-personal/stellenausschreibung/professuren/
Email: michael.mendler@uni-bamberg.de

Faculty Full Professor at University of Bamberg, Germany (apply by June 18, 2021)

Ph.D. Student at IDSIA, USI-SUPSI, Lugano, Switzerland (apply by June 30, 2021)

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.

Website: https://people.idsia.ch//~grandoni/
Email: fabrizio@idsia.ch

Ph.D. Student at IDSIA, USI-SUPSI, Lugano, Switzerland (apply by June 30, 2021)

Postdoc at UC Irvine (apply by June 4, 2021)

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).

Website: https://recruit.ap.uci.edu/JPF06615
Email: ipanagea@ics.uci.edu

Postdoc at UC Irvine (apply by June 4, 2021)

Postdoc in Algorithms at University of Vienna (apply by May 16, 2021)

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.

Website: https://taa.cs.univie.ac.at/
Email: applications.taa@univie.ac.at

Postdoc in Algorithms at University of Vienna (apply by May 16, 2021)

Postdoc at University of Birmingham, UK (apply by May 20, 2021)

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.

Website: https://www.jobs.ac.uk/job/CFK453/research-fellow-in-theory-of-co-evolutionary-computation
Email: p.k.lehre@cs.bham.ac.uk

Postdoc at University of Birmingham, UK (apply by May 20, 2021)

Early career scientists at Amazon (apply by May 14, 2021)

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.

Website: https://www.amazon.science/amazon-advertising-opens-applications-for-early-career-scientists
Email: advertising-es-program@amazon.com

Early career scientists at Amazon (apply by May 14, 2021)