Folgen
Gopinath Mishra
Gopinath Mishra
Post Doctoral Fellow
Bestätigte E-Mail-Adresse bei nus.edu.sg - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Improved algorithms for the evacuation route planning problem
G Mishra, S Mazumdar, A Pal
Combinatorial Optimization and Applications: 9th International Conference …, 2015
182015
On triangle estimation using tripartite independent set queries
A Bhattacharya, A Bishnu, A Ghosh, G Mishra
Theory of Computing Systems 65 (8), 1165-1192, 2021
132021
Methods and systems for planning evacuation paths
A Pal, G Mishra, S Mazumdar
US Patent 9,972,176, 2018
132018
Parameterized query complexity of hitting set using stability of sunflowers
A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh
29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018
122018
Hyperedge estimation using polylogarithmic subset queries
A Bhattacharya, A Bishnu, A Ghosh, G Mishra
arXiv preprint arXiv:1908.04196, 2019
102019
Faster counting and sampling algorithms using colorful decision oracle
A Bhattacharya, A Bishnu, A Ghosh, G Mishra
arXiv preprint arXiv:2201.04975, 2022
72022
Testing of index-invariant properties in the huge object model
S Chakraborty, E Fischer, A Ghosh, G Mishra, S Sen
The Thirty Sixth Annual Conference on Learning Theory, 3065-3136, 2023
62023
Triangle estimation using polylogarithmic queries
A Bhattacharya, A Bishnu, A Ghosh, G Mishra
CoRR, abs/1808.00691, 2018
62018
Even the Easiest (?) Graph Coloring Problem Is Not Easy in Streaming!
A Bhattacharya, A Bishnu, G Mishra, A Upasana
arXiv preprint arXiv:2010.13143, 2020
52020
Query complexity of global minimum cut
A Bishnu, A Ghosh, G Mishra, M Paraashar
arXiv preprint arXiv:2007.09202, 2020
52020
On the streaming complexity of fundamental geometric problems
A Bishnu, A Ghosh, G Mishra, S Sen
arXiv preprint arXiv:1803.06875, 2018
52018
Exploring the gap between tolerant and non-tolerant distribution testing
S Chakraborty, E Fischer, A Ghosh, G Mishra, S Sen
arXiv preprint arXiv:2110.09972, 2021
32021
Distance estimation between unknown matrices using sublinear projections on Hamming cube
A Bishnu, A Ghosh, G Mishra
arXiv preprint arXiv:2107.02666, 2021
32021
Fixed parameter tractability of graph deletion problems over data streams
A Bishnu, A Ghosh, S Kolay, G Mishra, S Saurabh
International Computing and Combinatorics Conference, 652-663, 2020
32020
Efficiently sampling and estimating from substructures using linear algebraic queries
A Bishnu, A Ghosh, G Mishra, M Paraashar
arXiv preprint arXiv:1906.07398, 2019
32019
Grid obstacle representation of graphs
A Bishnu, A Ghosh, R Mathew, G Mishra, S Paul
arXiv preprint arXiv:1708.01765, 2017
32017
On parallel k-center clustering
S Coy, A Czumaj, G Mishra
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023
22023
Fast parallel degree+ 1 list coloring
S Coy, A Czumaj, P Davies, G Mishra
arXiv preprint arXiv:2302.04378, 2023
22023
Tolerant bipartiteness testing in dense graphs
A Ghosh, G Mishra, R Raychaudhury, S Sen
arXiv preprint arXiv:2204.12397, 2022
22022
Disjointness through the lens of vapnik-chervonenkis dimension: Sparsity and beyond
A Bhattacharya, S Chakraborty, A Ghosh, G Mishra, M Paraashar
arXiv preprint arXiv:2006.13712, 2020
22020
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20