Research
Summer 2008
Last summer I worked for Prof. Neal Young with fellow grad students Monik Khare and Peter Lonjers . We extended an implementation of a fast pure packing and covering LP solver created by Prof. Neal and Christos Koufogiannakis. The solver uses a coupled, randomized Lagrangian relaxation strategy and is asymptotically faster than the Simplex method. The solver can be downloaded from here , and the paper describing the algorithm (which appeared in FOCS 2007) can be found here .
Master's Project
For my master's project I am examining various data structures for maintaining dynamic distributions of discrete random variates, which is an important component of our fast LP implementation described above. My advisor for this project is Prof. Neal Young.