Find courses

I have always wanted to obtain a research position in the field of design, analysis and implementation of algorithms and applications. My field of research includes Design and Analysis of Algoriths, Data Structures, Algorithms on Metric Spaces, Combinatorics and Graph Theory. Applications of algorithms to various fields. Implementation of Algorithms. This prompted me to enroll for a Doctor of Philosophy program in the Computer Science Department at the Rutgers University. I completed it in 2002.

I enrolled for my PhD program after completing my master in the CS dept at the same university. I got the admission fairly easily.

I was awarded the teaching assistantship by the university.

My thesis was called Undiscretized Dynamic Programming and Ordinal Embeddings. I was guided in my work by Dr. Martin Farach-Colton. I worked on lots of combinatorial enumeration problems. In particular I solved the 'Gray code' enumeration problems for maximum independent sets in trees, fixed size independent sets in proper interval graphs and fixed sized independent sets in well covered trees.

I interned at various places during the summers. This greatly added to my research experiences. I also worked as a Teaching assistant for various courses like Design and Analysis of Data Structures and Algorithms (I & II), Discrete Structures, Network and Combinatorial Optimization, Theory of Computation, Operating Systems.

Yes