Lannelongue group University of Cambridge, UK

Join the team

We are always happy to hear from talented postdocs and PhD students, with more specific current opportunities advertised below and on Cambridge job portal. Interested students should read about postgraduates studies at Cambridge. More about Cambridge in the About section.

As a group, we value and encourage applications from a diversity of backgrounds and experiences to contribute to the highly interdisciplinary research programme. We strongly value and encourage Equity, Diversity and Inclusion as well as a flexible working environment.

Current opportunities

We currently have 1 open research positions, closing date 5/06/2025. This is a great opportunity to expand the work of the Green Algorithms Initiative and be at the forefront of Environmentally Sustainable AI.

Research Associate postdoc in Sustainability of AI

Research Associate (postdoc) in Sustainability of AI

This postdoctoral positition post will suit researchers interested in improving our understanding and mitigating the environmental impacts of data centres and artificial intelligence. Your primary role will be to lead projects improving how computing environmental impacts are currently estimated and reported and investigate the impacts of high-impact computational tools in AI. You will have research interests aligned with those of our group and the freedom to develop own ideas for new research. Initial possibilities for research projects include:

  • Studying environmental impacts of AI tools expected to become prominent in research in coming years.
  • Taking a global view on impacts of data centres and AI, encompassing environmental sustainability, human health, and perspectives from the Global South.
  • Exploring ways to better integrate life-cycle analyses in impact estimates and expanding environmental impacts beyond carbon footprint, with a focus on water usage.

Where? The group is based in the Department of Public Health and Primary Care, one of Europe’s leading academic departments for population health sciences. It sits in the new Victor Phillip Dahdaleh Heart & Lung Research Institute on the Cambridge Biomedical Campus (Papworth Road, Trumpington, Cambridge CB2 0BB), with the option of hybrid working (full remote not possible unfortunately).

With whom? You will be based in the Lannelongue group and work in close conjunction with the senior scientists in the Green Algorithms Initiative, including Prof Michael Inouye. You will also work closely with other members of the Department and scientific collaborators based in other institutions.

How long? The positions are for two years in the first instance, with the possibility of extension.

How to apply? To submit an application for this vacancy, please click on the ‘Apply online’ section of the advertisement published on the University’s Job Opportunities pages (links for each advert above!). This will route you to the University’s Web Recruitment System, where you will need to register an account (if you have not already) and log in before completing the online application form. The covering letter should outline (1) why you are applying for this role, (2) how you match the criteria for the post, and (3) what research question(s) you would be interested in pursuing.

About the Green Algorithms Initiative

The Green Algorithms Initiative is a world-leading project in the field of green computing focusing on quantifying and reducing the environmental impacts of computational science. The tools and frameworks developed and maintained by the group are used internationally and include the popular Green Algorithms online calculator, server-specific monitoring tools and the GREENER Principles for Environmentally Sustainable Computational Science. The group has a strong commitment to making all tools available open access to the computing community. The Green Algorithms Initiative has received both nominations and awards for its contributions to environmentally sustainable research (e.g. HDR-UK Impact Award). More info on the project’s website.