Personal Details

Academic Background

Academic Honours and Achievements (in reverse chronological order)

Institute Rank 1 in the batch at the end of 1st, 2nd and 3rd years of undergraduate study at IIT, Kharagpur.

My Erdos Number is 3. The path is Paul Erdos -> Boris Aronov -> S.P.Pal -> Myself.

Selected for the Young Engineering Fellowship Programme, 2004 at the Indian Institute of Science, Bangalore to work under Prof. Apoorva D. Patel in Quantum Computing.

Batch of 1970 Alumni Award for being the best student at the end of 2nd year of study at IIT, Kharagpur.

Awarded the prestigious Aditya Birla Scholarship in 2001. This award is given to only 10 students from all IITs each year.

Selected for the Mathematics Nurture Camp conducted by the National Board of Higher Mathematics (NBHM) at IIT Kanpur in the summer of 2002.

Ranked 107 (top 0.1%) in All India IIT Joint Entrance Examination 2001 in which around 150,000 students appeared.

Indian National Mathematics Olympiad (INMO) awardee (only 30 are selected all over India) in 1999 and attended the International Mathematics Olympiad training camp in 1999 (Junior Batch) and 2000 (Senior Batch).

Gold Medallist in the Indian National Physics Olympiad, 2001 and attended the International Physics Olympiad training camp in 2001. Only 35 students from about 24,000 examinees are given the Gold Medal.

Ranked among top 1% of about 24,000 examinees in the National Standard Exam in Physics, 2001 and received a certificate of merit.

Ranked All India 1st in the 1st National Science Olympiad, 1998 and received a Gold Medal.

Ranked 1st in Regional and National Level Kendriya Vidyalaya Mathematics Olympiad.

Placed among the top 3 in the state level Achievement cum Diagnostic Test in Mathematics (ADTM) for four consecutive years (1997,1998,1999,2000).

Research Interests

Theoretical Computer Science and Algorithms

Computational Geometry

Complexity Theory

Randomized and Approximation Algorithms

Quantum Computing

Cryptography

Publications

1. A linear worst-case lower bound on the number of holes inside regions visible due to multiple diffuse reflections. link(ps) (with S.P.Pal, Dilip Sarkar) (Accepted for publication in the Journal of Geometry)

2. Landcover classification in MRF context using Dempster-Shafer fusion for multisensor imagery. link(pdf) (with A.Sarkar, A.Banerjee, N.Banerjee, B.Kartikeyan , M.Chakraborty and K. L.Majumder) (Accepted for publication in IEEE Transactions on Image Processing)

3. Computing sharp and scalable bounds on the distance of an approximate zero from an exact zero of an analytic function. link(ps) (with S.P.Pal, Sudhir K. Singh) (Submitted to Computing, Springer-Verlag)

4. A new and novel approach for finding upper bounds on the distance of an approximate zero from an exact zero of a univariate polynomial.   link(ps) (with P.H.D.Ramakrishna, S.P.Pal, H.Basu) (Accepted for publication in the International Journal of Computer Mathematics)

5. A MRF based segmentation approach to classification using Dempster-Shafer fusion for multisensor imagery. (with A.Sarkar, N.Banerjee, P. Nair, A.Banerjee, B.Kartikeyan and K. L.Majumder) ( To appear in the proceedings of the International Conference on Image Ananlysis and Recognition, Porto, Portugal (ICIAR-2004), LNCS, Springer-Verlag)

6. Fair leader election through randomized voting. link(ps) (with Sandeep Macharla, S.P.Pal, Sudhir K. Singh) (To appear in the proceedings of International Conference on Distributed Computing and Internet Technology, Bhubaneswar, India, (ICDCIT-2004), LNCS, Springer-Verlag )

Research Projects

Visibility Polygons due to Diffuse Reflections (under Prof. S.P.Pal) My undergrad major project work is on the topic of Visibility Polygons for Diffuse Reflections. In this model of reflection we assume that light falling on an edge of a simple polygon gets reflected in all directions. This work includes proving new bounds on the number of diffuse reflections required to flood a simple polygon fully from a point light source. It also includes designing algorithms to compute the minimum diffuse reflection path between two points. We also worked on the problem of bounding the combinatorial complexity of visibility polygons for multiple diffuse reflections. We have obtained new results for lower and upper bounds on the combinatorial complexity of diffuse reflection visibility polygons.

Bounding Errors in Zeros of Polynomials and Analytic Functions (under Prof. S.P.Pal) This work is related to the computation of bounds on errors in zeros of univariate polynomials and analytic functions. Using a new and novel approach involving Rouche's theorem, we obtain very sharp error bounds. We have also generalized it to more general analytic functions, provided we can compute good bounds on a certain cyclic integral.

Compression of Web Graphs (under Prof. Narsingh Deo, University of Central Florida) In this work we studied ways of compressing graphs which may have applications in compressing web graphs. The particular method that we have worked on uses a theorem due to Sabidussi to convert vertex transitive graphs into Cayley graphs, which may have a short representation via the underlying abelian group.

Remote Sensing and Image Processing (under Prof. Anjan Sarkar) This work is a part of an Indian Space Research Organisation (ISRO) project concerning landuse and landcover classification. Here we applied ideas from Markov Random Fields and Dampster-Shafer Theory to develop new algorithms for segmentation and classification of multispectral images. As an extension of this project we tried to use information from auxilliary sources like maps,roads,etc to increase classification accuracy and obtain Level 3 classification,as defined by the Anderson Classification scheme.

Quantum Computing (under Prof. S.P.Pal, Sudhir K.Singh) Quantum Computing really fascinates me and I have been reading QC for more than 1 year now. Apart from reading the basic literature, and several papers I have been particularly interested in Quantum Random Walks and Entanglement assisted Quantum Information Processing.

Randomized Leader Election (under Prof. S.P.Pal) This study is related to various issues in randomized leader election problems. We have defined a notion of fairness in leader election and proposed new randomized algorithms for fair leader election with optimal bit complexity in a ring network.

Computational Number Theory (under Prof Avijit Das) This project is related to the factoring problem. We did a survey of known methods and figuring out problems in the current approaches that have resisted a polynomial solution. Although nothing new was discovered, I had a great time studying algebraic number theory and admiring the great works of Gauss and Lenstra.

Other Projects

Design and Implementation of a 4 bit CPU using ICs. The CPU was stack based and could handle 12 instructions. This was done as a part of the Computer Organisation and Architecture course.

Implementation of a Unix like File System on a Floppy Disk. The File System was a paged one and supported several commands like format, mkdir, copy, etc. This was done as a part of the Operating Systems course.

Implementation of a novel approach to learning weights in a Radial Basis Function Network using methods from Bayesian Statistical Inference theory. This was done as a part of the Machine Learning course.

Design and Implementation of a System Accounting Package for collecting information on the system usage, uptime, downtime, etc. of machines connected on a LAN. This involved a lot of programming with Microsoft Windows API, socket programming and java-swing.

Relevant Courses Undertaken at Undergraduate Level

1	Mathematics I	11	Computer Organisation and Architecture
2	Mathematics II	12	Probability and Statistics
3	Basic Electronics	13	Operating Systems
4	Physics I	14	Cryptography and Network Security
5	Discrete Structures	15	Computational Geometry
6	Switching Circuits and Logic Design	16	Computatonal Complexity
7	Design and Analysis of Algorithms	17	Computer Networks
8	Formal Language and Automata Theory	18	Machine Learning
9	Classical Mechanics	19	Computer Graphics
10	Linear Algebra	20	Selected topics in Algorithms

Back to Home

Last updated : 25th September, 2004