Home Page

Associate Professor
Computer Science Department
Carnegie Mellon University

Office: GHC 9101
Executive assistant:  Ben Cookbcook@cs.cmu.edu(412) 268-5310GHC 9229

I research theory and practice of programming, including the design, analysis, and implementation of programming languages and algorithms. I am also interested in applications of computer science to education and lead the development of Diderot platform. I received my degrees from Bilkent University (B.S, 1997), UT Austin (MA, 1999), and Carnegie Mellon (PhD, 2005).



Recent Awards

  • 2021: Distinguished paper award (POPL 2021)
  • 2020: ACM SIGPLAN Research Highlight (PPOPP 2019)
  • 2019: CMU Teaching Innovation Award (Diderot Project)



  • Yue Yao, M.S. 2020 (Now: PhD at CMU)
  • Yifan Qiao, Undergraduate 2019 (Now: PhD at UCLA)
  • Rohan Yadav B.S. 2019 (Now: PhD at Stanford)
  • Vijay Ramamurthy B.S. 2019 (Now: Facebook)
  • Stefan Muller Ph.D. 2018 (Now: Professor at IIT Chicago)
  • Adrien Guatto  Post-doc 2016-17 (Now: Professor at IRIF-CNRS, Paris)
  • Ram Raghunathan M.A. 2017 (Now: Twitch)
  • Yan Chen Ph.D. 2017 (Now: Google --> Dfinity)
  • Filip Sieczkowski Post-doc: 2014-16 (Now: Professor at University of Wroclaw)
  • Pramod Bhatotia Ph.D. 2015 (Now: Professor at University of Edinburg)
  • Arthur Chargueraud Post-doc 2010-12 (Now: Researcher at INRIA)
  • Jana Dunfield Post-doc 2010-12 (Now: Queen’s University, Ontario)
  • Matthew Hammer Ph.D. 2012 (Now: Professor at UCB --> Dfinity)
  • Mike Rainey Post-doc 2010-12 (Now: Researcher at Inria --> Researcher at CMU)
  • Ozgur Sumer Ph.D. 2012.  (Now: Google)
  • Duru Turkoglu Ph.D. 2012. (Now: Loyala University)
  • Ruy Ley-Wild Ph.D. 2010.  (Now: LogicBlox)
  • Jamie Morgenstern B.S. 2009. (Now: PhD at CMU --> Professor at Georgia Tech --> Professor at University of Washington)


Diderot is a learning and engagement platform that re-imagines online learning by bringing together traditional learning materials (e.g., textbooks, quizzes, homeworks, etc) around a core of communication and interaction services.  Diderot is rapidly evolving and has been used by thousands of students at Carnegie Mellon.  

Funding and Acknowledgments 

Diderot is generously supported by SCS Innovation Fund, National Science Foundation, Amazon Web Services, Google Cloud.

    15897: Parallelism and Concurrency (Fall 2019, 2020)

    Class times: Mon-Wed 10:30-11:50
    Place: Gates 4303
    Diderot: Please see Diderot for the course schedule and course materials.

    This course covers topics in parallelism and concurrency.  Specific topics include the following.
    • Models of parallelism.
    • Parallel algorithms for sequences
    • Parallel algorithms for trees
    • Parallel algorithms for graphs
    • Algorithms for thread scheduling, e.g., greedy scheduling, online scheduling, and work stealing

    The lectures will aim at bridging Church's and Turing's different formulations of computation and attempt at developing a "unified theory" of the fundamental concepts in computing, parallelism, and concurrency.  The students will also do a project.  The project could be individual or team work and on a topic that will be agreed upon by the instructor or the student(s).