Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Field
-
or to: TU Dresden, Chair of Algorithmic and Structural Graph Theory, Prof. Daniel Neuen, Helmholtzstr. 10, 01069 Dresden, Germany. Please submit copies only, as your application will not be returned to you
-
May 31, 2028. This opening is in discrete mathematics, aligning with the research interests of Prof. Bernard Lidický and Prof. Shira Zerbib. This includes graph theory, discrete geometry, topological
-
Theory, Queuing Theory, Age of Information), Network Calculus, Graph Theory, Convex and Non-convex Optimization, Approximation Algorithms. An excellent Master’s degree in Computer Science, Engineering
-
. This opening is in discrete mathematics, aligning with the research interests of Prof. Bernard Lidický and Prof. Shira Zerbib. This includes graph theory, discrete geometry, topological combinatorics, extremal
-
tokerstin.achtruth@tu-dresden.de orto: TU Dresden, Chair of Algorithmic and Structural Graph Theory, Prof. Daniel Neuen, Helmholtzstr. 10, 01069 Dresden, Germany. Please submit copies only, as your application will
-
Structural Graph Theory, Prof. Daniel Neuen, Helmholtzstr. 10, 01069 Dresden, Germany. Please submit copies only, as your application will not be returned to you. Expenses incurred in attending interviews
-
, and controllability of Rydberg atom arrays - investigate the scalability and reliability of generating highly entangled states (including Clifford, graph, hypergraph, Dicke, and matrix product states
-
and optimization, we use tools such as artificial intelligence/machine learning, quantum conputing, graph theory, graph-signal processing, and convex/non-convex optimization. Furthermore, our
-
collaboration with the Intelligent Maintenance and Operations Systems (IMOS) Laboratory at EPFL (Prof. Olga Fink). IMOS focuses on the development of intelligent algorithms designed to improve the performance
-
use tools such as artificial intelligence/machine learning, graph theory and graph-signal processing, and convex/non-convex optimization. Furthermore, our activities are experimentally driven and