Title
Assistant Professor of Computer Science (2007)
Degree
BA, Princeton University, 2000; MS, MPhil, PhD, Yale University, 2001, 2003, 2005
Specialties
Algorithms, theoretical computer science, networking, e-commerce, game theory/economics and computation, discrete math
Interests
Algorithmic foundations of the Internet, including: routing protocols, tools/languages for network configuration, security, incentive-compatibility and mechanism design
Selected Publications
• "Towards the Design of Robust Interdomain Routing Protocols," (IEEE Network Magazine, November/December 2005)
• "Incentive-Compatible Interdomain Routing," (Proceedings of ACM Electronic Commerce Conference, June 2006)
• "Robust Path-Vector Routing Despite Inconsistent Preferences," (Proc. IEEE ICNP 2006, Nov. 2006)
• "Relating Two Models of Path-Vector Routing," (Proc. IEEE INFOCOM 2005, March 2005)
• "Robustness of Class-Based Path-Vector Systems," (Proc. IEEE ICNP 2004, Oct. 2004)
• "Design Principles of Policy Languages for Path-Vector Protocols," (Proc. ACM SIGCOMM 2003, Aug. 2003)
• "DNA Self-Assembly for 3D Boxes," (Proc. ISAAC 2001, Dec. 2001)
• "A Space-Efficient Randomized DNA Algorithm for k-SAT," (Proc. DNA6, June 2000)
Professional Experience
Postdoc at DIMACS/Stevens Institute of Technology; Postdoc at International Computer Science Institute (ICSI), Berkeley, CA
Distinctions
Department of Defense NDSEG Fellowship, 2001-2004; CT InfoTech Scholarship (state of Connecticut), 2001