No. Title Author Year
1 On the Complexity of Triangle Counting Using Emptiness Queries Bishnu, Arijit et al. 2023
2 Optimal (Degree+1)-Coloring in Congested Clique Coy, Sam et al. 2023
3 Counting and Sampling from Substructures Using Linear Algebraic Queries Bishnu, Arijit et al. 2022
4 Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing Chakraborty, Sourav et al. 2022
5 Faster Counting and Sampling Algorithms Using Colorful Decision Oracle Bhattacharya, Anup et al. 2022
6 Tolerant Bipartiteness Testing in Dense Graphs Ghosh, Arijit et al. 2022
7 Distance Estimation Between Unknown Matrices Using Sublinear Projections on Hamming Cube Bishnu, Arijit et al. 2021
8 Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! Bhattacharya, Anup et al. 2021
9 Interplay Between Graph Isomorphism and Earth Mover’s Distance in the Query and Communication Worlds Chakraborty, Sourav et al. 2021
10 Query Complexity of Global Minimum Cut Bishnu, Arijit et al. 2021
11 Disjointness Through the Lens of Vapnik–Chervonenkis Dimension: Sparsity and Beyond Bhattacharya, Anup et al. 2020
12 Triangle Estimation Using Tripartite Independent Set Queries Bhattacharya, Anup et al. 2019
13 FPT Algorithms for Embedding into Low Complexity Graphic Metrics Ghosh, Arijit et al. 2018
14 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: 14

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI