47 distributed-computing-"Delft-University-of-Technology" Postdoctoral positions at Technical University of Munich in Germany
Sort by
Refine Your Search
-
] Subject Area: Representation Theory Appl Deadline: 2025/07/31 11:59PM (posted 2025/07/01) Position Description: Position Description The TUM School of Computation, Information and Technology at the Technical
-
Engineering, Computer Engineering, Computer Science, or a closely related field Strong background in robotics fundamentals: kinematics, dynamics, control, planning Proficiency in programming (C++, Python), and
-
computer science with very good results - Interest on topics around the area of distributed systems and data management - Basic knowledge in distributed systems and graph algorithms is desired - Hand-on experience
-
and interest in one of the following fields: • Solid state quantum information science. • Quantum optical properties solid-state systems (e.g. semiconductor quantum dots, colour centers in wice gap
-
the study of the impact of digital and computational pathology on clinical workflows and patient care. Our lab is located in the heart of Munich at the TUM Klinikum rechts der Isar (MRI), Institute
-
The TUM School of Computation, Information and Technology at the Technical University of Munich (TUM) welcomes applications for a PhD or Postdoc Position (m/f/d, 100%, 2 years+) in Numerical Mathematics
-
of Computation, Information and Technology (CIT), located on the Garching Campus, starting October 01, 2025 or later. The group is seeking a highly qualified candidate for a postdoctoral position who possesses
-
technologies to fundamental physics questions. The advertised positions will be part of the project “QS-Gauge: quantum simulation of lattice gauge theories”, funded by the Emmy Noether programme of the DFG
-
or Postdoc Position in Numerical Mathematics m/f/d, 100%, 2 years+ As part of the second phase of the DFG funded Priority Programme SPP2311, the Chair for Numerical Mathematics under the leadership
-
that algorithmic parameters are tuned so that the over-approximation of the computed reachable set is small enough to verify a given specification. We will demonstrate our approach not only on ARCH benchmarks, but