Show The Graduate Center Menu

Faculty

 
Amotz Bar-Noy
Brooklyn College
Website

Peter Brass
City College of New York
Website

Theodore Brown
Queens College
Website

Leonid Gurvits
City College of New York

Gabor T. Herman
Graduate Center
Website

Yumei Huo
College of Staten Island
Website

Matthew Johnson
Lehman College
Website

Saad Mneimneh
Hunter College
Website

Victor Pan
Lehman College
Website

Dina Sokol
Brooklyn College
Website

Felisa Vazquez-Abad
Hunter College
Website

Stathis Zachos
Brooklyn College
Website

 
 

Algorithms

An algorithm gives the sequence of steps to follow to find the solution of a specified problem. So whenever we know the properties the solution should have, but we do not know how to find it, we need to design an algorithm to solve the problem. Once an algorithm has been designed, central questions are its correctness or approximation quality, its complexity (runtime), and its generality—on what set of possible problem instances does the algorithm have the specified quality and complexity properties. Core algorithms topics among the Graduate Center's faculty interests are algorithms for graphs, strings, and scheduling; computational geometry, algorithmic game theory, and combinatorial optimization; numerical algorithms, and parallel and distributed algorithms.


Courses

 

C Sc 70010  Algorithms (4 credits)
C Sc 80030  Network Algorithms
C Sc 80040  Combinatorial Algorithms
C Sc 80050  Digital Geometry Algorithms
C Sc 80060  Advanced Data Structures
C Sc 80070  Modern Approximation Algorithms
C Sc 80080  Advanced Algorithms
C Sc 80200  Seminar in Algorithms (1 credit)
C Sc 80210  Topics in Algorithms
C Sc 86100  Algebraic and Numerical Algorithms