Course Schedule

Current semester Spring 2027, and future semesters are now available to view.

View undergraduate course grid View graduate course grid

Number

Name

Professor(s)

Meet Time

Room

CSCI-GA.1170-001
DS-GA.1170-001
(4336) Fundamental Algorithms Yevgeniy Dodis W 4:55-6:55PM CIWW 109

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Required Foundational course for MSCS, MSIS

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1170-002
DS-GA.1170-002
(4337) Fundamental Algorithms Recitation TBA R 5:55-6:45PM 60 Fifth Ave 150 Additional information: Recitation for Section 001

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Required Foundational course for MSCS, MSIS

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1170-003
DS-GA.1170-002
(4338) Fundamental Algorithms Recitation TBA F 4:55-5:45PM 60 Fifth Ave 150 Additional information: Recitation for Section 001

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Required Foundational course for MSCS, MSIS

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1170-004
(4339) Fundamental Algorithms Yevgeniy Dodis T 4:55-6:55PM CIWW 312 Additional information: Recitation for Section 003

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Required Foundational course for MSCS, MSIS

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1170-005
(4340) Fundamental Algorithms Recitation TBA R 3:45-4:35PM GCASL 275 Additional information: Recitation for Section 004

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Required Foundational course for MSCS, MSIS

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1180-001
(4341) Mathematical Techniques For CS Applications Parijat Dube R 7:10-9:10PM CIWW 317

Course Description:

An introduction to theory, computational techniques, and applications of linear algebra, probability and statistics. These three areas of continuous mathematics are critical in many parts of computer science, including machine learning, scientific computing, computer vision, computational biology, natural language processing, and computer graphics. The course teaches a specialized language for mathematical computation, such as Matlab, and discusses how the language can be used for computation and for graphical output. No prior knowledge of linear algebra, probability, or statistics is assumed.
CSCI-GA.2110-001
(4342) Programming Languages Cory Plock M 4:55-6:55PM CIWW 109

Course Description:

Discusses the design, use, and implementation of imperative, object-oriented, and functional programming languages. The topics covered include scoping, type systems, control structures, functions, modules, object orientation, exception handling, and concurrency. A variety of languages are studied, including C++, Java, Ada, Lisp, and ML, and concepts are reinforced by programming exercises.

Prerequisites: Students taking this class should already have substantial programming experience.
CSCI-GA.2110-002
(4343) Programming Languages Recitation TBA R 7:10-8:00PM 60 Fifth Ave 150 Additional information: Recitation for Section 001

Course Description:

Discusses the design, use, and implementation of imperative, object-oriented, and functional programming languages. The topics covered include scoping, type systems, control structures, functions, modules, object orientation, exception handling, and concurrency. A variety of languages are studied, including C++, Java, Ada, Lisp, and ML, and concepts are reinforced by programming exercises.

Prerequisites: Students taking this class should already have substantial programming experience.
CSCI-GA.2110-003
(4344) Programming Languages Recitation TBA F 11:15-12:05PM Silv 206 Additional information: Recitation for Section 001

Course Description:

Discusses the design, use, and implementation of imperative, object-oriented, and functional programming languages. The topics covered include scoping, type systems, control structures, functions, modules, object orientation, exception handling, and concurrency. A variety of languages are studied, including C++, Java, Ada, Lisp, and ML, and concepts are reinforced by programming exercises.

Prerequisites: Students taking this class should already have substantial programming experience.
CSCI-GA.2130-001
(4345) Compiler Construction Sam Westrick M 10:15-12:15PM 60 Fifth Ave C15

Course Description:
This is a capstone course based on compilers and modern programming languages. The topics covered include structure of one-pass and multiple-pass compilers; symbol table management; lexical analysis; traditional and automated parsing techniques, including recursive descent and LR parsing; syntax-directed translation and semantic analysis; run-time storage management; intermediate code generation; introduction to optimization; and code generation. The course includes a special compiler-related capstone project, which ties together concepts of algorithms, theory (formal languages), programming languages, software engineering, computer architecture, and other subjects covered in the MS curriculum. This project requires a substantial semester-long programming effort, such as construction of a language compilation or translation system that includes lexical and syntactic analyzers, a type checker, and a code generator.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250.
CSCI-GA.2250-001
(4346) Operating Systems Hubertus Franke M 7:10-9:10PM GCASL 383

Course Description:

The topics covered include the high-level design of key operating systems concepts such OS structures; process scheduling and synchronization; deadlocks and their prevention; memory management, including (demand) paging; and I/O and file systems. The concepts will be shown in the context of Unix/Linux. The learning is facilitated with labs that implement some of these key design principles and algorithms in C/C++.

Prerequisites: None
CSCI-GA.2250-002
(4347) Operating Systems Mohamed Zahran T 4:55-6:55PM Online

Course Description:

The topics covered include the high-level design of key operating systems concepts such OS structures; process scheduling and synchronization; deadlocks and their prevention; memory management, including (demand) paging; and I/O and file systems. The concepts will be shown in the context of Unix/Linux. The learning is facilitated with labs that implement some of these key design principles and algorithms in C/C++.

Prerequisites: None
CSCI-GA.2262-001
(4348) Data Communications and Networks Jean-Claude Franchitti M 7:10-9:10PM 60 Fifth Ave 150

Course Description:

This course teaches the design and implementation techniques essential for engineering robust networks. Topics include networking principles, Transmission Control Protocol/Internet Protocol, naming and addressing (Domain Name System), data encoding/decoding techniques, link layer protocols, routing protocols, transport layer services, congestion control, quality of service, network services, programmable routers and overlay networks.

Prerequisites: Students must have a working knowledge of fundamental data structures and associated algorithms. For some of the practical aspects of the course, a working knowledge of an object-oriented programming language (e.g., C++, C#, or preferably Java) is expected. An undergraduate course in data communication and networks is helpful but not required.
CSCI-GA.2421-001
MATH-GA 2020-001
(4495) Numerical Methods II TBA MW 11:00-12:15PM CIWW 1302

Course Description:

This course will cover fundamental methods that are essential for the numerical solution of differential equations. It is intended for students familiar with ODE and PDE and interested in numerical computing; computer programming assignments form an essential part of the course. The course will introduce students to numerical methods for (1) nonlinear equations, Newton's method; (2) ordinary differential equations, Runge-Kutta and multistep methods, convergence and stability; (3) finite difference, finite element and integral equation methods for elliptic partial differential equations; (4) fast solvers, multigrid methods; and (5) parabolic and hyperbolic partial differential equations.

Text: LeVeque, R. (2007). Classics in Applied Mathematics [Series]. Finite Difference Methods for Ordinary and Partial Differential Equations. Philadelphia, PA: Society for Industrial and Applied Mathematics

Prerequisites: Numerical linear algebra, elements of ODE and PDE.
CSCI-GA.2433-001
DS-GA.2433-001
(4350) Database Systems Matthew Zeidenberg W 4:55-6:55PM Silv 208

Course Description:
Database system architecture. Modeling an application and logical database design. The relational model and relational data definition and data manipulation languages. Design of relational databases and normalization theory. Physical database design. Concurrency and recovery. Query processing and optimization.
CSCI-GA.2436-001
(4399) Realtime and Big Data Analytics Yang Tang R 4:55-6:55PM CIWW 101

Course Description:

This course introduces architectures and technologies at the foundation of the Big Data movement. These technologies facilitate scalable management and processing of vast quantities of data collected through realtime and near realtime sensing. We explore tools enabling the acquisition of data in the social domain and the fusion of those data when in flight and at rest using Hadoop and Hadoop-related tools.

The material covered in this course aligns with the prevailing state of the art in Big Data technologies, which continues to be a rapidly evolving landscape as new technologies emerge and existing ones evolve and mature.

Students are required to complete weekly reading and/or programming assignments and demonstrate mastery of course topics by designing, developing, and demonstrating an analytics project of their choosing. Class time will be set aside for project proposal and final demo.

This is an introductory Hadoop course intended for students who have no experience with the Apache Hadoop ecosystem of tools and frameworks.
CSCI-GA.2437-001
(4400) Big Data Application Development Yang Tang T 7:10-9:10PM CIWW 101

Course Description:

This is an introductory course on Spark programming, Spark architecture, Spark SQL, Spark Streaming, and integration of Spark with the Hadoop ecosystem for developing Big Data analytics applications. The course project can be completed with Scala or Python, and Spark. This course covers technologies that integrate well with Spark in the creation of Big Data analytics applications.

Students are required to complete weekly reading and programming assignments and demonstrate mastery of course topics by developing a final project using Spark.

Prerequisites: Students are required to successfully complete CSCI-GA 2436 Realtime and Big Data Analytics prior to taking this course. Students should have experience with Hadoop MapReduce and HDFS.
CSCI-GA.2560-001
(4351) Artificial Intelligence Paul Bethe M 4:55-6:55PM 60 Fifth Ave 150

Course Description:

There are many cognitive tasks that people do easily and almost unconsciously but that have proven extremely difficult to program on a computer. Artificial intelligence is the problem of developing computer systems that can carry out these tasks. This course covers problem solving and state space search; automated reasoning; probabilistic reasoning; planning; and knowledge representation.
CSCI-GA.2565-001
(4352) Machine Learning Rajesh Ranganath W 4:55-6:55PM Silv 408

Course Description:

This course covers a wide variety of topics in machine learning, pattern recognition, statistical modeling, and neural computation. The course covers the mathematical methods and theoretical aspects but primarily focuses on algorithmic and practical issues.

Prerequisites:
Undergraduate course in linear algebra and strong programming skills for implementation of algorithms studied in class. Strong knowledge of probability. Recommended: knowledge of vector calculus, elementary statistics, CSCI-GA.1180 Mathematical Techniques for CS Applications.
CSCI-GA.2572-001
DS-GA.1008-001
(4389) Deep Learning Yann LeCun
Alfredo Canziani M 4:55-6:55PM Silv 408

Course Description:

This course concerns the latest techniques in deep learning and representation learning, focusing on supervised and unsupervised deep learning, embedding methods, metric learning, convolutional net and recurrent nets, with applications to computer vision, natural language understanding, and speech recognition.

Prerequisites: DS-GA 1001 Intro to Data Science or a graduate-level machine learning course.
CSCI-GA.2572-002
DS-GA.1008-002
(4390) Deep Learning Lab Alfredo Canziani F 12:30-1:20PM Silv 405 Additional information: Lab for Section 001

Course Description:

This course concerns the latest techniques in deep learning and representation learning, focusing on supervised and unsupervised deep learning, embedding methods, metric learning, convolutional net and recurrent nets, with applications to computer vision, natural language understanding, and speech recognition.

Prerequisites: DS-GA 1001 Intro to Data Science or a graduate-level machine learning course.
CSCI-GA.2590-001
(4353) Natural Language Processing Adam Meyers W 4:55-6:55PM Silv 207

Course Description:

How can we teach machines to understand human languages so that they can answer queries, summarize dense information, or hold a conversation with us? The primary goal of this course is to provide students with the principles and state-of-the-art tools needed to solve a variety of NLP problems. We will focus on three paradigms in the field of NLP: supervised learning, pretrain-then-finetune, and the most recent large language models, with a focus on representation learning techniques. Students are expected to read research papers and gain hands-on experience through coding assignments.

Prerequisites:
Probability, statistics, linear algebra (DS-GA.1002, MATH-UA.140, MATH-UA.235); Algorithms and data structure (CSCI-UA.102); Basic knowledge in machine learning (DS-GA.1003, CSCI-UA.0473). We will not spend a significant amount of time on machine learning basics so some prior exposure to the supervised learning framework (e.g., loss functions, SGD) is expected. Good comfort level with Python
CSCI-GA.2620-001
(4354) Networks and Mobile Systems Lakshminarayanan Subramanian T 10:15-12:15PM 60 Fifth Ave 250

Course Description:

This is a capstone course. A course in computer networks and large-scale distributed systems. Teaches the design and implementation techniques essential for engineering both robust networks and Internet-scale distributed systems. The goal is to guide students so they can initiate and critique research ideas in networks and distributed systems and implement and evaluate a working system that can handle a real-world workload. Topics include routing protocols, network congestion control, wireless networking, peer-to-peer systems, overlay networks and applications, distributed storage systems, and network security.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250.
CSCI-GA.2820-001
(4391) DevOps and Agile Methodologies John Rofrano T 4:55-6:55PM Online

Course Description:

This course uses a project based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.
CSCI-GA.2820-002
(4392) DevOps and Agile Methodologies Lab John Rofrano T 7:10-8:00PM Online Additional information: Lab for Section 001.

Course Description:

This course uses a project based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.
CSCI-GA.2820-003
(4393) DevOps and Agile Methodologies John Rofrano W 4:55-6:55PM Online

Course Description:

This course uses a project based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.
CSCI-GA.2820-004
(4394) DevOps and Agile Methodologies Lab John Rofrano W 7:10-8:00PM Online Additional information: Lab for Section 003

Course Description:

This course uses a project based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.
CSCI-GA.2830-001
(4395) The Lean Launch Pad* Yiannis Broustas R 10:15-12:15PM 60 Fifth Ave 125 Additional information: Open only to students in the MS-CEI program.

Course Description:

Only open to MS students in the Computing, Entrepreneurship, and Innovation program.

This course is based on Steve Blank’s Lean LaunchPad curriculum. This course provides real world, hands on learning on what it’s like to actually start a high tech company. This is a practical class – essentially a lab, not a theory or “book” class. The goal, within the constraints of a classroom and a limited amount of time, is to create an entrepreneurial experience for students with all of the pressures and demands of the real world in an early stage start up. Students will talk to customers, partners, competitors, as they encounter the chaos and uncertainty of how a startup actually works. They will work in teams learning how to turn a great idea into a great company. They will learn how to use a business model to brainstorm each part of a company and customer development to get out of the classroom to see whether anyone would want/use their product. Finally, based on the customer and market feedback gathered, students will use agile development to rapidly iterate their products to build something customers would actually use and buy. Each day will be a new adventure outside the classroom as students test each part of their business model and then share the hard earned knowledge with the rest of the class.
CSCI-GA.2830-002
(4396) The Lean Launch Pad Lab* Yiannis Broustas R 12:30-1:20PM 60 Fifth Ave 125 Additional information: Open only to students in the MS-CEI program.

Course Description:

Only open to MS students in the Computing, Entrepreneurship, and Innovation program.

This course is based on Steve Blank’s Lean LaunchPad curriculum. This course provides real world, hands on learning on what it’s like to actually start a high tech company. This is a practical class – essentially a lab, not a theory or “book” class. The goal, within the constraints of a classroom and a limited amount of time, is to create an entrepreneurial experience for students with all of the pressures and demands of the real world in an early stage start up. Students will talk to customers, partners, competitors, as they encounter the chaos and uncertainty of how a startup actually works. They will work in teams learning how to turn a great idea into a great company. They will learn how to use a business model to brainstorm each part of a company and customer development to get out of the classroom to see whether anyone would want/use their product. Finally, based on the customer and market feedback gathered, students will use agile development to rapidly iterate their products to build something customers would actually use and buy. Each day will be a new adventure outside the classroom as students test each part of their business model and then share the hard earned knowledge with the rest of the class.
CSCI-GA.2945-004
(4496) Adv Topics Num Analysis: High Performance Computing Georg Stadler
Florian Schaefer TR 2:00-3:15PM CIWW 1302

Course Description:

Convex optimization problems have many important properties, including a powerful duality theory and the property that any local minimum is also a global minimum. Nonsmooth optimization refers to minimization of functions that are not necessarily convex, usually locally Lipschitz, and typically not differentiable at their minimizers. Topics in convex optimization that will be covered include duality, linear and semidefinite programming, CVX ("disciplined convex programming"), gradient and Newton methods, Nesterov's complexity bound, the alternating direction method of multipliers, the nuclear norm and matrix completion, the primal barrier method, primal-dual interior-point methods for linear and semidefinite programs. Topics in nonsmooth optimization that will be covered include subgradients and subdifferentials, Clarke regularity, and algorithms, including gradient sampling and BFGS, for nonsmooth, nonconvex optimization. Homework will be assigned, both mathematical and computational. Students may submit a final project on a pre-approved topic or take a written final exam.

Prerequisites: Topics determine prerequisites.
CSCI-GA.3033-026
(4372) Special Topics: Cloud Computing Jean-Claude Franchitti R 7:10-9:10PM CIWW 312

Course Description:

This course is a capstone course that introduces the latest cloud multi-access computing platform services including support for Internet of Things (IoT), Artificial Intelligence (AI), Web3 decentralized platforms, and other technologies. These services may be leveraged to create industry 4.0 and 5.0 innovative Intelligent Autonomous Networked (IAN) business solutions and deploy them on hybrid multi-cloud platforms so they can operate at the network edge to minimize latency and power consumption. Students will learn about services provided on the top “Big Clouds”, namely Amazon AWS Cloud, Google Cloud, Microsoft Azure Cloud, IBM Cloud, Oracle Cloud, Salesforce, and others. Related services provided on the Cloud and covered in the course include computing and hosting services, storage services, networking services, container management services (e.g., K8s), and shallow/deep machine learning services. Once familiar with Cloud services, Students will learn how to combine them to support cognitive computing and enable the creation of IAN solutions that cater to the practical needs of industry 4.0/5.0 and society 5.0 users in novel and creative ways. As they create these IAN solutions, students will learn about immersive Augmented/Virtual Reality (AR/VR) User Experience and Interfaces (UX/UI), hybrid decentralized computing and DApps, multi-access computing and Internet of Things (IoT), Mobility/5G networking and Software Defined Network (SDN) infrastructures, advanced robotics, and various key aspects of digital security that are critical to ensure the safety of modern software solutions. Throughout the course, students will develop their own Intelligent Autonomous Networked (IAN) business solutions using Cloud-based shallow/deep machine learning and other services and capabilities as noted above. Sample platforms and related application components will be provided as applicable to speed up the development and deployment process.

Prerequisites: Programming experience in C/C++, JavaScript, Python, and SQL; basic understanding of assembly language; working knowledge of web application development.
CSCI-GA.3033-034
(4373) Special Topics: Multicore Processors: Architecture & Programming Mohamed Zahran W 12:30-2:30PM Online

Course Description:

This course serves as a capstone for the MSCS program.

The tremendous advances in process technology have created a revolution both in hardware and in software. On the hardware side, we moved from single core processors to multicore/manycore processors. Multicore chips are now everywhere. You can find them in smartphones, playstations, notebooks, all the way up to supercomputers. To benefit from these chips, software must be parallelized, which starts another revolution in software. The purpose of this course is to introduce you to both the hardware advances and parallel programming techniques targeting multicore and manycore processors. You will learn how to make the best use of the underlying hardware to build applications that are faster, more power efficient, and more reliable.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-059
(4374) Special Topics: Big Data Science Anasse Bari R 4:55-6:55PM Tisch LC9

Course Description:

Data Science has recently gained a substantial interest in a variety of industries including healthcare, finance, manufacturing and marketing. It is positioned at the intersection point of computer science, data mining, machine learning, predictive analytics, business, statistics and domain expertise. It aims at finding hidden knowledge (patterns, models, associations) for the purpose of making better decisions. This course will introduce the basic fundamental concepts of the algorithms and the tools of extracting valuable insights from data with the ability to formulating and solving problems with it. Topics of this course include, but are not limited to: Basics of Data Analytics Project Lifecycle, Developing an Analytics Roadmap, Data Preprocessing, Data Analytics Use cases, Data Cleaning Algorithms, Feature Selection Algorithms, Introduction to Hadoop in Theory and in Practice, Algorithms for Finding Similar Data Items, Dimensionality Reduction techniques, Clustering Algorithms, Classification Algorithms, Introduction to Sentiment Analysis in short text (e.g Tweets), Mining Association Rules, Performance Measures, Ensemble Methods, Information retrieval systems and Recommendation Systems with applications in Bio-informatics, Text Mining and Social Network Analytics.

Prerequisites: Strong programming skills in the Java language and fundamentals of linear algebra.
CSCI-GA.3033-099
DS-GA 3001-009
(4403) Special Topics in DS: Introduction to Computer Vision Jean Ponce M 2:45-4:45PM Silv 401

Course Description:

This course aims to cover broad topics in computer vision, and is not primarily a deep learning course. We will cover topics in traditional computer vision such as camera geometry, image formation, segmentation, object recognition, classification, and detection.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-115
DS-GA.3001-003
(4404) Special Topics: Embodied Learning and Vision Mengye Ren R 2:45-4:45PM 12WP L113

Course Description:

This graduate level course covers advanced topics in embodied visual learning, perception and planning, with applications to robotics and self-driving. Topics include deep learning, computer vision, 3D perception, unsupervised 3D learning, self-supervised representation learning, continual learning, and LLM agents. Students are expected to know basic knowledge of machine learning, deep learning, and computer vision. Students are expected to be proficient in programming in Python. Advanced undergraduate students may enroll upon instructor approval.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-123
(6950) Special Topics: Encrypted Computation Nir Bitansky W 10:15-12:15PM 60 Fifth Ave C15

Course Description:

The modern computing environment is very different than it used to be. Sensitive information that once existed only on local trusted machines—medical records, personal preferences, and our finances–is now stored and processed by various entities onew the web, who we often do not trust. To maintain privacy in this reality, a new array of cryptographic tools has been developed over the past decade and a half allowing different forms of encrypted computation. This includes: fully-homomorphic encryption, attribute-based encryption, functional encryption, and program obfuscation. The course will cover some of these advances with special focus on the main open questions in the area.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-130
CS-GY.9223-J
(4379) Special Topics: Randomness and Computation Sanjeev Khanna T 2:45-4:45PM CIWW 202

Course Description:

Can you determine whether two very large documents are identical by examining only a handful of bits? Can you verify the output of a program without redoing the entire computation? Can you be convinced of the correctness of a mathematical proof by checking only a few random bits? Can you properly color a graph without ever seeing all of its edges? Surprisingly, the answer to all these questions is yes — provided we allow the use of randomization.

Randomness has emerged as a fundamental resource in computation, enabling algorithms that are often simpler, faster, or more space-efficient than their deterministic counterparts. This course will explore the design and analysis of randomized algorithms, as well as their inherent limitations, studied through query complexity and communication complexity. Topics include sublinear algorithms, approximation algorithms and hardness of approximation, algebraic fingerprinting techniques, interactive proofs and the PCP theorem, random walks and Markov chains with applications to bounded-space computation, and the complexity classes that capture randomized computation, including BPP, RP, and ZPP.

The course is suitable for graduate students and advanced undergraduates, with a strong preparation in undergraduate algorithms (for instance, CSCI-GA.3520-001 or equivalent).

Note: The topics in this course are largely disjoint from those in Prof. Anupam Gupta’s Fall 2025 class on Randomized Algorithms. This course is suitable both for students who have not taken Prof. Gupta’s class and for those who have, and wish to continue exploring randomized algorithms.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-144
(4381) Special Topics: Convergence Analysis for Robot Algorithms Benjamin Riviere M 12:30-2:30PM 60 Fifth Ave C10

Course Description:
This course studies the mathematical foundations of robot algorithms through the lens of convergence analysis, with applications in modern robotics. Students will develop a unified theoretical toolkit and use it to analyze when, why, and how fast algorithms converge across topics including trajectory optimization, reinforcement learning, motion planning, estimation, and multi-agent systems. A recurring theme is the interplay between theoretical guarantees and real-world deployment, including how convergence properties degrade under noise, model mismatch, and sim-to-real transfer. The prerequisites are linear algebra, probability, and calculus. No prior experience in robotics is necessary.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-934
(4385) Special Topics: Multicore Processors: Architecture & Programming Recitation TBA F 12:30-1:20PM 60 Fifth Ave 150 Additional information: Recitation for Section 034

Course Description:

This is the recitation for section 034. Refer to the lecture for description.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-998
DS-GA.3001-010
(4405) Special Topics: Embodied Learning and Vision (Recitation) STAFF R 4:55-5:45PM Bobst LL138 Additional information: Recitation for Section 115

Course Description:

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-999
(4406) Special Topics: Intro to Computer Vision Recitation STAFF W 11:15-12:05PM 60 Fifth Ave 150 Additional information: Recitation for Section 099

Course Description:

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3140-001
(4398) Abstract Interpretation Patrick Cousot M 4:55-6:55PM 60 Fifth Ave 161

Course Description:

Many numerical or symbolic problems are very hard or even undecidable meaning that no computer algorithm can solve them exactly in reasonable time and memory space. This course introduces the latest techniques in abstract interpretation, a powerful framework for automatically calculating approximate solutions of such difficult problems. The main emphasis will be on software verification and automatic analysis with a wide range of applications from compilers to social networks.

Prerequisites: Some facility with logic, sets, linear algebra, graphs, formal languages, mathematical proofs, and programming languages is expected.
CSCI-GA.3205-001
(4355) Applied Cryptography & Network Security Mazdak Zamani W 4:55-6:55PM 60 Fifth Ave C10

Course Description:
This course first introduces the fundamental mathematical cryptographic algorithms, focusing on those that are used in current systems. To the extent feasible, the mathematical properties of the cryptographic algorithms are justified, using elementary mathematical tools. Second, actual security mechanisms and protocols, mainly those employed for network traffic that rely on the previously introduced cryptographic algorithms, are presented. The topics covered include introduction to basic number-theoretical properties, public/private and symmetric key systems, secure hash functions, digital signature standards, digital certificates, IP security, e-mail security, Web security, and stand-alone computer privacy and security tools.
CSCI-GA.3812-001
(4386) Information Technology Projects * Evan Korth W 5:00-8:00PM CIWW 312

Course Description:

This is a capstone course that connects students directly with real-world information technology problems. The goal of this course is to teach the skills needed for success in real-world information technology via a combination of classroom lectures and practical experience with large projects that have been specified by local “clients.” The typical clients are primarily companies, but can also be government agencies or nonprofit organizations. Each project lasts for the entire semester and is designed to involve the full software project life cycle. Examples of such projects are development of software to solve a business problem, including specifying requirements, writing and testing prototype code, and writing a final report; and evaluation of commercial software to be purchased to address a business problem, including gathering requirements, designing an architecture to connect the new software with existing systems, and assessing the suitability of available software products.

Prerequisites: For MS in IS students: Successful completion of CSCI-GA 1170 Fundamental Algorithms and two of the following three courses: CSCI-GA 2262 Data Communications & Networks; CSCI-GA 2250 Operating Systems; CSCI-GA 2433 Database Systems. For MS in CS students: Successful completion of CSCI-GA 1170 Fundamental Algorithms, CSCI-GA 2110 Programming Languages, and CSCI-GA 2250 Operating Systems. PERMISSION OF THE DEPARTMENT REQUIRED.
CSCI-GA.3813-001
(4356) Adv Lab MS * STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-002
(4357) Adv Lab MS * STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-003
(4358) Adv Lab MS * STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-004
(4359) Adv Lab MS * STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-005
(4360) Adv Lab PhD ** STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-006
(4361) Adv Lab PhD ** STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-007
(4362) Adv Lab PhD ** STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-008
(4363) Adv Lab PhD ** STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3840-001
(4364) Master's Thesis Research * STAFF -

Course Description:

Prerequisites: Approval of a faculty adviser and the Director of Graduate Studies for the M.S. programs.
CSCI-GA.3850-001
(4365) PhD Seminar: Cryptography ** Yevgeniy Dodis T 11:00-1:50PM CIWW 317

Course Description:
Graduate seminars serve as loosely structured forums for exploring research topics from broad areas of computer science. They are designed to foster dialogue by bringing together faculty and students from a given area and to encourage the exchange of ideas. As such, they bridge the gap between more structured course offerings and informal research meetings. Subject matter varies by section.

Prerequisites: Permission of the instructor.
CSCI-GA.3850-002
(4366) PhD Seminar: Theory Anupam Gupta R 11:00-1:50PM CIWW 317

Course Description:
Graduate seminars serve as loosely structured forums for exploring research topics from broad areas of computer science. They are designed to foster dialogue by bringing together faculty and students from a given area and to encourage the exchange of ideas. As such, they bridge the gap between more structured course offerings and informal research meetings. Subject matter varies by section.

Prerequisites: Permission of the instructor.
CSCI-GA.3850-004
(4367) PhD Seminar: Formal Methods Sam Westrick W 11:00-12:30PM 60 Fifth Ave 446

Course Description:
Graduate seminars serve as loosely structured forums for exploring research topics from broad areas of computer science. They are designed to foster dialogue by bringing together faculty and students from a given area and to encourage the exchange of ideas. As such, they bridge the gap between more structured course offerings and informal research meetings. Subject matter varies by section.

Prerequisites: Permission of the instructor.
CSCI-GA.3860-001
(4368) PhD Thesis Research ** STAFF -

Course Description:

Prerequisites: Permission of the thesis adviser or director of graduate studies for the Ph.D. program.
CSCI-GA.3870-001
(4369) Internship In Computer Science MS* STAFF -

Course Description:

Participation in a programming project or research project conducted outside of the classroom in a governmental, commercial, or academic setting. Open only to graduate students with permission of the Director of Graduate Studies (DGS). Students must submit a brief written description of their work to the DGS before starting the internship and submit a written summary of their work when it is completed. MS students may take this course a maximum of two times. PhD students who wish to take this course more than four times need to request a special permission and provide adequate academic justification.

Section 1 is for Master's students. Section 2 is for Ph.D. students.

Prerequisites: Permission of Director of Graduate Studies.
CSCI-GA.3870-002
(4370) Internship in Computer Science PhD* STAFF -

Course Description:

Participation in a programming project or research project conducted outside of the classroom in a governmental, commercial, or academic setting. Open only to graduate students with permission of the Director of Graduate Studies (DGS). Students must submit a brief written description of their work to the DGS before starting the internship and submit a written summary of their work when it is completed. MS students may take this course a maximum of two times. PhD students who wish to take this course more than four times need to request a special permission and provide adequate academic justification.

Section 1 is for Master's students. Section 2 is for Ph.D. students.

Prerequisites: Permission of Director of Graduate Studies.

*

Indicates controlled enrollment (permission number required for registration). Contact your program advisor.
**

Indicates controlled enrollment (permission number required for registration). Contact Santiago Pizzini (pizzini@cs.nyu.edu).
***

Indicates controlled enrollment (permission number required for registration). Contact the instructor.

Classroom Locations

Notice: This webpage is subject to change and will be revised and updated as necessary.