| Decomposition methods for large scale LP decoding S Barman, X Liu, SC Draper, B Recht IEEE Transactions on Information Theory 59 (12), 7870-7886, 2013 | 112 | 2013 |
| Finding fair and efficient allocations S Barman, SK Krishnamurthy, R Vaish Proceedings of the 2018 ACM Conference on Economics and Computation, 557-574, 2018 | 85 | 2018 |
| Approximation algorithms for maximin fair division S Barman, SK Krishnamurthy ACM Transactions on Economics and Computation (TEAC) 8 (1), 1-28, 2020 | 78 | 2020 |
| Approximating nash equilibria and dense bipartite subgraphs via an approximate version of caratheodory's theorem S Barman Proceedings of the forty-seventh annual ACM symposium on Theory of computing …, 2015 | 64 | 2015 |
| A tale of two metrics: Simultaneous bounds on competitiveness and regret L Andrew, S Barman, K Ligett, M Lin, A Meyerson, A Roytman, A Wierman Conference on Learning Theory, 741-763, 2013 | 64 | 2013 |
| Online convex optimization using predictions N Chen, A Agarwal, A Wierman, S Barman, LLH Andrew Proceedings of the 2015 ACM SIGMETRICS International Conference on …, 2015 | 57 | 2015 |
| Preventing equivalence attacks in updated, anonymized data Y He, S Barman, JF Naughton 2011 IEEE 27th International Conference on Data Engineering, 529-540, 2011 | 46 | 2011 |
| Groupwise maximin fair allocation of indivisible goods S Barman, A Biswas, S Krishnamurthy, Y Narahari Proceedings of the AAAI Conference on Artificial Intelligence 32 (1), 2018 | 34 | 2018 |
| On the complexity of privacy-preserving complex event processing Y He, S Barman, D Wang, JF Naughton Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on …, 2011 | 34 | 2011 |
| On load shedding in complex event processing Y He, S Barman, JF Naughton arXiv preprint arXiv:1312.4283, 2013 | 29 | 2013 |
| Greedy algorithms for maximizing Nash social welfare S Barman, SK Krishnamurthy, R Vaish arXiv preprint arXiv:1801.09046, 2018 | 28 | 2018 |
| Secretary problems with convex costs S Barman, S Umboh, S Chawla, D Malec International Colloquium on Automata, Languages, and Programming, 75-87, 2012 | 25 | 2012 |
| Fair Division Under Cardinality Constraints. A Biswas, S Barman IJCAI, 91-97, 2018 | 23 | 2018 |
| Simple approximate equilibria in large games Y Babichenko, S Barman, R Peretz Proceedings of the fifteenth ACM conference on Economics and computation …, 2014 | 22 | 2014 |
| Query complexity of correlated equilibrium Y Babichenko, S Barman ACM Transactions on Economics and Computation (TEAC) 3 (4), 1-9, 2015 | 19 | 2015 |
| Empirical distribution of equilibrium play and its testing application Y Babichenko, S Barman, R Peretz Mathematics of Operations Research 42 (1), 15-29, 2017 | 18 | 2017 |
| Computational aspects of private bayesian persuasion Y Babichenko, S Barman arXiv preprint arXiv:1603.01444, 2016 | 18 | 2016 |
| Approximating Nash equilibria in tree polymatrix games S Barman, K Ligett, G Piliouras International Symposium on Algorithmic Game Theory, 285-296, 2015 | 18 | 2015 |
| Finding any nontrivial coarse correlated equilibrium is hard S Barman, K Ligett ACM SIGecom Exchanges 14 (1), 76-79, 2015 | 17 | 2015 |
| On the proximity of markets with integral equilibria S Barman, SK Krishnamurthy Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 1748-1755, 2019 | 15 | 2019 |
