#### Filter Results:

- Full text PDF available (30)

#### Publication Year

2005

2018

- This year (8)
- Last 5 years (35)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Siddharth Barman, Xishuo Liu, Stark C. Draper, Benjamin Recht
- IEEE Transactions on Information Theory
- 2011

When binary linear error-correcting codes are used over symmetric channels, a relaxed version of the maximum likelihood decoding problem can be stated as a linear program (LP). This LP decoder can be… (More)

- Siddharth Barman, Shuchi Chawla
- SODA
- 2010

We study a number of multi-route cut problems: given a graph G = (V, E) and connectivity thresholds k(u, v) on pairs of nodes, the goal is to find a minimum cost set of edges or vertices the removal… (More)

- Siddharth Barman
- STOC
- 2015

We present algorithmic applications of an approximate version of Caratheodory's theorem. The theorem states that given a set of vectors X in Rd, for every vector in the convex hull of X there exists… (More)

We consider the problem of dividing indivisible goods fairly among n agents who have additive and submodular valuations for the goods. Our fairness guarantees are in terms of the maximin share, that… (More)

- Lachlan L. H. Andrew, Siddharth Barman, +4 authors Adam Wierman
- COLT
- 2013

We consider algorithms for “smoothed online convex optimization” problems, a variant of the class of online convex optimization problems that is strongly related to metrical task systems. Prior… (More)

We study the problem of allocating indivisible goods among n agents in a fair manner. For this problem, maximin share (MMS) is a well-studied solution concept which provides a fairness threshold.… (More)

- Yeye He, Siddharth Barman, Jeffrey F. Naughton
- 2011 IEEE 27th International Conference on Data…
- 2011

In comparison to the extensive body of existing work considering publish-once, static anonymization, dynamic anonymization is less well studied. Previous work, most notably m-invariance, has made… (More)

- Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec
- ICALP
- 2012

We consider online resource allocation problems where give n a set of requests our goal is to select a subset that maximizes a value minus cost type of objective f unction. Requests are presented… (More)

We prove that in every normal form n-player game with m actions for each player, there exists an approximate Nash equilibrium in which each player randomizes uniformly among a set of O(log m + log n)… (More)

- Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Naughton
- PODS
- 2011

Complex Event Processing (CEP) Systems are stream processing systems that monitor incoming event streams in search of userspecified event patterns. While CEP systems have been adopted in a variety of… (More)