Jamie Morgenstern
Ph.D. Student in Computer Science Computer Science Department
School of Computer Science
Carnegie Mellon University
Office: 9221 Gates Hillman Center
Email: 'jamiemmt' at 'cs' dot 'cmu' dot 'edu'

I am a second-year computer science PhD student at Carnegie Mellon University. My advisers are Avrim Blum and Frank Pfenning. I am generally interesting in theory, specifically logic, approximation algorithms, and game theory.

Funding

I am supported by an NSF GFRP fellowship, as well as the Microsoft Research Graduate Women's Scholarship.

Teaching

I am the instructor for 15122, Principles of Imperative Programming, for summer 2012.

Curriculum Vitae

Publications

  • How Good Are Optimal Cake Divisions? (AAAI'12)
    • Steven J. Brams, Michal Feldman, Jamie Morgenstern, John K. Lai, and Ariel D. Procaccia.
  • An Algorithm with Additive Error for Near-Perfect Phylogeny Construction. (Submitted)
    • Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or Sheffet.
  • A Proof-Carrying Filesystem with Revocable and Use-Once Certificates. Security and Trust Management 2011 (STM'11)
    • Jamie Morgenstern, Deepak Garg and Frank Pfenning. code
  • Security-Typed Programming within Dependently-Typed Programming. International Conference on Functional Programming(ICFP'10)
    • Jamie Morgenstern, Daniel Licata. code

    Theses


    Misc.

    I also like to run. Here are a few recent race results.