Design Project
Resume:
Rahul Shah
Office
Busch Campus
Piscataway NJ 900 Davidson rd
Nichols Apt #61
Piscataway NJ 08854
Phone: 732-***-**** Phone: 732-***-****
********@****.*******.***
URL: http://paul.rutgers.edu/~sharahul Objective To obtain
a research position in field of design,analysis and implementation of
algorithms and applications.
Research Interests Design
and Analysis of Algoriths, Data Structures,
Algorithms on Metric Spaces, Combinatorics and Graph Theory.
Applications of algorithms to various fields. Implementation of Algorithms
Education9/97
- 05/02Doctor of Philosophy, Rutgers
University, NJ.9/97
- 12/98Awarded Master of Science,, Rutgers
University,NJ.
( G.P.A. : 4.0 / 4.0)7/93
- 4/97Awarded Bachelor of Technology,
CS&E, Indian
Institute of Technology (IIT), Bombay, India .
(Rank 4/36)Publications
"On
the Midpath Tree Conjecture: A Counter-Example",
with Martin Farach-Colton, in ACM-Symposium on Discrete Algorithms
(SODA)
2001."On
the Complexity of Ordinal Clustering", with Martin Farach-Colton, In
Preparation."Efficient
Dissemination of Personalized Information Using Content-Based
Multicast", with R. Jain et al. To appear at IEEE-Infocom 2002.
"Algorithms for Efficient Filtering in Content-Based Multicast",
with S. Langerman and S. Lodha, In proceedings of ESA 2001.
(Winner of Best Student Paper Award) "Undiscretized
Dynamic Programming: Faster Algorithms for Facility Location and Related
Problems on Trees", with M. Farach-Colton. In ACM-SODA 2002. Research Experience
Spring '99 -date (Doctoral Thesis)Advisor : Dr. Martin Farach-Colton
Topic : Undiscretized
Dynamic
Programming and Ordinal Embeddings
Worked on Problems in Facility
location on trees, covering problems on trees, multicast filtering,
phylogeny construction and heirarchical ordinal clustering.
Developed a method which speeds up dynamic programming algorithms,
particularly on trees.7/96
- 4/97 (Senior Thesis)Advisor : Dr. A. A. Diwan, CS&E,
IIT Bombay.
Topic : Enumerating
Independent
Sets in Trees and Chordal Graphs.
Worked on lots of combinatorial enumeration
problems. In particular 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.Spring
'96 (Junior Thesis)Advisors : Dr. Ketan Mulmuley, Univ.
of Chicago and Dr. Sundar Vishwanathan, IIT Bombay.
Topic : Rapidly
Mixing Markov
Chains
Studied mathematical properties of Markov
Chains and their application in approximating permanent of 0/1 matrix and
volume of convex body.EmploymentSummer
'00Summer intern at Telcordia Technologies.
Worked on optimal and heuristic algorithms for placing mobile filters in
the content-based multicast tree. Designed a series of faster
algorithms for optimally placing filters in the multicast tree.
Summer
'98Summer intern at BellCore. Worked
on approximation/heuristic algorithms for survivable network design.Implementation
of some of these was done in C. In particular, worked on Ring loading Problem
and Shortest pair of disjoint paths problem.Fall
'97-dateTeaching assistant for various courses like
Design and Analysis of Data Structuresand Algorithms (I & II),Discrete Structures,Network
and Combinatorial Optimization,Theory of Computation,Operating Systems.Summer
'96Student intern at Tata Unisys Ltd.
Worked on a part of Video-on-Demand Project on platform MS-WINDOWS. The
programming was done in Microsoft Visual C++.Academic Honors Winner of Best Student Paper Award at
European Symposium on Algorithms (ESA) 2001.Institute Academic Award Winner,IIT Bombay,in academic years 93-94 and 94-95 for excellent academic performance.Secured All India 9th Rank at IIT
Joint Entrance Examination, 1993, amongst approximately 1,00,000 students
all over the country, who took the exam.Awarded the National Talent Search (NTS)
scholarship, instituted by the National Council for Educational Research
and Training (NCERT),New Delhi, India. (1991). Each year about 750 awards
are made,countrywide.Programming SkillsExtensive Programming Experience in languages
like C,Java,SML, Pascal, FORTRAN, COBOL, LISP, PROLOG, ADA, C++, SQL,
VHDL, Matlab,
Assembly Languages (8085, 8086, SPARC), MSVC++ on Solaris, MSWINDOWS and
MSDOS platforms.Programming ProjectsInformation Retrieval Implemented a Mini Web Search
Engine for pages at www.cs.rutgers.edu using TFIDF and similarity
based locality heuristic for ranking the documents. The implementation
was done using C/perl/cgi.Data Structures and Algorithms Efficient algorithm for
shortest pair of disjoint paths problem for survivable network design. Comparision of Branch
and Bound (exact) algorithm and optimal (approx) algorithm for Travelling
Salesman Problem in Pascal.Operating Systems Theory Implementation of Web
Proxy Server with caching and blocking in C. Study and Documentation
of Linux kernel code for Buffer Cache.Pattern Recognition Extraction of Blood vessels
from Retinal Images. The program for automatic extraction of the
vascular tree from retinal fluorescein angiograms was written in Matlab. Compilers Constructed a compiler
for subset of Pascal using C,Lex and YACC. DCG parser generator in
PROLOG.Database Systems Implemented one part of
mini database system developed at IIT Bombay. It involved the
implementation
of hybrid hash join algorithm. Developed a query interface for
project management system at IIT Bombay (in SQL).
Relevant Course Work (Theory)
D&A of DS and algos I & II Linear Programming
Applied Graph Theory Approximation Algorithms
Theory of Computation Operations Research
Geometric Algorithms Combinatorics I & II Relevant Course Work (systems)
Operating Systems Computer Architecture
Programming Languages and Complilers Database Systems
Artificial Intelligence Computer Graphics
Information Retrieval Pattern Recognition ReferencesName
Phone
Prof. Martin Farach-Colton ******@******.*** 650-318-0200x1156
Prof. Michael Fredman *******@**.*******.*** 732-***-****
Prof. Vasek Chvatal *******@**.*******.*** 732-***-****
Contact this candidate