postdoc at UNSW Sydney (apply by September 13, 2021)

A 2-year postdoc position is available at UNSW Sydney.

The position is part of a new research project on “Improved algorithms via random sampling” (Serge Gaspers, Fedor Fomin, Daniel Lokshtanov) funded by the Australian Research Council. It revolves around the design and analysis of parameterized, moderately exponential, randomized, and approximation algorithms for graph problems.

Website: https://www.cse.unsw.edu.au/~sergeg/contact.html#postdocs
Email: serge.gaspers@unsw.edu.au

postdoc at UNSW Sydney (apply by September 13, 2021)

Complexity Postdoctoral Fellowship at Santa Fe Institute (apply by October 24, 2021)

Unique among postdocs, these 3-year fellowships offer the opportunity to join a collaborative community that nurtures creative, transdisciplinary thought in pursuit of key insights about the complex systems that matter most for science and society. Benefits include research/collaboration funds, paid family leave, and a professional leadership & development program.

Website: https://santafe.edu/news-center/news/apply-now-santa-fe-institute-postdoctoral-fellowships-2021
Email: sfifellowship@santafe.edu

Complexity Postdoctoral Fellowship at Santa Fe Institute (apply by October 24, 2021)

Postdoc at IST Austria (apply by August 31, 2021)

My group at IST Austria has an open postdoctoral position, part of an ERC Starting Grant project, whose goal is to develop new theory, and algorithms for scalable machine learning.

For questions, please contact dan.alistarh@ist.ac.at. The application should contain a CV, publication list, and a 1-page statement describing motivation and research interests.

Website: https://scaleml.pages.ist.ac.at/
Email: dan.alistarh@ist.ac.at

Postdoc at IST Austria (apply by August 31, 2021)

Postdoc at University of Vienna (apply by August 31, 2021)

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 applications.taa@univie.ac.at

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

Postdoc at University of Vienna (apply by August 31, 2021)

Assistant/Associate/Full Professorship in Machine Learning at Department of Computer Science, Faculty of Science, University of Copenhagen (apply by September 12, 2021)

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.

Website: https://candidate.hr-manager.net/ApplicationInit.aspx?cid=1307&ProjectId=154462&DepartmentId=18971&MediaId=4642
Email: simonsen@di.ku.dk

Assistant/Associate/Full Professorship in Machine Learning at Department of Computer Science, Faculty of Science, University of Copenhagen (apply by September 12, 2021)

postdoc at Bar-Ilan University (apply by July 15, 2021)

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.

Website: https://docs.google.com/document/d/1rCXAByE0J8VDLSXXq4p5a6LDVkBBRaRBrRQhOiCuo7U/edit
Email: moti.medina@biu.ac.il

postdoc at Bar-Ilan University (apply by July 15, 2021)

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)