I am a computer science PhD student at Carnegie Mellon University. My
advisor is Avrim Blum. I am
generally interested in theory, specifically approximation algorithms
and game theory. I spent the summer of 2012 at Alcatel-Lucent
Labs. For the summer of 2013, I worked
Devanur at Microsoft Research Redmond.
I am supported by an NSF GFRP fellowship, as well as the Microsoft
Research Graduate Women's Scholarship.
Nikhil Devanur, Jamie Morgenstern,
Hierarchical Community Decomposition Via Oblivious Routing Techniques
(Conference on Social Networks (COSN) '13)
William Sean Kennedy, Jamie Morgenstern,
Gordon Wilfong, Lisa Zhang.
How Bad is Selfish Voting?
Simina Branzei, Ioannis Carragianis, Jamie Morgenstern,
and Ariel D. Procaccia.
On Maxsum Fair Cake Divisions.
Steven J. Brams, Michal Feldman, Jamie Morgenstern, John K. Lai, and Ariel D. Procaccia.
An Algorithm with Additive Error for Near-Perfect Phylogeny Construction.
Pranjal Awasthi, Avrim Blum, Jamie Morgenstern, Or
A Proof-Carrying Filesystem with Revocable and Use-Once Certificates.
Jamie Morgenstern, Deepak Garg and Frank
within Dependently-Typed Programming.(ICFP'10)
Jamie Morgenstern, Daniel
I was the instructor for 15122,
Principles of Imperative Programming, for summer 2012.
I also like to run. Here are a few
recent race results.