Sort by
Refine Your Search
-
Listed
-
Country
-
Program
-
Employer
- NEW YORK UNIVERSITY ABU DHABI
- KINGS COLLEGE LONDON
- King's College London
- Korea Institute for Advanced Study
- University of Bergen
- Arizona State University
- Auburn University
- Bar Ilan University
- Bilkent University
- Delft University of Technology (TU Delft)
- EPFL - Ecole Polytechnique Fédérale de Lausanne
- Iowa State University
- Jagiellonian University
- King’s College London (University of London)
- Lodz University of Technology
- MASARYK UNIVERSITY
- Masaryk University
- Massachusetts Institute of Technology (MIT)
- Monash University
- Nature Careers
- New York University of Abu Dhabi
- Oak Ridge National Laboratory
- Princeton University
- Rutgers University
- Tampere University
- Technical University of Munich
- The Chinese University of Hong Kong
- The Hebrew University of Jerusalem
- UCL;
- University of Hamburg
- 20 more »
- « less
-
Field
-
Discrete Mathematics and conduct research related to problems in Combinatorics, Graph theory and aspects of the Constraint Satisfaction Problem (CSP) with emphasis on topological methods. Further
-
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
-
limited to artificial intelligence, computing theory (algorithms, complexity), data science, statistics, discrete mathematics (graph theory, combinatorics), game theory, machine learning, optimization
-
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 graph theory, Ramsey theory, probabilistic combinatorics. • Candidates should have (or be near completion of) a PhD in mathematics. • Candidates should have a strong research record in Combinatorics
-
Massachusetts Institute of Technology (MIT) | Cambridge, Massachusetts | United States | about 1 month ago
possess one or more of the following: Bachelor?s degree in Computer Science, Statistics, Mathematics, or Economics (with a strong quantitative orientation). Master?s Degree preferred but not required
-
has strong research groups in analysis, combinatorics, computational mathematics, differential equations, dynamical systems, geometry, graph theory, mathematical biology, mathematics education, number
-
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
-
associate to work on one or more of the following topics: Mathematical Physics, Spectral Theory, Quantum Chaos, Large Graphs and Quantum Walks. Related areas such as Quantum Information can also be considered
-
Shai Evra Graph theory, representation theory, number theory Adi Glucksam Complex analysis, potential theory, and dynamics Or Hershkovits Geometric analysis Mike Hochman Dynamical systems