| No. |
Title |
Author |
Year |
| 1 |
Approximate Model Counting: Is SAT Oracle More Powerful Than NP Oracle? |
Chakraborty, Diptarka et al. |
2023 |
| 2 |
Certificate Games |
Chakraborty, Sourav et al. |
2023 |
| 3 |
On the Composition of Randomized Query Complexity and Approximate Degree |
Chakraborty, Sourav et al. |
2023 |
| 4 |
Distinct Elements in Streams: An Algorithm for the (Text) Book |
Chakraborty, Sourav et al. |
2022 |
| 5 |
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing |
Chakraborty, Sourav et al. |
2022 |
| 6 |
On Quantitative Testing of Samplers |
Soos, Mate et al. |
2022 |
| 7 |
Separations Between Combinatorial Measures for Transitive Functions |
Chakraborty, Sourav et al. |
2022 |
| 8 |
Symmetry and Quantum Query-To-Communication Simulation |
Chakraborty, Sourav et al. |
2022 |
| 9 |
Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds |
Chakraborty, Sourav et al. |
2021 |
| 10 |
Tight Chang’s-Lemma-Type Bounds for Boolean Functions |
Chakraborty, Sourav et al. |
2021 |
| 11 |
Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond |
Bhattacharya, Anup et al. |
2020 |
| 12 |
Improved Bounds on Fourier Entropy and Min-Entropy |
Arunachalam, Srinivasan et al. |
2020 |
| 13 |
Quantum Query-To-Communication Simulation Needs a Logarithmic Overhead |
Chakraborty, Sourav et al. |
2020 |
| 14 |
Two New Results About Quantum Exact Learning |
Arunachalam, Srinivasan et al. |
2019 |
| 15 |
New Results on Quantum Property Testing |
Chakraborty, Sourav et al. |
2010 |
| 16 |
Two-phase Algorithms for the Parametric Shortest Path Problem |
Chakraborty, Sourav et al. |
2010 |
| 17 |
Hardness and Algorithms for Rainbow Connectivity |
Chakraborty, Sourav et al. |
2009 |
