Members

Faculty

  • Elliot Anshelevich : Design and analysis of algorithms, especially for large decentralized networks. Strategic agents in networks and algorithmic game theory; approximation algorithms.

  • Petros Drineas : Design and analysis of algorithms; randomized and approximate algorithms; data mining.

  • W. Randolph Franklin : Computational Geometry.

  • Mark Goldberg : Experimental design and analysis of algorithms; machine learning, bioinformatics; combinatorics.

  • S. Mukkai Krishnamoorthy : Design and analysis of algorithms; programming environments; internet performance and visualization; compiler design.

  • Malik Magdon-Ismail : Theory, algorithms and applications of computational learning systems; Computational Finance; Bioinformatics.

  • Robert McNaughton : Automata theory; Formal languages; Combinatorics of words.

  • Dave Musser : Mechanized logic and proof methodology, applied to correctness and optimization of abstract algorithms.

  • Lee Newberg : Bioinformatics, statistical algorithms

  • Lirong Xia : Economics and computation, artificial intelligence, multiagent systems, machine learning, game theory, mechanism design, social choice, algorithm design.

  • Bulent Yener : Design and analysis of network protocols and algorithms, combinatorial optimization, approximation algorithms.

Graduate Students

  • John Postl

  • Onkar Bhardwaj

  • Shreyas Sekar

  • Saurabh Paul

  • Srinivas Nambirajan

  • Maksim Tsikhanovich

  • James Thompson

  • Abhisek Kundu

  • Lingxun Hu

  • Lily Briggs

Student Alumni

  • Bugra Caskurlu

  • Christos Boutsidis

  • Hilmi Yildirim

  • Cagatay Bilgin

  • Konstantin Mertsalov

  • Ameya Hate

  • Abhirami Baskaran

  • Daniel Yuan

  • Lauren Bange