| 2026 | SODA | Compatibility of Fairness and Nash Welfare under Subadditive Valuations. | Siddharth Barman, Mashbat Suzuki |
| 2026 | SODA | Fair Division Beyond Monotone Valuations with Applications to Equitable Graph Partitioning. | Siddharth Barman, Paritosh Verma |
| 2025 | AAAI | Fair Division with Market Values. | Siddharth Barman, Soroush Ebadian, Mohamad Latifian, Nisarg Shah |
| 2024 | AAAI | Nearly Equitable Allocations beyond Additivity and Monotonicity. | Siddharth Barman, Umang Bhaskar, Yeshwant Pandit, Soumyajit Pyne |
| 2023 | AAAI | Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. | Siddharth Barman, Arindam Khan, Arnab Maiti, Ayush Sawarni |
| 2023 | AAAI | Finding Fair Allocations under Budget Constraints. | Siddharth Barman, Arindam Khan, Sudarshan Shyam, K. V. N. Sreenivas |
| 2023 | ICALP | Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. | Siddharth Barman, Pooja Kulkarni |
| 2023 | UAI | Learning good interventions in causal graphs via covering. | Ayush Sawarni, Rahul Madhavan, Gaurav Sinha, Siddharth Barman |
| 2022 | AAAI | Universal and Tight Online Algorithms for Generalized-Mean Welfare. | Siddharth Barman, Arindam Khan, Arnab Maiti |
| 2022 | AAAI | Truthful and Fair Mechanisms for Matroid-Rank Valuations. | Siddharth Barman, Paritosh Verma |
| 2022 | IJCAI | Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. | Siddharth Barman, Anand Krishna, Yadati Narahari, Soumyarup Sadhukhan |
| 2021 | IJCAI | Optimal Algorithms for Range Searching over Multi-Armed Bandits. | Siddharth Barman, Ramakrishnan Krishnamurthy, Saladi Rahul |
| 2021 | STACS | Tight Approximation Guarantees for Concave Coverage Problems. | Siddharth Barman, Omar Fawzi, Paul Ferm |
| 2020 | ESA | Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. | Siddharth Barman, Umang Bhaskar, Anand Krishna, Ranjani G. Sundaram |
| 2020 | IJCAI | Uniform Welfare Guarantees Under Identical Subadditive Valuations. | Siddharth Barman, Ranjani G. Sundaram |
| 2020 | IPCO | Tight Approximation Bounds for Maximum Multi-coverage. | Siddharth Barman, Omar Fawzi, Suprovat Ghoshal, Emirhan Grpinar |
| 2019 | AAAI | Fair Division with a Secretive Agent. | Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi |
| 2019 | AAAI | On the Proximity of Markets with Integral Equilibria. | Siddharth Barman, Sanath Kumar Krishnamurthy |
| 2019 | AAAI | Matroid Constrained Fair Allocation Problem. | Arpita Biswas, Siddharth Barman |
| 2019 | SODA | Fully Polynomial-Time Approximation Schemes for Fair Rent Division. | Eshwar Ram Arunachaleswaran, Siddharth Barman, Nidhi Rathi |
| 2018 | AAAI | Groupwise Maximin Fair Allocation of Indivisible Goods. | Siddharth Barman, Arpita Biswas, Sanath Kumar Krishna Murthy, Yadati Narahari |
| 2018 | AAAI | Online Learning for Structured Loss Spaces. | Siddharth Barman, Aditya Gopalan, Aadirupa Saha |
| 2018 | ICML | Testing Sparsity over Known and Unknown Bases. | Siddharth Barman, Arnab Bhattacharyya, Suprovat Ghoshal |
| 2018 | IJCAI | Fair Division Under Cardinality Constraints. | Arpita Biswas, Siddharth Barman |
| 2016 | ISIT | Algorithmic aspects of optimal channel coding. | Siddharth Barman, Omar Fawzi |
| 2015 | STOC | Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem. | Siddharth Barman |
| 2015 | SIGMETRICS | Online Convex Optimization Using Predictions. | Niangjun Chen, Anish Agarwal, Adam Wierman, Siddharth Barman, Lachlan L. H. Andrew |
| 2015 | SAGT | Approximating Nash Equilibria in Tree Polymatrix Games. | Siddharth Barman, Katrina Ligett, Georgios Piliouras |
| 2014 | ICDT | On Load Shedding in Complex Event Processing. | Yeye He, Siddharth Barman, Jeffrey F. Naughton |
| 2013 | COLT | A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. | Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman |
| 2013 | SIGMETRICS | A tale of two metrics: simultaneous bounds on competitiveness and regret. | Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman |
| 2012 | ESA | A Bicriteria Approximation for the Reordering Buffer Problem. | Siddharth Barman, Shuchi Chawla, Seeun Umboh |
| 2012 | ICALP | Secretary Problems with Convex Costs. | Siddharth Barman, Seeun Umboh, Shuchi Chawla, David L. Malec |
| 2012 | ICDE | Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach. | Chong Sun, Jeffrey F. Naughton, Siddharth Barman |
| 2012 | SODA | Traffic-redundancy aware network design. | Siddharth Barman, Shuchi Chawla |
| 2011 | ICDE | Preventing equivalence attacks in updated, anonymized data. | Yeye He, Siddharth Barman, Jeffrey F. Naughton |
| 2011 | PODS | On the complexity of privacy-preserving complex event processing. | Yeye He, Siddharth Barman, Di Wang, Jeffrey F. Naughton |
| 2010 | SODA | Region Growing for Multi-Route Cuts. | Siddharth Barman, Shuchi Chawla |
| 2009 | SODA | Packing multiway cuts in capacitated graphs. | Siddharth Barman, Shuchi Chawla |
| 2005 | ICDCIT | Secure Two-Party Context Free Language Recognition. | Anshuman Singh, Siddharth Barman, Kaushal K. Shukla |