Secure Two-Party Context Free Language Recognition. - Anshuman Singh; Siddharth Barman; Kaushal K. Shukla (ICDCIT, 2005)

Packing multiway cuts in capacitated graphs. - Siddharth Barman; Shuchi Chawla 001 (SODA, 2009)

Region Growing for Multi-Route Cuts. - Siddharth Barman; Shuchi Chawla 001 (SODA, 2010)

Preventing equivalence attacks in updated, anonymized data. - Yeye He; Siddharth Barman; Jeffrey F. Naughton (ICDE, 2011)

On the complexity of privacy-preserving complex event processing. - Yeye He; Siddharth Barman; Di Wang 031; Jeffrey F. Naughton (PODS, 2011)

A Bicriteria Approximation for the Reordering Buffer Problem. - Siddharth Barman; Shuchi Chawla 001; Seeun Umboh (ESA, 2012)

Secretary Problems with Convex Costs. - Siddharth Barman; Seeun Umboh; Shuchi Chawla 001; David L. Malec (ICALP (1), 2012)

Approximate String Membership Checking: A Multiple Filter, Optimization-Based Approach. - Chong Sun; Jeffrey F. Naughton; Siddharth Barman (ICDE, 2012)

Traffic-redundancy aware network design. - Siddharth Barman; Shuchi Chawla 001 (SODA, 2012)

The empirical implications of rank in Bimatrix games. - Siddharth Barman; Umang Bhaskar; Federico Echenique; Adam Wierman (EC, 2013)

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 (SIGMETRICS, 2013)

Small-Support Approximate Correlated Equilibria. - Yakov Babichenko; Siddharth Barman; Ron Peretz (CoRR, 2013)

The Complexity of Nash Equilibria as Revealed by Data. - Siddharth Barman; Umang Bhaskar; Federico Echenique; Adam Wierman (CoRR, 2013)

A 2-Approximation for Redundancy Aware Network Design with Laminar Demands - Siddharth Barman; Shuchi Chawla 001; Seeun Umboh (CoRR, 2013)

Decomposition Methods for Large Scale LP Decoding. - Siddharth Barman; Xishuo Liu; Stark C. Draper; Benjamin Recht (IEEE Trans. Inf. Theory, 2013)

Network Design with Coverage Costs. - Siddharth Barman; Shuchi Chawla 001; Seeun Umboh (APPROX-RANDOM, 2014)

On Load Shedding in Complex Event Processing. - Yeye He; Siddharth Barman; Jeffrey F. Naughton (ICDT, 2014)

Simple approximate equilibria in large games. - Yakov Babichenko; Siddharth Barman; Ron Peretz (EC, 2014)

On the Existence of Low-Rank Explanations for Mixed Strategy Behavior. - Siddharth Barman; Umang Bhaskar; Federico Echenique; Adam Wierman (WINE, 2014)

Approximating Carathéodory's Theorem and Nash Equilibria. - Siddharth Barman (CoRR, 2014)

Approximating Nash Equilibria in Tree Polymatrix Games. - Siddharth Barman; Katrina Ligett; Georgios Piliouras (SAGT, 2015)

Online Convex Optimization Using Predictions. - Niangjun Chen; Anish Agarwal; Adam Wierman; Siddharth Barman; Lachlan L. H. Andrew (SIGMETRICS, 2015)

Approximating Nash Equilibria and Dense Bipartite Subgraphs via an Approximate Version of Caratheodory's Theorem. - Siddharth Barman (STOC, 2015)

Computing Optimal Tolls in Routing Games without Knowing the Latency Functions. - Siddharth Barman; Umang Bhaskar; Chaitanya Swamy (CoRR, 2015)

Finding any nontrivial coarse correlated equilibrium is hard. - Siddharth Barman; Katrina Ligett (SIGecom Exch., 2015)

Query Complexity of Correlated Equilibrium. - Yakov Babichenko; Siddharth Barman (ACM Trans. Economics and Comput., 2015)

Computational Aspects of Private Bayesian Persuasion. - Yakov Babichenko; Siddharth Barman (CoRR, 2016)

The Dictionary Testing Problem. - Siddharth Barman; Arnab Bhattacharyya 001; Suprovat Ghoshal (CoRR, 2016)

Algorithmic Aspects of Private Bayesian Persuasion. - Yakov Babichenko; Siddharth Barman (ITCS, 2017)

Empirical Distribution of Equilibrium Play and Its Testing Application. - Yakov Babichenko; Siddharth Barman; Ron Peretz (Math. Oper. Res., 2017)

Groupwise Maximin Fair Allocation of Indivisible Goods. - Siddharth Barman; Arpita Biswas; Sanath Kumar Krishna Murthy; Yadati Narahari (AAAI, 2018)

Online Learning for Structured Loss Spaces. - Siddharth Barman; Aditya Gopalan; Aadirupa Saha (AAAI, 2018)

Greedy Algorithms for Maximizing Nash Social Welfare. - Siddharth Barman; Sanath Kumar Krishnamurthy; Rohit Vaish (AAMAS, 2018)

Testing Sparsity over Known and Unknown Bases. - Siddharth Barman; Arnab Bhattacharyya 001; Suprovat Ghoshal (ICML, 2018)

Fair Division Under Cardinality Constraints. - Arpita Biswas; Siddharth Barman (IJCAI, 2018)

Finding Fair and Efficient Allocations. - Siddharth Barman; Sanath Kumar Krishnamurthy; Rohit Vaish (EC, 2018)

Approximating Nash Equilibria and Dense Subgraphs via an Approximate Version of Carathéodory's Theorem. - Siddharth Barman (SIAM J. Comput., 2018)

Algorithmic Aspects of Optimal Channel Coding. - Siddharth Barman; Omar Fawzi (IEEE Trans. Inf. Theory, 2018)

Fair Division with a Secretive Agent. - Eshwar Ram Arunachaleswaran; Siddharth Barman; Nidhi Rathi (AAAI, 2019)

On the Proximity of Markets with Integral Equilibria. - Siddharth Barman; Sanath Kumar Krishnamurthy (AAAI, 2019)

Matroid Constrained Fair Allocation Problem. - Arpita Biswas; Siddharth Barman (AAAI, 2019)

Fair Division of Indivisible Goods Among Strategic Agents. - Siddharth Barman; Ganesh Ghalme; Shweta Jain 002; Pooja Kulkarni; Shivika Narang (AAMAS, 2019)

Fair and Efficient Cake Division with Connected Pieces. - Eshwar Ram Arunachaleswaran; Siddharth Barman; Rachitesh Kumar; Nidhi Rathi (WINE, 2019)

Quantifying Infra-Marginality and Its Trade-off with Group Fairness. - Arpita Biswas; Siddharth Barman; Amit Deshpande; Amit Sharma 007 (CoRR, 2019)

Tight Approximation Algorithms for p-Mean Welfare Under Subadditive Valuations. - Siddharth Barman; Umang Bhaskar; Anand Krishna; Ranjani G. Sundaram (ESA, 2020)

Uniform Welfare Guarantees Under Identical Subadditive Valuations. - Siddharth Barman; Ranjani G. Sundaram (IJCAI, 2020)

Optimal Bounds on the Price of Fairness for Indivisible Goods. - Siddharth Barman; Umang Bhaskar; Nisarg Shah 001 (WINE, 2020)

Settling the Price of Fairness for Indivisible Goods. - Siddharth Barman; Umang Bhaskar; Nisarg Shah 001 (CoRR, 2020)

Approximation Algorithms for Maximin Fair Division. - Siddharth Barman; Sanath Kumar Krishnamurthy (ACM Trans. Economics and Comput., 2020)

Existence and Computation of Maximin Fair Allocations Under Matroid-Rank Valuations. - Siddharth Barman; Paritosh Verma (AAMAS, 2021)

Optimal Algorithms for Range Searching over Multi-Armed Bandits. - Siddharth Barman; Ramakrishnan Krishnamurthy; Saladi Rahul (IJCAI, 2021)

Tight Approximation Guarantees for Concave Coverage Problems. - Siddharth Barman; Omar Fawzi; Paul Fermé (STACS, 2021)

Approximating Nash Social Welfare Under Binary XOS and Binary Subadditive Valuations. - Siddharth Barman; Paritosh Verma (WINE, 2021)

Intervention Efficient Algorithm for Two-Stage Causal MDPs. - Rahul Madhavan; Aurghya Maiti; Gaurav Sinha 001; Siddharth Barman (CoRR, 2021)

Universal and Tight Online Algorithms for Generalized-Mean Welfare. - Siddharth Barman; Arindam Khan 001; Arnab Maiti (AAAI, 2022)

Truthful and Fair Mechanisms for Matroid-Rank Valuations. - Siddharth Barman; Paritosh Verma (AAAI, 2022)

Achieving Envy-Freeness with Limited Subsidies under Dichotomous Valuations. - Siddharth Barman; Anand Krishna; Yadati Narahari; Soumyarup Sadhukhan (IJCAI, 2022)

Nash Welfare Guarantees for Fair and Efficient Coverage. - Siddharth Barman; Anand Krishna; Y. Narahari; Soumyarup Sadhukhan (WINE, 2022)

Fully Polynomial-Time Approximation Schemes for Fair Rent Division. - Eshwar Ram Arunachaleswaran; Siddharth Barman; Nidhi Rathi (Math. Oper. Res., 2022)

Fair Cake Division Under Monotone Likelihood Ratios. - Siddharth Barman; Nidhi Rathi (Math. Oper. Res., 2022)

Tight approximation bounds for maximum multi-coverage. - Siddharth Barman; Omar Fawzi; Suprovat Ghoshal; Emirhan Gürpinar (Math. Program., 2022)

Fairness and Welfare Quantification for Regret in Multi-Armed Bandits. - Siddharth Barman; Arindam Khan 001; Arnab Maiti; Ayush Sawarni (AAAI, 2023)

Finding Fair Allocations under Budget Constraints. - Siddharth Barman; Arindam Khan 001; Sudarshan Shyam; K. V. N. Sreenivas (AAAI, 2023)

Fair Chore Division under Binary Supermodular Costs. - Siddharth Barman; Vishnu V. Narayan; Paritosh Verma (AAMAS, 2023)

Approximation Algorithms for Envy-Free Cake Division with Connected Pieces. - Siddharth Barman; Pooja Kulkarni (ICALP, 2023)

Nash Regret Guarantees for Linear Bandits. - Ayush Sawarni; Soumyabrata Pal; Siddharth Barman (NeurIPS, 2023)

Guaranteeing Envy-Freeness under Generalized Assignment Constraints. - Siddharth Barman; Arindam Khan 001; Sudarshan Shyam; K. V. N. Sreenivas (EC, 2023)

Learning good interventions in causal graphs via covering. - Ayush Sawarni; Rahul Madhavan; Gaurav Sinha 001; Siddharth Barman (UAI, 2023)

Nash Regret Guarantees for Linear Bandits. - Ayush Sawarni; Soumybrata Pal; Siddharth Barman (CoRR, 2023)

The Edgeworth Conjecture with Small Coalitions and Approximate Equilibria in Large Economies. - Siddharth Barman; Federico Echenique (Math. Oper. Res., 2023)

Nearly Equitable Allocations beyond Additivity and Monotonicity. - Siddharth Barman; Umang Bhaskar; Yeshwant Pandit; Soumyajit Pyne (AAAI, 2024)

Parameterized Guarantees for Almost Envy-Free Allocations. - Siddharth Barman; Debajyoti Kar; Shraddha Pathak (AAMAS, 2024)

Sublinear Approximation Algorithm for Nash Social Welfare with XOS Valuations. - Siddharth Barman; Anand Krishna; Pooja Kulkarni; Shivika Narang (ITCS, 2024)

Generalized Linear Bandits with Limited Adaptivity. - Ayush Sawarni; Nirjhar Das; Siddharth Barman; Gaurav Sinha 001 (NeurIPS, 2024)

Causal Contextual Bandits with Adaptive Context. - Rahul Madhavan; Aurghya Maiti; Gaurav Sinha 001; Siddharth Barman (RLJ, 2024)

Optimal Regret with Limited Adaptivity for Generalized Linear Contextual Bandits. - Ayush Sawarni; Nirjhar Das; Siddharth Barman; Gaurav Sinha 001 (CoRR, 2024)

Compatibility of Fairness and Nash Welfare under Subadditive Valuations. - Siddharth Barman; Mashbat Suzuki (CoRR, 2024)

Fair Division with Market Values. - Siddharth Barman; Soroush Ebadian; Mohamad Latifian; Nisarg Shah 001 (AAAI, 2025)

Fair Division Beyond Monotone Valuations. - Siddharth Barman; Paritosh Verma (CoRR, 2025)

Exact Maximin Share Fairness via Adjusted Supply. - Siddharth Barman; Satyanand Rammohan; Aditi Sethia (CoRR, 2025)

Fair and Efficient Allocation of Indivisible Mixed Manna. - Siddharth Barman; Vishwa Prakash HV; Aditi Sethia; Mashbat Suzuki (CoRR, 2025)