Sort by
Refine Your Search
-
355137 “From Extremal Combinatorics to Algorithms and Back”. About the project/work tasks This project bridges two foundational fields in computer science and mathematics: Theory of Algorithms and Extremal
-
Matter Physics o Physical Chemistry and Theoretical Chemistry o Combinatorics, Algorithm, Extremal Graph Theory, Computing Theory o Programming Language, AI Theory or Machine Learning o Classical and
-
Graph Theory, Computing Theory o Programming Language, AI Theory or Machine Learning o Classical and Quantum Algorithm for Computational Quantum Many-body Theory o Theory and Computation of Correlated
-
, extremal combinatorics, structural graph theory, and related fields. Qualifications and personal qualities Applicants must hold a master's degree or equivalent education in Mathematics (Combinatorics and/or
-
, control theory, data science, data driven methods, discrete mathematics, graph algorithms, high-performance computing, integral equations and nonlocal models, linear and multilinear algebra, machine
-
-based networks graph-based approaches Bayesian learning information theory Documented strong programming skills (preferably Python), for example with contributions to open-source projects, with an active
-
topics such as: neural networks self-supervised learning convolutional neural networks transformer-based networks graph-based approaches Bayesian learning information theory Documented strong programming
-
in the following areas: Deep Learning, Scientific Machine Learning, Stochastjc Gradiant Descent Method, and Numerical PDE’s - Advised by Dr. Yanzhao Cao Probabilistic Graph Theory (Network Traversal