Bounds for Error Reduction with Few Quantum Queries. - Sourav Chakraborty 001; Jaikumar Radhakrishnan; Nandakumar Raghunathan (APPROX-RANDOM, 2005)

On the Sensitivity of Cyclically-Invariant Boolean Functions - Sourav Chakraborty 001 (Electron. Colloquium Comput. Complex., 2005)

Zero Error List-Decoding Capacity of the q/(q-1) Channel. - Sourav Chakraborty 001; Jaikumar Radhakrishnan; Nandakumar Raghunathan; Prashant Sasatte (FSTTCS, 2006)

Testing st -Connectivity. - Sourav Chakraborty 001; Eldar Fischer; Oded Lachish; Arie Matsliah; Ilan Newman (APPROX-RANDOM, 2007)

Property Testing of Equivalence under a Permutation Group Action. - Sourav Chakraborty 001; László Babai (Electron. Colloquium Comput. Complex., 2008)

Hardness and Algorithms for Rainbow Connectivity. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Raphael Yuster (STACS, 2009)

An Online Multi-unit Auction with Improved Competitive Ratio. - Sourav Chakraborty 001; Nikhil R. Devanur (WINE, 2009)

New Results on Quantum Property Testing. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Ronald de Wolf (FSTTCS, 2010)

Two-phase Algorithms for the Parametric Shortest Path Problem. - Sourav Chakraborty 001; Eldar Fischer; Oded Lachish; Raphael Yuster (STACS, 2010)

Market Equilibrium with Transaction Costs. - Sourav Chakraborty 001; Nikhil R. Devanur; Chinmay Karande (WINE, 2010)

Query Complexity Lower Bounds for Reconstruction of Codes. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah (Electron. Colloquium Comput. Complex., 2010)

Nearly Tight Bounds for Testing Function Isomorphism. - Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (Electron. Colloquium Comput. Complex., 2010)

Monotonicity Testing and Shortest-Path Routing on the Cube. - David García-Soriano; Arie Matsliah; Sourav Chakraborty 001; Jop Briët (Electron. Colloquium Comput. Complex., 2010)

Efficient Sample Extractors for Juntas with Applications. - Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (ICALP (1), 2011)

Cycle Detection, Order Finding and Discrete Log with Jumps. - Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (ICS, 2011)

Hardness and algorithms for rainbow connection. - Sourav Chakraborty 001; Eldar Fischer; Arie Matsliah; Raphael Yuster (J. Comb. Optim., 2011)

Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching. - Sourav Chakraborty 001; Eldar Fischer; David García-Soriano; Arie Matsliah (CCC, 2012)

Improved competitive ratio for the matroid secretary problem. - Sourav Chakraborty 001; Oded Lachish (SODA, 2012)

Testing uniformity of stationary distribution. - Sourav Chakraborty 001; Akshay Kamath; Rameshwar Pratap (CTW, 2013)

Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees. - Abhishek Bhrushundi; Sourav Chakraborty 001; Raghav Kulkarni (Electron. Colloquium Comput. Complex., 2013)

Nearly Tight Bounds for Testing Function Isomorphism. - Noga Alon; Eric Blais; Sourav Chakraborty 001; David García-Soriano; Arie Matsliah (SIAM J. Comput., 2013)

Counting Popular Matchings in House Allocation Problems. - Rupam Acharyya; Sourav Chakraborty 001; Nitesh Jha (CSR, 2014)

Maximal and Maximum Transitive Relation Contained in a Given Binary Relation. - Sourav Chakraborty 001; Shamik Ghosh; Nitesh Jha; Sasanka Roy (COCOON, 2015)

Characterization and recognition of proper tagged probe interval graphs. - Sourav Chakraborty 001; Shamik Ghosh; Sanchita Paul; Malay K. Sen (CoRR, 2016)

Testing whether the uniform distribution is a stationary distribution. - Sourav Chakraborty 001; Akshay Kamath; Rameshwar Pratap (Inf. Process. Lett., 2016)

On the Power of Conditional Samples in Distribution Testing. - Sourav Chakraborty 001; Eldar Fischer; Yonatan Goldhirsh; Arie Matsliah (SIAM J. Comput., 2016)

Upper bounds on Fourier entropy. - Sourav Chakraborty 001; Raghav Kulkarni; Satyanarayana V. Lokam; Nitin Saurabh (Theor. Comput. Sci., 2016)

Fourier Entropy-Influence Conjecture for Random Linear Threshold Functions. - Sourav Chakraborty 001; Sushrut Karmalkar; Srijita Kundu; Satyanarayana V. Lokam; Nitin Saurabh (LATIN, 2018)

Two new results about quantum exact learning. - Srinivasan Arunachalam; Sourav Chakraborty 001; Troy Lee; Ronald de Wolf (CoRR, 2018)

Improved bounds on Fourier entropy and Min-entropy. - Srinivasan Arunachalam; Sourav Chakraborty 001; Michal Koucký 001; Nitin Saurabh; Ronald de Wolf (Electron. Colloquium Comput. Complex., 2018)

Helly-Type Theorems in Property Testing. - Sourav Chakraborty 001; Rameshwar Pratap; Sasanka Roy; Shubhangi Saraf (Int. J. Comput. Geom. Appl., 2018)

Property Testing of Joint Distributions using Conditional Samples. - Rishiraj Bhattacharyya; Sourav Chakraborty 001 (ACM Trans. Comput. Theory, 2018)

On Testing of Uniform Samplers. - Sourav Chakraborty 001; Kuldeep S. Meel (AAAI, 2019)

Quantum Query-to-Communication Simulation Needs a Logarithmic Overhead. - Sourav Chakraborty 001; Arkadev Chattopadhyay; Nikhil S. Mande; Manaswi Paraashar (Electron. Colloquium Comput. Complex., 2019)

On Testing of Samplers. - Kuldeep S. Meel; Yash Pote; Sourav Chakraborty 001 (NeurIPS, 2020)

Estimation of Graph Isomorphism Distance in the Query World. - Sourav Chakraborty 001; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (Electron. Colloquium Comput. Complex., 2020)

Interplay Between Graph Isomorphism and Earth Mover's Distance in the Query and Communication Worlds. - Sourav Chakraborty 001; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (APPROX-RANDOM, 2021)

Designing Samplers is Easy: The Boon of Testers. - Priyanka Golia; Mate Soos; Sourav Chakraborty 001; Kuldeep S. Meel (FMCAD, 2021)

Tight Chang's-Lemma-Type Bounds for Boolean Functions. - Sourav Chakraborty 001; Nikhil S. Mande; Rajat Mittal 001; Tulasimohan Molli; Manaswi Paraashar; Swagato Sanyal (FSTTCS, 2021)

Estimating the Size of Union of Sets in Streaming Models. - Kuldeep S. Meel; N. V. Vinodchandran; Sourav Chakraborty 001 (PODS, 2021)

Two new results about quantum exact learning. - Srinivasan Arunachalam; Sourav Chakraborty 001; Troy Lee; Manaswi Paraashar; Ronald de Wolf (Quantum, 2021)

On Quantitative Testing of Samplers. - Mate Soos; Priyanka Golia; Sourav Chakraborty 001; Kuldeep S. Meel (CP, 2022)

Distinct Elements in Streams: An Algorithm for the (Text) Book. - Sourav Chakraborty 001; N. V. Vinodchandran; Kuldeep S. Meel (ESA, 2022)

A Scalable t-wise Coverage Estimator. - Eduard Baranov; Sourav Chakraborty 001; Axel Legay; Kuldeep S. Meel; N. Variyam Vinodchandran (ICSE, 2022)

On Verifying Expectations and Observations of Intelligent Agents. - Sourav Chakraborty 001; Avijeet Ghosh; Sujata Ghosh; François Schwarzentruber (IJCAI, 2022)

Estimation of the Size of Union of Delphic Sets: Achieving Independence from Stream Size. - Kuldeep S. Meel; Sourav Chakraborty 001; N. V. Vinodchandran (PODS, 2022)

Symmetry and Quantum Query-To-Communication Simulation. - Sourav Chakraborty 001; Arkadev Chattopadhyay; Peter Høyer; Nikhil S. Mande; Manaswi Paraashar; Ronald de Wolf (STACS, 2022)

Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. - Anup Bhattacharya; Sourav Chakraborty 001; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (Comput. Complex., 2022)

Colorful Helly Theorem for Piercing Boxes with Two Points. - Sourav Chakraborty 001; Arijit Ghosh; Soumi Nandi (CoRR, 2022)

The balanced connected subgraph problem. - Sujoy Bhore; Sourav Chakraborty 001; Satyabrata Jana; Joseph S. B. Mitchell; Supantha Pandit; Sasanka Roy (Discret. Appl. Math., 2022)

Testing of Index-Invariant Properties in the Huge Object Model. - Sourav Chakraborty 001; Eldar Fischer; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (Electron. Colloquium Comput. Complex., 2022)

Certificate games. - Sourav Chakraborty 001; Anna Gál; Sophie Laplante; Rajat Mittal 001; Anupa Sunny (Electron. Colloquium Comput. Complex., 2022)

Testing of Horn Samplers. - Ansuman Banerjee; Shayak Chakraborty; Sourav Chakraborty 001; Kuldeep S. Meel; Uddalok Sarkar; Sayantan Sen (AISTATS, 2023)

Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? - Diptarka Chakraborty; Sourav Chakraborty 001; Gunjan Kumar; Kuldeep S. Meel (ICALP, 2023)

Engineering an Efficient Approximate DNF-Counter. - Mate Soos; Divesh Aggarwal; Sourav Chakraborty 001; Kuldeep S. Meel; Maciej Obremski (IJCAI, 2023)

On Simple Expectations and Observations of Intelligent Agents: A Complexity Study. - Sourav Chakraborty 001; Avijeet Ghosh; Sujata Ghosh; François Schwarzentruber (KR, 2023)

On the Composition of Randomized Query Complexity and Approximate Degree. - Sourav Chakraborty 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Swagato Sanyal; Nitin Saurabh (Electron. Colloquium Comput. Complex., 2023)

Separations between Combinatorial Measures for Transitive Functions. - Sourav Chakraborty 001; Chandrima Kayal; Manaswi Paraashar (Electron. Colloquium Comput. Complex., 2023)

Testing Self-Reducible Samplers. - Rishiraj Bhattacharyya; Sourav Chakraborty 001; Yash Pote; Uddalok Sarkar; Sayantan Sen (AAAI, 2024)

Equivalence Testing: The Power of Bounded Adaptivity. - Diptarka Chakraborty; Sourav Chakraborty 001; Gunjan Kumar; Kuldeep S. Meel (AISTATS, 2024)

Approximate Degree Composition for Recursive Functions. - Sourav Chakraborty 001; Chandrima Kayal; Rajat Mittal 001; Manaswi Paraashar; Nitin Saurabh (APPROX/RANDOM, 2024)

Improved Streaming Algorithm for the Klee's Measure Problem and Generalizations. - Mridul Nandi; N. V. Vinodchandran; Arijit Ghosh; Kuldeep S. Meel; Soumit Pal; Sourav Chakraborty 001 (APPROX/RANDOM, 2024)

On Fourier Analysis of Sparse Boolean Functions over Certain Abelian Groups. - Sourav Chakraborty 001; Swarnalipa Datta; Pranjal Dutta; Arijit Ghosh; Swagato Sanyal (MFCS, 2024)

Testing and Design of Uniform CNF Samplers: A Virtuous Cycle Enabled by Distribution Testing. - Mate Soos; Sourav Chakraborty 001; Kuldeep S. Meel (SETSS, 2024)

Tight Lower Bound on Equivalence Testing in Conditional Sampling Model. - Diptarka Chakraborty; Sourav Chakraborty 001; Gunjan Kumar (SODA, 2024)

Engineering an Efficient Approximate DNF-Counter. - Mate Soos; Uddalok Sarkar; Divesh Aggarwal; Sourav Chakraborty 001; Kuldeep S. Meel; Maciej Obremski (CoRR, 2024)

Testing Credibility of Public and Private Surveys through the Lens of Regression. - Debabrota Basu; Sourav Chakraborty 001; Debarshi Chanda; Buddha Dev Das; Arijit Ghosh; Arnab Ray (CoRR, 2024)

Testing vs Estimation for Index-Invariant Properties in the Huge Object Model. - Sourav Chakraborty 001; Eldar Fischer; Arijit Ghosh; Amit Levi; Gopinath Mishra; Sayantan Sen (Electron. Colloquium Comput. Complex., 2024)

A faster FPRAS for #NFA. - Kuldeep S. Meel; Sourav Chakraborty 001; Umang Mathur 001 (Proc. ACM Manag. Data, 2024)

On the Feasibility of Forgetting in Data Streams. - Aduri Pavan; Sourav Chakraborty 001; N. V. Vinodchandran; Kuldeep S. Meel (Proc. ACM Manag. Data, 2024)

A Scalable $t$t-Wise Coverage Estimator: Algorithms and Applications. - Eduard Baranov; Sourav Chakraborty 001; Axel Legay; Kuldeep S. Meel; N. Variyam Vinodchandran (IEEE Trans. Software Eng., 2024)

Assessing the Quality of Binomial Samplers: A Statistical Distance Framework. - Uddalok Sarkar; Sourav Chakraborty 001; Kuldeep S. Meel (CAV (2), 2025)

Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing. - Sourav Chakraborty 001; Eldar Fischer; Arijit Ghosh; Gopinath Mishra; Sayantan Sen (IEEE Trans. Inf. Theory, 2025)