Admission Requirements

Students applying for admission should have a solid undergraduate training in a mathematical science.

Graduate Curriculum

Students study theoretical mathematics, applied mathematics, and an outside area in which mathematics is applied.

Faculty/Research

Meet the Applied Mathematical and Computational Sciences faculty members.

Interdisciplinary PhD program

AMCS collaborates with various departments across campus in educating its graduate students.

Request Information

Student Spotlights

PhD student Nuzhat Nuari Khan Rivu.

Nuzhat Nuari Khan Rivu

Rivu uses math to solve real-world problems.

Samuel Brensinger

Samuel Brensinger

Brensinger won the 2020 D.C. Spriestersbach Dissertation Prize from the Graduate College.

J Vernerio

J Verniero

Verniero received the 2019 Hancher-Finkbine Medallion based on their achievements.

Events

CS Colloquium - "Easy, Hard, and Impossible: Phase Transitions in Computation" promotional image

CS Colloquium - "Easy, Hard, and Impossible: Phase Transitions in Computation"

Friday, September 11, 2026 3:30pm to 4:30pm
Schaeffer Hall
Ida Cordelia Beam Distinguished Visiting Professor, Dr. Cristopher Moore, shows how to classify key problems in computing, data science, and statistical inference.
CS Colloquium - "Learning Sparse Dependence Structure in Complex-Valued Tensor Data" promotional image

CS Colloquium - "Learning Sparse Dependence Structure in Complex-Valued Tensor Data"

Friday, September 18, 2026 3:30pm to 4:30pm
Schaeffer Hall
Complex-valued tensor data arise in signal processing and neuroscience. Learn more about the method using local field potential recordings, where sparse separable factor analysis (SSFA) captures dependence across brain region, frequency, and time and supports reconstruction of missing signals
CS Colloquium - "Approximation Algorithms: Some ancient, some new - the good, the bad and the ugly" promotional image

CS Colloquium - "Approximation Algorithms: Some ancient, some new - the good, the bad and the ugly"

Friday, September 25, 2026 3:30pm to 4:30pm
Schaeffer Hall
Northwestern University's Peter and Adrienne Barris Chair of Computer Science will speak on the use of greedy algorithms for a basic graph problem called connected dominating set, and the development of LP based algorithms for a basic scheduling problem in the context of data center scheduling.
View more events