Algorithms, Complexity, and Cryptography
at Northeastern University

Theory of Computation Seminar

You may also be interested in the joint Brandeis-Harvard-MIT-Northeastern mathematics colloquim


Rajmohan Rajaraman
Ravi Sundaram
Jonathan Ullman (starting in Fall 2015)
Emanuele Viola
Daniel Wichs

Visitors and Postdocs

Elad Haramaty (starting in Fall 2014)
Yevgeniy Dodis (Spring and Summer 2013)
Chinmoy Dutta (Jan. 2011-Jan. 2013)

Ph.D. Students


Chin Ho Lee
Hamid Jahanjou
Zahra Jafargholi
Scott Roche
Saber Shokat Fadaee
Tim Smith


Daria Antonova
Abhishek Chaubey
Jiangzhuo Chen
Lujun Jia
Guolong Lin
Xin Liu
Eric Miles (First job: postdoc @ UCLA)
Laura Poplawski
Zhifeng Sun
San Tan

Graduate Courses

Algorithmic Power Tools Fall 2009
Applications of Information Theory to Computer Science Fall 2011
Gems of Theoretical Computer Science Spring 2009
Network Algorithms and Analysis Spring 2012
Randomness in Cryptography Spring 2013

Each year there are also two core graduate courses:

Algorithms Fall 2012
Theory of Computation Spring 2013


Google Chrome extension to automatically use the Northeastern institutional license when accessing research articles.
Created by Hooman Javaheri.