-
PhD Position in Theoretical Algorithms or Graph and Network Visualization - Promotionsstelle (m/w/d)
interfaces. Topics of interest include: Planar and geometric graph algorithms Approximation and parameterized algorithms Clustering, embeddings, and structural graph theory Computational complexity and
-
well as an independent researcher. Our work is interdisciplinary, international, and in-depth, but also practical. We offer a possibility to obtain broad and profound expertise, both theory and practice, in the field
-
researcher. Our work is interdisciplinary, international, and in-depth, but also practical. We offer the possibility to obtain broad and profound expertise, both theory and practice, in the field
-
: urban energy models and the urban heat island effect. Tasks: Work in a team on an international collaborative research project, which deals with the development of the new energy modelling framework. You
-
, studying health-related (mis-)information on social media and its impact on young adults. The position includes international research collaboration, methodological training, and a supportive work
-
of AI. The ideal candidates will have a background in computer science, statistics, mathematics, or related fields, as well as an interest in social science research methods and theories. The PhD
-
the 01.10.2022. Your Responsibilities: You will work at the cutting edge of privacy-preserving deep learning research with a focus on one or more of the following topics: - Optimal model design for differentially
-
. The project focuses on developing information theory, coding schemes, and other algorithmic methods for DNA data storage. Here is a video on the topic: https://www.bbc.com/future/article/20151122-this-is-how
-
. The position is hosted at the Chair for Algorithms and Complexity, headed by Prof. Susanne Albers (http://wwwalbers.in.tum.de/index.html.en). The dissertation work will involve research in the fields
-
13.01.2020, Wissenschaftliches Personal PhD position at the Chair of Algorithms and Complexity. Candidate shall work on approximation algorithms for scheduling problems in parallel and distributed