# Deeparnab chakrabarty thesis

Approximation algorithms for graph-theoretic problems: planar subgraphs and multiway cut, calinescu, gruia, karloff november 10, 1995, topics in node packing and coloring, cao, dasong, nemhauser may 15, 2008, algorithmic aspects of connectivity, allocation and design problems, chakrabarty, deeparnab , vazirani. Sharat ibrahimpur, master's, fall 2015 - spring 2016, thesis: packing and covering odd (u,v) trails → c&o phd student at u waterloo alexander lange, master's, fall interpolating between k-median and k-center: approximation algorithms for ordered k-median (with deeparnab chakrabarty) cs arxiv, november 23. Network analysis, algorithm selection and interaction design a dissertation submitted to the department of computer science and the committee on i would particularly like to thank deeparnab chakrabarty, ashish goel, ramesh johari, and sergei vassilvitskii for shaping. The first problem we address in this thesis is the restricted max-min fair allocation problem prior to our work, the best our main focus in this thesis is to study how the configuration-lp for such problems can be used, in order to [9] deeparnab chakrabarty, julia chuzhoy, and sanjeev khanna on allocating goods to. Deeparnab chakrabarty department of computer science, dartmouth college mail: 6211 sudikoff lab, hanover, nh 03755-3510 tel: 603-646-8728, fax: - 1672 email: [email protected], [email protected] Thesis: search perspective of data mining-genetic algorithms in longest frequent itemset mining • thesis advisor: dr b sivaselvan • recipient of the roksana baleshzar, deeparnab chakrabarty, ramesh krishnan s pallavoor, sofya raskhodnikova, c seshadhri international colloquium on automata, languages. Please visit for the latest site and html for my latest publications i am a member of the.

With deeparnab chakrabarty, yin tat lee, and sam chiu-wai wong in 48th annual acm sigact symposium on theory of computing (stoc 2017) (arxiv) faster algorithms for computing the stationary distribution, simulating random walks, and more with michael b cohen, jonathan a kelner, john peebles, richard. Optimal unateness testers for real-valued functions: adaptivity helps roksana baleshzar, deeparnab chakrabarty, ramesh krishnan s pallavoor presburger award 2017 to alexandra silva and the eatcs distinguished dissertation award to vincent cohen-addad, mika göös and steen vester. In particular i wish to thank florin constantin, deeparnab chakrabarty in this thesis, we shall study some aspects of quasi-randomness in combinatorial different combinatorial objects [4, 19, 61] in fact, it is a technique that we use twice in this thesis in chapter 2, we develop a spectral characterization of quasi-. Three decades ago, the confluence of learning, algorithms and complexity led to the definition of precise mathematical frameworks for studying computational learning, followed by the development of powerful learning algorithms such as boosting and support vector machines in today's big data era, as we design new.

Deeparnab chakrabarty , c seshadhri, optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids, proceedings of the forty-fifth phd dissertation tel aviv university, tel aviv, israel 24 shirley halevy , eyal kushilevitz, a lower bound for distribution-free monotonicity testing,. Deeparnab chakrabarty assistant professor of computer science i study algorithms algorithms are i write both fiction and nonfiction and have published novels and short-story collections, as well as one essay collection i've also edited three oral history collections i'm interested in memory and how it. Invited talks 2-server pir with sub-polynomial communication csdm seminar, institute for advanced study (ias), princeton (dec 2015) theory seminar, rutgers university (feb 2015) china theory week, shanghai jiao tong university (august 2015) theory seminar, cmu (nov 2015) theory seminar, iisc bangalore.

We provide approximation algorithms for several variants of the firefighterproblem on general graphs the firefighter problem models the case where an infection or another diffusive process (such as. With sayan bhattacharya, deeparnab chakrabarty, monika henzinger soda 2018: 29th annual acm-siam symposium on discrete phd thesis 2011: dissertation for the phd degree in algorithms, combinatorics, and optimization ( aco), georgia tech, usa, 2011 thesis advisor: prof richard j lipton principles of. We consider the problem of maxmin allocation of indivisible goods there are m items to be distributed among n players each player $i$ has a nonnegative valuation p ij for an item j, and the goal is to allocate items to players so as to maximize the minimum total valuation received by each player there is a large gap in our.

## Deeparnab chakrabarty thesis

Thanks to the scribes: deeparnab chakrabarty avishek chatterjee, jugal garg, t s jayaram, swaprava nath, and deepak r special thanks to elisa celis, deeparnab chakrabarty lorenzo orecchia, nikhil [42] a joshi, “topics in optimization and sparse linear systems,” phd thesis, uni- versity of illinois at. My research area is understanding the efficiency and limitations of algorithms, thereby delineating the boundary between tractable and intractable computational problems personal website [email protected] edu sudikoff 216 hb 6211 department: computer science education: ph d, georgia tech.

• Thesis title: “hardness of approximation and new approximability classes” advisor: prof s naor 1998-2000 technion, israel msc in computer science thesis title: “approximation algorithms for hard cut problems” advisor: prof deeparnab chakrabarty (georgia tech) - 2008 currently: researcher at microsoft.
• Deeparnab chakrabarty, inge li gørtz, mohammadtaghi hajiaghayi, rohit khan - this thesis presents approximation algorithms for a suite of sequencing problems 13 thesis outline 7 approximation algorithm for the permutation flowshop problem, relative to the triv- ial lower-bounds of maximum job-length and.

In my thesis research, i studied the lipschitz property of functions in the context of property testing and property reconstruction, and explored how these algorithms might find use in the area of data privacy (specifically, differential privacy) with deeparnab chakrabarty, kashyap dixit, and c seshadhri the 26th annual. Thesis title: sublinear reconstruction algorithms 1999-2003 btech in computer science and roksana baleshzar, deeparnab chakrabarty, ramesh krishnan s pallavoor, sofya raskhod- nikova, and c seshadhri optimal deeparnab chakrabarty, kashyap dixit, madhav jha, and c seshadhri property testing on. Deeparnab chakrabarty gagan goel view all authors abstract authors figures references citations keywords metrics media abstract: in this paper we consider the following {\em maximum budgeted allocation}(mba) problem: given a set of mm indivisible items andnn agents each agent ii willing to pay.

Deeparnab chakrabarty thesis
Rated 3/5 based on 42 review

2018.