Computer Science Project

Resume of Arindam Pal

Work Address Home Address

Department of Computer Science and Engineering Flat number 602, Sarvapriya Apartments

Indian Institute of Technology, Delhi Sarvapriya Vihar

New Delhi 110016 New Delhi 110016

Phone: +91-011-******** Phone: +91-011-********

Email: ********@***.****.*****.** Email: ********@*****.***

Objective To work as a researcher in a world-class university or research lab on challenging

and interesting problems with highly competent and visionary researchers. The

work should be exciting and motivate me to come up with new ideas, that will

in uence the way computers are used, and make a positive impact on people s life.

Research Interests

Algorithms, Combinatorial Optimization, Machine Learning, Information Retrieval.

Courses Algorithmic Game Theory, Approximation Algorithms, Computational Geometry,

Discrete Geometry, Cryptography, Linear Programming and Optimization, Ma-

chine Learning, Percolation Theory and Random Graphs, Quantum Computation,

Randomized Algorithms.

Teaching Assistantship

Advanced Algorithms, Analysis and Design of Algorithms, Data Structures, Dis-

crete Mathematics.

Work Experience

Software Architecture, Performance Engineering, Web Services, Storage Systems.

Skill Set C, C++, C#, Java, UML, XML, .NET Framework, UNIX, Linux, Windows.

Education Indian Institute of Technology Delhi

Ph.D., Computer Science and Engineering, August 2007 November 2012.

CGPA: 9.25 on a scale of 10.

Thesis : Approximation Algorithms for Covering and Packing Problems on Paths.

Advisors : Professor Amit Kumar and Professor Naveen Garg.

Indian Institute of Science Bangalore

Master of Engineering, Computer Science and Engineering, 2000 2002.

Graduated with First Class with Distinction.

Thesis : E cient algorithms for generating all minimum cuts and the

Cactus representation of a graph.

Adviser : Professor Ramesh Hariharan.

Jadavpur University Kolkata

Bachelor of Engineering, Computer Science and Engineering, 1996 2000.

Graduated with First Class with Honors.

Project: Simulator for UML diagrams.

Adviser : Professor Samiran Chattopadhyay.

Publications 1. Approximation Algorithms for Unsplittable Flow Problems on Paths and Trees.

Khaled Elbassioni, Naveen Garg, Divya Gupta, Amit Kumar, Vishal Narula and

Arindam Pal, 32nd Foundations of Software Technology and Theoretical Com-

puter Science (FSTTCS) 2012.

2. Scheduling resources for executing a partial set of jobs.

Venkatesan Chakaravarthy, Arindam Pal, Sambuddha Roy and Yogish Sabharwal,

32nd Foundations of Software Technology and Theoretical Computer Science

(FSTTCS) 2012.

3. A Token-based Distributed Algorithm for Total Order Atomic Broadcast.

Sandip Dey and Arindam Pal, International Workshop on Distributed Computing

(IWDC) 2002, Lecture Notes in Computer Science (LNCS) 2571.

Manuscripts 1. Minimum multicuts and Steiner forests for Okamura-Seymour graphs.

Arindam Pal, arXiv:CoRR abs/1102.5478: [cs.DS].

2. Online Algorithms for Interval Coloring on Paths with Capacities and De-

mands.

3. Performance of k -means++ clustering algorithm on data satisfying (c, )-

approximation-stability.

4. A Primal-Dual 2-Approximation Algorithm for the Unsplittable Flow Problem

on Paths.

5. A Constant Factor Approximation Algorithm for the Unsplittable Flow Prob-

lem on Trees.

6. A 2-Approximation Algorithm for Minimum Multicuts for Okamura-Seymour

Graphs.

7. Algorithms for graph compression.

Talks 1. Finding Maximum Independent Sets in Unions of Perfect Graphs, IIT Delhi.

2. Approximation Algorithms for Unsplittable Flow Problems on Paths and Trees,

IIT Kharagpur, ISI Kolkata, TCS Innovation Labs Kolkata.

3. Approximation Algorithms for Covering and Packing Problems on Paths, IIT

Delhi.

4. Algorithms for Interval Coloring with Capacities and Demands, IIT Delhi.

5. Approximate Counting and Markov Chain Monte Carlo, IIT Delhi.

6. Algorithms for graph compression, Yahoo! Research Labs.

7. All-or-Nothing multicommodity ow and related problems, IIT Delhi.

Achievements Recipient of Infosys Ph.D. Fellowship for Computer Science at IIT Delhi.

Recipient of IIT institute scholarship for pursuing Ph.D. in Computer Science.

Secured All India 11th rank out of 30,000 candidates in Graduate Aptitude Test

in Engineering (GATE) in Computer Science in 2000 (99.82 percentile).

Jagadish Bose National Science Talent Search Award First Prize winner 1997.

Placed in the top 0.2% among 300,000 candidates in IIT JEE in 1996.

Got Second place in Indian Statistical Institute Entrance Examination 1996.

Ranked 18th out of 100,000 candidates in West Bengal JEE in 1996.

Indian National Mathematical Olympiad (INMO) Awardee 1995.

Mathematics Talent Search (MTS) Scholarship by NCERT and NBHM in 1994.

Experience IBM Research Labs Delhi

May, 2011 July, 2011

Designation: Intern Researcher.

Mentor : Venkatesan Chakaravarthy, Sambuddha Roy, Yogish Sabharwal.

Project: Approximation Algorithms for Resource Allocation Problems.

Job Description: I worked on design of e cient approximation algorithms for

resource allocation for partial covering of jobs. The goal is to meet the demands

of a set of jobs using a set of resources with certain capacities at minimum cost.

Yahoo! Research Labs Bangalore

May, 2009 July, 2009

Designation: Intern Researcher.

Mentor : Rajeev Rastogi.

Project: Algorithms for XPath wrapper induction and Graph compression.

Job Description: I worked on design of e cient algorithms for compressing the

adjacency list representation of graphs, in particular web graphs and social net-

works. I also worked on designing XPath wrappers for information extraction from

HTML and XML documents.

Yahoo! Inc Bangalore

August, 2006 July, 2007

Designation: Technical Lead.

Project: Strategic Data Solutions.

Primary Responsibility : Design and implementation of analytical and instrumen-

tation products.

Cognizant Technology Solutions Kolkata

August, 2005 July, 2006

Designation: Technical Lead.

Project: Retail Technology Consultancy Group.

Primary Responsibility : To de ne the charter for Performance Engineering and

Capacity Planning across the company. In addition, I do architecture, design, and

code review for various projects.

Microsoft Corporation Hyderabad

August, 2002 July, 2005

Designation: Software Design Engineer.

Project: Windows Serviceability.

Primary Responsibility : Debugging customer problems in Windows kernel, NTFS,

and WDM device drivers. The devices range from USB, SCSI, IEEE 1394.

Project: Microsoft Data Protection Manager.

Primary Responsibility : Design and implementation of UI and Archive Manager.

Novell Inc Bangalore

February, 2002 July, 2002

Designation: Software Development Engineer.

Project: Novell DNS Server.

Primary Responsibility : Design and implementation of DNS Name Resolution

Service and integration with Novell eDirectory.

References Professor Amit Kumar

Department of Computer Science and Engineering

Indian Institute of Technology, Delhi

Professor Naveen Garg

Department of Computer Science and Engineering

Indian Institute of Technology, Delhi

Professor Amitabha Bagchi

Department of Computer Science and Engineering

Indian Institute of Technology, Delhi

Professor Sandeep Sen

Department of Computer Science and Engineering

Indian Institute of Technology, Delhi

Dr Ramesh Hariharan

Co-founder and Chief Technology o cer

Strand Life Sciences, Bangalore

Professor Samiran Chattopadhyay

Department of Information Technology

Jadavpur University, Kolkata

Mr Atanu Mukherjee

President

M. N. Dastur & Company

Contact this candidate