Sort by
Refine Your Search
-
Listed
-
Category
-
Country
-
Program
-
Field
-
specialization. Requirements We are looking for candidates who have: Solid analytical and mathematical abilities Experience with machine learning Experience with formal language theory or automata theory Strong
-
positions for distinguished professorship. Candidates in areas including, but not limited to, Algebra, Number Theory, Geometry, Topology, Combinatorics, Graph Theory are encouraged to apply. Responsibilities
-
provably powerful learning models for graphs will require new mathematical machinery. LOGSMS will combine diverse tools from discrete mathematics, learning theory and machine learning, thus facilitating
-
about the lab at: https://mbzuai.ac.ae/study/faculty/natasa-przulj/ and https://przulj-lab.github.io/ Qualifications PhD in Computer Science, Mathematics, Physics, Bioinformatics, or a related
-
expertise: A PhD in Computer Science or a closely related field, with specialization in Quantum computing and Graph theory In this role, you will be responsible for conducting research on graph theoretic
-
Optimization: Mathematical Phylogenetics During this project, you will work on fundamental graph-theoretic and algorithmic problems in mathematical phylogenetics. Job description The Discrete Mathematics and
-
Operator Algebras, Nonlinear Functional Analysis, Topology and Geometry, algebra, etc. l applied mathematics, including Partial Differential Equations, Dynamical Systems, Combinatorics and Graph Theory
-
of groups that are of interest in the context of rigidity, group cohomology, noncommutative geometry and index theory, harmonic analysis on groups, expander graphs and high-dimensional expanders. Required
-
-mail and by post will not be considered. Where to apply Website https://academicpositions.com/ad/empa/2026/phd-position-in-hierarchical-graph-n… Requirements Research FieldComputer scienceYears
-
theory and probabilistic methods, and it hopes to clarify how these two settings, hypergraphs and posets, connect through their shared saturation questions. Combinatorics and mathematics in Umeå