Anup Bhattacharya

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Even the easiest(?) Graph coloring problem is not easy in streaming!	2026-04-15	Paper
On sampling based algorithms for k-means	2026-03-23	Paper
Improved sublinear-time moment estimation using weighted sampling	2025-11-11	Paper
Faster counting and sampling algorithms using colorful decision oracle ACM Transactions on Computation Theory	2025-07-22	Paper
Faster counting and sampling algorithms using colorful decision oracle	2024-04-23	Paper
Hardness of approximation for Euclidean \(k\)-median (available as arXiv preprint)	2023-11-20	Paper
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond	2023-10-31	Paper
Noisy, Greedy and Not so Greedy k-Means++ (available as arXiv preprint)	2023-02-07	Paper
Triangle Estimation Using Tripartite Independent Set Queries.	2023-02-03	Paper
Disjointness through the lens of Vapnik-Chervonenkis dimension: sparsity and beyond Computational Complexity	2022-08-01	Paper
On the \(k\)-means/median cost function Information Processing Letters	2022-06-03	Paper
On triangle estimation using tripartite independent set queries Theory of Computing Systems	2021-12-18	Paper
On triangle estimation using tripartite independent set queries Theory of Computing Systems	2021-12-18	Paper
Approximate Clustering with Same-Cluster Queries (available as arXiv preprint)	2021-06-15	Paper
Approximate correlation clustering using same-cluster queries (available as arXiv preprint)	2020-02-12	Paper
Sampling in space restricted settings Algorithmica	2018-05-18	Paper
Faster algorithms for the constrained k-means problem Theory of Computing Systems	2018-03-01	Paper
Faster algorithms for the constrained \(k\)-means problem (available as arXiv preprint)	2018-01-24	Paper
Tight lower bound instances for k-means++ in two dimensions Theoretical Computer Science	2016-05-18	Paper
Sampling in space restricted settings Lecture Notes in Computer Science	2015-10-29	Paper
A tight lower bound instance for k-means++ in constant dimension Lecture Notes in Computer Science	2014-04-16	Paper
GPU-based implementation of 128-bit secure eta pairing over a binary field Progress in Cryptology – AFRICACRYPT 2013	2013-06-07	Paper

Research outcomes over time

This page was built for person: Anup Bhattacharya