| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube | Bishnu, Arijit et al. | 2021 |
| 2 | Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! | Bhattacharya, Anup et al. | 2021 |
| 3 | Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds | Chakraborty, Sourav et al. | 2021 |
| 4 | Query Complexity of Global Minimum Cut | Bishnu, Arijit et al. | 2021 |
| 5 | Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond | Bhattacharya, Anup et al. | 2020 |
| 6 | Triangle Estimation Using Tripartite Independent Set Queries | Bhattacharya, Anup et al. | 2019 |
| 7 | FPT Algorithms for Embedding into Low Complexity Graphic Metrics | Ghosh, Arijit et al. | 2018 |
| 8 | Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers | Bishnu, Arijit et al. | 2018 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |