| No. |
Title |
Author |
Year |
| 1 |
On the Complexity of Triangle Counting Using Emptiness Queries |
Bishnu, Arijit et al. |
2023 |
| 2 |
Counting and Sampling from Substructures Using Linear Algebraic Queries |
Bishnu, Arijit et al. |
2022 |
| 3 |
Faster Counting and Sampling Algorithms Using Colorful Decision Oracle |
Bhattacharya, Anup et al. |
2022 |
| 4 |
Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube |
Bishnu, Arijit et al. |
2021 |
| 5 |
Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! |
Bhattacharya, Anup et al. |
2021 |
| 6 |
Query Complexity of Global Minimum Cut |
Bishnu, Arijit et al. |
2021 |
| 7 |
Triangle Estimation Using Tripartite Independent Set Queries |
Bhattacharya, Anup et al. |
2019 |
| 8 |
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers |
Bishnu, Arijit et al. |
2018 |
| 9 |
On Density, Threshold and Emptiness Queries for Intervals in the Streaming Model |
Bishnu, Arijit et al. |
2015 |
