About Me:I am a second year PhD student in the Department of Computer Science and Engineering at UCSD. I completed my Bachelor's in Science at Carnegie Mellon University in 2007 with a major in Discrete Math and Logic and a minor in Computer Science. In 2008 I was awarded a Study Scholarship by the German Academic Exchange Service (DAAD) to conduct research with Benjamin Doerr in the Department of Algorithms and Complexity at the Max-Planck-Institute for Informatics in Saarbrücken, Germany.
Research Interests:My main research interests are graph theory, combinatorics, and algorithms. Most of my recent projects pertain to social networking. I am currently working with my advisors Fan Chung Graham and Ron Graham on addressing heterogeneous packet-switching networks using Hamming distances.
- Journal Papers:
- "Strong Robustness of Randomized Rumor Spreading Protocols", with, Benjamin Doerr and Anna Huber. To appear in Discrete Applied Mathematics.
- "The Stable Roommates Problem with Globally-Ranked Pairs", with David Abraham, David Manlove, and Gregg O'Malley. To appear in Internet Mathematics.
- "Pegging Numbers for Various Tree Graphs". To appear in Ars Combinatoria.
- "Strong Robustness of Randomized Rumor Spreading Protocols", with Benjamin Doerr and Anna Huber. Presented at the 20th International Symposium on Algorithms and Computation (ISAAC 2009).
- "The Stable Roommates Problem with Globally-Ranked Pairs", with David Abraham, David Manlove, and Gregg O'Malley. Presented at the 3rd International Workshop On Internet and Network Economics (WINE 2007).
Computational Discrete Mathematics, co-instructed with
Chien-Chung Huang at the
Max-Planck-Institute for Informatics.