Get started
Author

Gopinath Mishra

Hyperedge Estimation using Polylogarithmic Subset Queries
2019 · Bhattacharya, Anup, Bishnu, Arijit, et al. · arXiv (Cornell University) · 14
PDF
On Triangle Estimation Using Tripartite Independent Set Queries
2021 · Anup Bhattacharya, Arijit Bishnu, et al. · Theory of Computing Systems · 11
Parallel Derandomization for Coloring*
2024 · Sam Coy, Artur Czumaj, et al. · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · 9
On Parallel k-Center Clustering
2023 · Sam Coy, Artur Czumaj, et al. · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · 9
PDF
Improved Algorithms for the Evacuation Route Planning Problem
2015 · Gopinath Mishra, Subhra Mazumdar, et al. · Lecture notes in computer science · 9
Triangle Estimation Using Tripartite Independent Set Queries
2019 · Bhattacharya, Anup, Bishnu, Arijit, et al. · arXiv (Cornell University) · 8
PDF
Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!
2020 · Bhattacharya, Anup, Bishnu, Arijit, et al. · arXiv (Cornell University) · 7
PDF
Efficiently Sampling and Estimating from Substructures using Linear Algebraic Queries
2019 · Bishnu, Arijit, Ghosh, Arijit, et al. · arXiv (Cornell University) · 7
PDF
Optimal (degree+1)-Coloring in Congested Clique
2026 · Sam Coy, Artur Czumaj, et al. · SIAM Journal on Computing · 6
Arboricity Matters in Triangle Counting with Random Edges
2025 · Bishnu, Arijit, Chanda, Debarshi, et al. · arXiv (Cornell University) · 6
PDF
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
2024 · Yi-Jun Chang, Gopinath Mishra, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 6
Parameterized Query Complexity of Hitting Set Using Stability of Sunflowers
2018 · Bishnu, Arijit, Ghosh, Arijit, et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 6
PDF
Improved algorithms for the evacuation route planning problem
2016 · Gopinath Mishra, Subhra Mazumdar, et al. · Journal of Combinatorial Optimization · 6
PDF
Faster Counting and Sampling Algorithms using Colorful Decision Oracle
2024 · Anup Bhattacharya, Arijit Bishnu, et al. · ACM Transactions on Computation Theory · 5
PDF
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing
2021 · Chakraborty, Sourav, Fischer, Eldar, et al. · Warwick Research Archive Portal (University of Warwick) · 5
PDF
On the streaming complexity of fundamental geometric problems
2018 · Bishnu, Arijit, Ghosh, Arijit, et al. · arXiv (Cornell University) · 5
PDF
Testing of Index-Invariant Properties in the Huge Object Model
2022 · Chakraborty, Sourav, Fischer, Eldar, et al. · Warwick Research Archive Portal (University of Warwick) · 4
PDF
Query Complexity of Global Minimum Cut
2020 · Bishnu, Arijit, Ghosh, Arijit, et al. · arXiv (Cornell University) · 4
PDF
Counting and Sampling from Substructures Using Linear Algebraic Queries
2022 · Bishnu, Arijit, Ghosh, Arijit, et al. · Warwick Research Archive Portal (University of Warwick) · 3
PDF
Fixed Parameter Tractability of Graph Deletion Problems over Data Streams
2020 · Arijit Bishnu, Arijit Ghosh, et al. · Lecture notes in computer science · 3
Triangle Estimation using Polylogarithmic Queries.
2018 · Anup Bhattacharya, Arijit Bishnu, et al. · arXiv (Cornell University) · 3
On Parallel k -Center Clustering
2026 · Sam Coy, Artur Czumaj, et al. · ACM Transactions on Algorithms · 2
Optimal non-adaptive algorithm for edge estimation
2025 · Bishnu, Arijit, Chanda, Debarshi, et al. · arXiv (Cornell University) · 2
PDF
Round and Communication Efficient Graph Coloring
2025 · Yi-Jun Chang, Gopinath Mishra, et al. · ACM Symposium on Principles of Distributed Computing (PODC) · 2
PDF
Exploring the Gap Between Tolerant and Non-Tolerant Distribution Testing
2024 · Sourav Chakraborty, Eldar Fischer, et al. · IEEE Transactions on Information Theory · 2
Works count: 58
Citation count: 164
H-index: 7
I10-index: 2
Year
Topic
Type