Since the copyrights of papers appeared in conference proceedings or journals usually belong to the publishers, the papers may be downloaded for research purposes only. <p>

<p><a href = "masters_thesis.pdf">On the Space Complexity of Directed Graph Reachability</a><br/>
<i>Master's Thesis, University of Nebraska-Lincoln, May 2007.</i><br/>
(Won the Outstanding Master's Award at the CSE Dept. at UNL.)</p>

<p><a href = "DPRinUL.pdf">Directed Planar Reachability is in Unambiguous Logspace.</a><br/>
(Joint work with Chris Bourke and N. V. Vinodchandran.)<br/> 
<i>In Proceedings of the 22nd Annual IEEE Conference on Computational Complexity, pages 217-221, 2007.<i/><p/>