Welcome to NYU's Computer Science Department, part of the world-famous Courant Institute of Mathematical Sciences. Our department has considerably expanded over the past few years, adding many outstanding faculty with diverse research interests. We are proud of our strong research and educational connections to other departments and schools at NYU, including the departments of Mathematics, Chemistry, Physics, and Biology; the Center for Neural Science; the Stern School of Business; the Tisch School of the Arts; the Wagner School of Public Service; and the NYU School of Medicine.

Our undergraduate majors and MS students have numerous interesting and well-paying employment opportunities at major corporations in New York City and vicinity. Our PhD graduates are employed in a broad spectrum of academic and industrial research positions.

  News and Highlights  

Cryptography interview

Yevgeniy Dodis is interviewed on NBC on the use of cryptography for privacy and for security.

4th Place, Greater New York Programming Contest

NYU's top team, with members Jingyu Deng, Jingwen Deng and Yixin Tao, placed 4th at the Greater New York ACM International Collegiate Programming Contest (ICPC) which was held on Sunday, November 8th at Queens College. NYU's second team, with members Lingsong Zeng, Zeleng Zhuang and Ziyi Tang placed 8th. Congratulations to all the team members and to their coaches Bowen Yu and Evan Korth!

ONUG Conference

The fall meeting of the Open Networking User Group (ONUG) was held Nov. 3-5 at the NYU Kimmel Center, and was hosted by Lakshmi Subramanian. This year's meeting was the largest ever; there were 640 participants, including both research scientists and business leaders from pharma, financial services, retail, computing, transportation, media & entertainment, express delivery, healthcare, cloud providers, service providers and many other industry segments.

Jenks Memorial Prize

Victor Shoup has been awarded the 2015 Richard D. Jenks Memorial Prize for Excellence in Software Engineering Applied to Computer Algebra for his work on NTL: A Library for Doing Number Theory. Congratulations!

Silver Professor

Subhash Khot has been named a Silver Professor. Congratulations!

Armstrong Achievement Award

Prof. Ted Rappaport is the recipient of the 2015 IEEE Communications Society Edwin Howard Armstrong Achievement Award, "for broad contribution and outstanding leadership in channel measurement and technology research fundamental to mobile communication." Congratulations!

<<More News>>

Learning and modeling the circuits that operate life: The Bonneau lab aims to learn large biological networks directly from genomics data (genomics =3D very scalable biology experiments). Our recent work, as part of collaborative teams of systems biologists and computational biologists, has recently resulted in genome-wide models that are capable of simulating the functioning of the genome in real time (Bonneau, et. al, 2006, Cell). Dr. Bonneau's lab develops new algorithms that attempt to learn the regulatory networks (their topology and dynamical parameters) that are at the core of biological systems. This work was featured in a 2008 Discover Article, where Dr. Bonneau was selected as one of the top 20 scientists under 40. This work is collaborative work that relies on NYU's local expertise in Machine Learning, Modeling complex systems and their dynamics, and Genomics.

With Ph.D. student Eugene Weinstein and Google researcher Pedro Moreno, Mehryar Mohri is working on audio fingerprinting techniques that enable computers to recognize songs. This work represents songs in terms of "music phonemes", elementary units of music sound that are learned from data, and uses weighted finite-state transducers to construct a compact and efficient index of a large database of songs. The image depicts an example of such a transducer. As a result, songs can be recognized quickly and accurately when only a recording of a short "audio snippet" is available and even when the recording is distorted. The group has created a working system with a database of 15,000 songs. Moreover, it has proven new bounds on the size of the indexing finite automata used that guarantee the compactness of this representation as the number of songs indexed increases and suggests that their techniques scale to much larger song data sets.

Links: Example


December 07, 2015
3:45PM Warren Weaver Hall 1302
(MATH COLLOQUIUM) Coordinate Descent Algorithms
Stephen J. Wright

December 11, 2015
11:30AM Warren Weaver Hall 1302
TBA 12-11

Check the Colloquia for more scheduled talks.

Check the CIMS Weekly Bulletin for more events.

top | contact webmaster@cs.nyu.edu