Travelled to:1 × Greece
1 × USA
1 × United Kingdom
Collaborated with:∅ S.Umboh S.Chawla D.L.Malec Y.He D.Wang J.F.Naughton
Talks about:approxim (2) complex (2) caratheodori (1) equilibria (1) secretari (1) subgraph (1) bipartit (1) version (1) theorem (1) process (1)
Person: Siddharth Barman
DBLP: Barman:Siddharth
Contributed to:
2015
2012
2011Wrote 3 papers:
- STOC-2015-Barman #approximate #nash #theorem
- Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory’s Theorem (SB), pp. 361–369.
- ICALP-v1-2012-BarmanUCM #problem
- Secretary Problems with Convex Costs (SB, SU, SC, DLM), pp. 75–87.
- PODS-2011-HeBWN #complexity #on the #privacy
- On the complexity of privacy-preserving complex event processing (YH, SB, DW, JFN), pp. 165–174.