Computer Science

Academic Year:

2017-18

Address:

Computer Science Building, 35 Olden Street

Phone:

609-258-5387

Website:

Department of Computer Science

Program offerings:

Ph.D.

M.S.E.

Director of Graduate Studies

Michael Freedman

Graduate Program Administrator

Nicol Gotsis

Academic department detail

Overview

The Department of Computer Science accepts both beginning and advanced graduate students for study and research leading to the degree of Master of Science in Engineering (M.S.E.) and Doctor of Philosophy (Ph.D.). These degree programs are sufficiently flexible to adapt to individual plans of study and research.

Applying

Application Deadline:

December 15 - 11:59PM Eastern Standard Time

Program Length:

Ph.D. 5 years, M.S.E. 2 years

Application Fee:

$90

Application Requirements:

Statement of Academic Purpose

Resume/Curriculum Vitae

Recommendation Letters

Transcripts

Fall Semester Grades

Graduate Record Examinations (GRE)

English Language Tests

Statement of Financial Resources

Statement of Financial Resources:

for M.S.E. applicants only

GRE :

General test

Additional Departmental Requirements:

Applicants are required to select a subplan when applying.

Ph.D.

Ph.D. Requirements:

Program Description:

The doctoral program in computer science combines course work and participation in original research. Most students enter the program with an undergraduate degree in computer science, mathematics, or a related discipline. Some entering students may have a master’s degree, but that is not necessary for success in the program. Every admitted Ph.D. student is given financial support in the form of a first-year fellowship. In addition, all admitted Ph.D. students are automatically considered for the prestigious Wu and Upton Fellowships.

Courses:

In preparation for the general examination, the doctoral candidate, in consultation with a faculty adviser, develops an integrated program of study in one of the departmental areas of research. Such preparation usually requires two academic years for students entering with a bachelor’s degree, and one year for students entering with a master’s.

All students must fulfill the programming competency and breadth requirements by the end of the second year, demonstrating minimum competence in four main areas of computer science: computer systems, software systems, intelligent computing, and theory.

Programming Competency

This requirement can be satisfied in either of two ways - through successful completion of a project that involves substantial programming (done under faculty supervision) or by taking a course and receiving a satisfactory grade (normally B+ or higher). Acceptable courses are COS 318, 320, 425, 426, 429, 461, 526, 561, or any approved graduate course. Taking only the course exam does not give programming credit. This requirement must be completed by the end of the fourth year.

Breadth

A total of 6 courses will be required. The first three constitute the core breadth requirement. Students must take one course from each group -- AI, Systems, and Theory -- from the courses listed below. The remaining three courses can be any 400- or 500-level course from any department in the University. Courses taken outside the Department of Computer Science require approval from the student’s academic advisor and the Director of Graduate Studies.

All courses must be taken for a grade. A grade of A- or higher will normally be expected. However, all grades will be reviewed by the faculty and a lower grade may be acceptable based on review of the student’s total record.

Individual research areas may set additional requirements for their students; they may specify certain courses to be taken or may require that courses in excess of the departmental requirement be taken.

Students are expected to complete the breadth requirement by the end of the second year. In special circumstances, a student's adviser may request an additional year, provided that four of the six courses have been completed.

Individual research areas may set additional course requirements for their students; they may specify certain courses to be taken or may require that courses in excess of the departmental requirement be taken.

Core Course List

Artificial Intelligence

402 Artificial Intelligence
424 Interacting with Data
511 Theoretical Machine Learning
513 Foundations of Probabilistic Modeling

Systems

475 Computer Architecture (See ELE 475)
518 Advanced Computer Systems
561 Advanced Computer Networks

Theory

510 Programming Languages
516 Automated Reasoning About Software
521 Advanced Algorithm Design
522 Computational Complexity

General Exam:

The general examination consists of a research seminar prepared under the supervision of a faculty member, followed by an in-depth oral examination on the contents of the seminar and the associated general area of research. The oral examination tests the student's knowledge in a number of topics relevant to the student's research area. These topics are specified beforehand by an examining committee in consultation with the student. The seminar is open to the public, and at least three computer science faculty members must attend. Two are invited by the student; the other is selected by the director of graduate studies. The examining committee and the student agree upon a reading list for the exam. This document is to be made available to anyone present in the oral examination, and only questions pertaining to either the material described in the document or presented during the research seminar can be asked during the oral. Original research results do not have to be presented, but problems whose solution may lead to a thesis should be discussed. In many cases, the student’s thesis is in the same area as the research seminar, but this is not required.

Qualifying for the M.A.:

The Master of Arts (M.A.) degree is normally an incidental degree on the way to full Ph.D. candidacy and is earned after a student successfully completes the programming competency and the three basic area competencies, and presents an acceptable research seminar. It may also be awarded to students who, for various reasons, leave the Ph.D. program, provided that the requirements have been met.

Please note, students admitted to the Ph.D. program who do not wish to complete the program may be considered for an M.S.E. degree with approval from the department and the Graduate School. Ph.D. students who have already been awarded the incidental M.A. are not eligible to earn an M.S.E.

Teaching:

Teaching experience is considered to be a significant part of graduate education. All Ph.D. candidates are therefore required to assist with course instruction for the equivalent of two terms.

Post-Generals Requirement(s):

Preliminary Public Defense

In preparation for the final public oral examination, the candidate participates in a preliminary public oral examination to be held at least six months prior to the expected completion date. It covers results to-date and planned research, and serves as a preliminary critique of the proposed dissertation. It is attended by the adviser, two dissertation readers, and two faculty members who serve on the final public oral examination committee, and it is open to the public.

Dissertation and FPO:

The Ph.D. is awarded after the acceptance of the dissertation and completion of the final public oral.

M.S.E.

M.S.E. Requirements:

Program Description:

The master's degree program at Princeton is a two-year, full-time program. All admitted students will initially be enrolled in the Master of Science in Engineering (M.S.E.), thesis-required track. In the spring of year 1, as part of readmission, all students will be given the option to switch to the Master of Engineering (M.Eng.), non-thesis track. Students opting to remain on the M.S.E. track must have a confirmed research adviser and should also have a preliminary thesis proposal. Switching tracks will be permitted through January of year 2.

Teaching experience is considered to be a significant part of graduate education. Funding is normally in the form of teaching assistantships covering the four semesters of the program. Nonnative English speakers must have a TOEFL speak score of 28 or better to be considered for a teaching assistantship. Applicants who do not meet this requirement may opt to apply as self-funded students. Summer funding for M.S.E. candidates in the form of a research assistantship may be offered at the adviser's discretion.

Students wishing to continue on for a Ph.D. must apply through the normal application process during the fall of their second year of study.

Princeton undergraduate students who wish to apply to the master's program must do so through the regular admission process, and by the December 15 deadline. Admission is competitive. Princeton undergraduates will need to submit (1) a one-page personal statement describing preparation to date and interest interested in the master's program; and (2) an unofficial copy of your transcript. In addition, Princeton undergraduates must have two letters of recommendation from COS professors emailed directly to the graduate coordinator. Once these materials have been received, the director of graduate studies will perform an informal review and provide feedback about whether admission into the master's program is "likely," "unlikely," or "possible." This feedback is not binding -- it is meant only to help planning for senior year.

Courses:

Candidates choose a subarea of computer science on which to focus their coursework and write a thesis under the direction of an adviser. Course requirements are fulfilled by taking six courses for a grade, at least three of which must be 500-level courses. A minimum of 4 courses must be taken in year 1. If, due to scheduling conflicts, this is not possible, approval by the director of graduate studies is required and the student must fulfill all course requirements by the end of the specified 2 year program length. The other eligible courses are 318, 320, 326, 375, or any 400-level course. Relevant courses from outside the department may be taken with adviser's consent.

All coursework must be taken for a grade. Candidates must maintain a B average, with no more than one C allowed. In order to be readmitted for a second year, candidates must have a confirmed thesis adviser and preliminary thesis proposal by the end of the first year.

Please note: Candidates electing to switch to the M.Eng degree track must complete a total of eight courses over two years, and are not required to submit a thesis. Three of the eight must be 500-level, and the additional courses may be chosen from 318, 320, 326, 375, or any 400-level course. Relevant courses from outside the department may be taken with adviser's consent. All courses must be taken for a grade. Candidates must maintain a B average, with no more than one C allowed.

Princeton Option

For Princeton undergraduates interested in continuing at Princeton for a master's degree: A degree track has been established that allows current Princeton students pursuing a master’s degree with the computer science department to use credits from two courses taken as undergraduates that were taken beyond the requirements of the computer science department for the bachelor's degree. Those two must be upper-level COS courses that fulfill requirements of the master’s degree. Transferrable courses must be upper-level COS courses taken in excess of undergraduate degree requirements.

Teaching:

Master’s program is fully funded by teaching assistantships. Masters students are required a teaching assistantship each semester that they are enrolled.

Thesis:

Candidates must prepare and submit an original thesis as well as present a public seminar on the research. The thesis will be reviewed and graded by the student’s adviser plus one additional reader from the Princeton faculty. If the reader is from outside the Department of Computer Science, approval by the director of graduate studies is required. The public seminar is an ungraded 20-minute talk, followed by a 10-minute question session, given in the spring of year 2. This will allow the student’s adviser and reader to give preliminary feedback prior to submission of the final thesis.

The written thesis should be a research paper of "scholarly quality" -- making a novel contribution to scholarship in the field. The thesis should motivate the chosen research problem, evaluate the proposed solution (e.g., via analysis, measurement, simulation, or prototype implementation), and compare the approach to the related work in the field. While there is no specific length requirement, a reasonable target is a typical conference paper (e.g., 10-15 pages in two-column format or 20-40 pages in single-column, double-spaced format). Due date will be Dean's Date in the spring term of year 2. After being graded, four copies of the final version must be submitted to the department: two bound copies, following the formatting guidelines from Mudd Library, one unbound hard-copy, and the fourth as a .pdf file.

Faculty

Chair

Jennifer L. Rexford

Associate Chair

Szymon M. Rusinkiewicz

Director of Graduate Studies

Michael Freedman

Professor

Ryan P. Adams
Andrew W. Appel
Sanjeev Arora
David August
Mark Braverman
Bernard Chazelle
David P. Dobkin
Nick Feamster
Edward W. Felten, also Woodrow Wilson School
Adam Finkelstein
Michael J. Freedman
Thomas A. Funkhouser
Aarti Gupta
Elad E. Hazan
Brian W. Kernighan
Andrea S. LaPaugh
Kai Li
Margaret R. Martonosi
Benjamin J. Raphael
Ran Raz
Jennifer L. Rexford
Szymon M. Rusinkiewicz
Robert Sedgewick
Hyunjune Sebastian Seung, also Princeton Neuroscience Institute
Yoram Singer
Jaswinder Pal Singh
Mona Singh, also Lewis-Sigler Institute for Integrative Genomics
Robert E. Tarjan
Olga G. Troyanskaya, also Lewis-Sigler Institute for Integrative Genomics
David P. Walker

Associate Professor

Kyle Jamieson
Zeev Dvir, also Mathematics
Assistant Professor
Barbara E. Engelhardt
Zachary Kincaid
Gillat Kol
Wyatt Lloyd
Jonathan Mayer, also Woodrow Wilson School
Arvind Narayanan
Olga Russakovsky
Matthew Weinberg
Mark L. Zhandry

Senior Lecturer

Kevin Wayne

Lecturer

Ibrahim Albluwi
Robert M. Dondero Jr.
Robert Fish
Donna Gabai
Maia Ginsburg
Ananda Gunawardena
Alan Kaplan
Xiaoyan Li
Daniel Leyzberg
Jeremie Lumbroso
Christopher Moretti
Iasonas Petras

Associated Faculty

Amir Ali Ahmadi, Operations Research and Financial Engineering
Yuxin Chen, Electrical Engineering
Jainqing Fan, Operations Research and Financial Engineering
Ruby B. Lee, Electrical Engineering
Samory Kpotufe, Operations Research and Financial Engineering
Prateek Mittal, Electrical Engineering
Warren Powell, Operations Research and Financial Engineering
Paul D. Seymour, Mathematics
John Storey, Lewis-Sigler Institute for Integrative Genomics
Daniel L. Trueman, Music
Robert J. Vanderbei, Operations Research and Financial Engineering
David Wentzlaff, Electrical Engineering

Courses

Permanent Courses

Courses listed below are graduate-level courses that have been approved by the program’s faculty as well as the Curriculum Subcommittee of the Faculty Committee on the Graduate School as permanent course offerings. Permanent courses may be offered by the department or program on an ongoing basis, depending on curricular needs, scheduling requirements, and student interest. Not listed below are undergraduate courses and one-time-only graduate courses, which may be found for a specific term through the Registrar’s website. Also not listed are graduate-level independent reading and research courses, which may be approved by the Graduate School for individual students.

COS 510 Programming Languages Fundamental concepts underlying all programming languages; semantic aspects, including binding times, visibility, retention, storage management, abstraction mechanisms and extensibility; operational and denotational semantic specifications; and design and implementation issues, particularly for very high-level languages, including data representations, control regimes, code representations, and portability. Prerequisites: 226 and 320.

COS 511 Theoretical Machine Learning Course introduces the mathematical foundations of machine learning, including theoretical models of machine learning, and the design and analysis of learning algorithms. Topics include: bounds on the number of random examples needed to learn; learning from non-random examples in the on-line learning model (i.e., for investment portfolio selection); how to boost the accuracy of a weak learning algorithm; learning with queries; Fourier-based algorithms and support-vector machines.

COS 516 Automated Reasoning about Software (also

ELE 516

) An introduction to algorithmic techniques for reasoning about software. Basic concepts in logic-based techniques including model checking, invariant generation, symbolic execution, and syntax-guided synthesis; automatic decision procedures in modern solvers for Boolean Satisfiability (SAT) and Satisfiability Modulo Theory (SMT); and their applications in automated verification, analysis, and synthesis of software. Emphasis on algorithms and automatic tools.

COS 518 Advanced Computer Systems Survey of operating systems covering: early systems, virtual memory, protection, synchronization, process management, scheduling, input/output, file systems, virtual machines, performance analysis, software engineering, user interfaces, distributed systems, networks, current operating systems, case studies. Survey of research papers from classic literature through contemporary research. Prerequisite: COS 318 or equivalent.

COS 521 Advanced Algorithm Design Advanced methods of algorithmic design and analysis: data structures, network flows, and linear programming. Solution of linear programs: Karmarkar and Ellipsoid algorithms. Probabilistic techniques. A selection of topics from on-line computation, approximation algorithms for NP-hard problems, number theoretic algorithms, geometric algorithms, and parallel computation.

COS 522 Computational Complexity (also

MAT 578

) Introduction to research in computational complexity theory. Computational models: nondeterministic, alternating, and probabilistic machines. Boolean circuits. Complexity classes associated with these models: NP, Polynomial hierarchy, BPP, P/poly, etc. Complete problems. Interactive proof systems and probabilistically checkable proofs: IP=PSPACE and NP=PCP (log n, 1). Definitions of randomness. Pseudorandomness and derandomizations. Lower bounds for concrete models such as algebraic decision trees, bounded-depth circuits, and monotone circuits.

COS 526 Advanced Computer Graphics Advanced topics in computer graphics, with focus on learning recent methods in rendering, modeling, and animation. Appropriate for students who have taken COS426 (or equivalent) and who would like further exposure to computer graphics.

COS 528 Data Structures and Graph Algorithms Data structures and algorithms for graph and network problems, including disjoint set union, heaps, search trees, search on graphs, minimum spanning trees, shortest paths, network flows, and matchings. The intent of the course is to examine the most efficient algorithms known for a variety of combinatorial problems and to discover the principles underlying the design and analysis of these algorithms. The emphasis is on asymptotic worst-case and amortized analysis. Prerequisite: 423 or the equivalent.

COS 532 Computer Graphics: Modeling Advanced topics in geometric modeling. Topics to be covered include methods for describing geometric primitives such as implicit surfaces and parametric patches, solid modeling and constructive solid geometry, boundary representations and topological representations, procedural models, and models appropriate for natural and biological shapes. Prerequisite: 426 or the equivalent.

COS 533 Advanced Cryptography This course covers a selection of advanced topics in cryptography, including some or all of the following: fully homomorphic encryption, zero knowledge proofs, traitor tracing, identity-based encryption, private information retrieval, garbled circuits, secret sharing, multiparty computation, lattice-based cryptography, and elliptic curve-based cryptography.

COS 534 Fairness in Machine Learning The course covers: sources of bias in machine learning; methods for detecting, measuring, and mitigating bias; individual fairness, group fairness, and the tension between them; data modeling versus algorithmic modeling;connections between fairness and privacy; bias in algorithmic decision making; bias in unsupervised machine learning; interpretability in ML and its connection to fairness. The syllabus is predominantly technical, supplemented by a few readings from social science, law, and public policy. Students take on hands-on empirical projects of their choosing.

COS 551 Introduction to Genomics and Computational Molecular Biology (also

MOL 551

QCB 551

) Introduction to basic computational and genomic methods for analysis of biological systems. Topics include: sequence similarity and alignment, phylogenic inference, gene recognition, gene expression analysis, transcriptional networks, structure prediction, functional genomics and proteomics. This is primarily a graduate-level course; interested undergraduates will require permission from instructors.

COS 557 Analysis & Visualization of Large-Scale Genomic Data Sets (also

MOL 557

) Introduces students to computational issues involved in analysis and display of large-scale biological data sets. Algorithms covered will include clustering and machine learning techniques for gene expression and proteomics data analysis, biological networks, joint learning from multiple data sources, and visualization issues for large-scale biological data sets. No prior knowledge of biology or bioinformatics is required; an introduction to bioinformatics and the nature of biological data will be provided. In depth knowledge of computer science is not required, but students should have some understanding of programming and computation.

COS 561 Advanced Computer Networks Survey of computer networks covering end-to-end principle, multiplexing, virtualization, packet switching vs. circuit switching, router design, network protocols, congestion control, internet routing architecture, network measurement, network management, and overlay networks. Survey of research papers from classic literature through contemporary research.

COS 583 Great Moments in Computing (also

ELE 583

) Course covers pivotal developments in computing, including hardware, software, and theory. Material will be covered by reading seminal papers, patents, and descriptions of highly-influential architectures. Course emphasizes a deep understanding of the discoveries and inventions that brought computer systems to where they are today, and class is discussion-oriented. Final project or paper required. Graduate students and advanced undergraduates from ELE, COS, and related fields welcome.

COS 589 Extramural Summer Research Project Summer research project designed in conjunction with the student's advisor and an industrial, NGO, or government sponsor that will provide practical experience relevant to the student's research area. Start date no earlier than June 1. A final paper is required.

COS 590 Extramural Research Internship One-term full time research internship at a host institution to perform scholarly research directly relevant to a student's dissertation work. Research objectives will be determined by the student's advisor in consultation with the outside host. Monthly progress reports and a final paper are required. Enrollment is limited to post-generals students. Students will be permitted to enroll in this one-semester course at most twice. Participation will be considered exceptional.

COS 597 Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 597A Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 597B Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 597C Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 597D Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 597E Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 597F Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 597G Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 598 Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 598A Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 598B Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 598C Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 598D Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 598E Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 598F Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

COS 598G Advanced Topics in Computer Science Topics involving current research in computer science and applications in other fields.

ELE 579 Pervasive Information Systems (also

COS 579

) Devices and systems that provide information anywhere, anytime. Goals of pervasive information: business, entertainment, government, etc. Components of pervasive information systems: low power electronics, audio/video, networking, etc. Human/computer interaction. Geographically distributed systems.

ELE 580U Advanced Topics in Computer Engineering (also

COS 598U

) Selected research topics in computer engineering. Emphasis is on new results and emerging areas. (More detailed outlines are contained in the booklet Course Outlines, issued by the department each year.)

WWS 586F Topics in STEP (also

COS 586

) Currently unavailable