Use of SIMD Features to Speed up Eta Pairing. - Anup Kumar Bhattacharya; Sabyasachi Karati; Abhijit Das 004; Dipanwita Roy Chowdhury; Bhargav Bellur; Aravind Iyer (ICETE (Selected Papers), 2012)

Autonomous Certification with List-Based Revocation for Secure V2V Communication. - Anup Kumar Bhattacharya; Abhijit Das 004; Dipanwita Roy Chowdhury; Aravind Iyer; Debojyoti Bhattacharya (ICISS, 2012)

SIMD-based Implementations of Eta Pairing Over Finite Fields of Small Characteristics. - Anup Kumar Bhattacharya; Abhijit Das 004; Dipanwita Roy Chowdhury; Bhargav Bellur; Aravind Iyer (SECRYPT, 2012)

GPU-Based Implementation of 128-Bit Secure Eta Pairing over a Binary Field. - Utsab Bose; Anup Kumar Bhattacharya; Abhijit Das 004 (AFRICACRYPT, 2013)

A Tight Lower Bound Instance for k-means++ in Constant Dimension. - Anup Bhattacharya; Ragesh Jaiswal; Nir Ailon (TAMC, 2014)

Tight lower bound instances for k-means++ in two dimensions. - Anup Bhattacharya; Ragesh Jaiswal; Nir Ailon (Theor. Comput. Sci., 2016)

On the k-Means/Median Cost Function. - Anup Bhattacharya; Ragesh Jaiswal (CoRR, 2017)

Approximate Clustering with Same-Cluster Queries. - Nir Ailon; Anup Bhattacharya; Ragesh Jaiswal; Amit Kumar 001 (ITCS, 2018)

Approximate Correlation Clustering Using Same-Cluster Queries. - Nir Ailon; Anup Bhattacharya; Ragesh Jaiswal (LATIN, 2018)

Sampling in Space Restricted Settings. - Anup Bhattacharya; Davis Issac; Ragesh Jaiswal; Amit Kumar 001 (Algorithmica, 2018)

Triangle Estimation using Polylogarithmic Queries. - Anup Bhattacharya; Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (CoRR, 2018)

Faster Algorithms for the Constrained k-means Problem. - Anup Bhattacharya; Ragesh Jaiswal; Amit Kumar 001 (Theory Comput. Syst., 2018)

Hyperedge Estimation using Polylogarithmic Subset Queries. - Anup Bhattacharya; Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (CoRR, 2019)

Streaming PTAS for Binary 𝓁0-Low Rank Approximation. - Anup Bhattacharya; Dishant Goyal; Ragesh Jaiswal; Amit Kumar 001 (CoRR, 2019)

Noisy, Greedy and Not so Greedy k-Means++. - Anup Bhattacharya; Jan Eube; Heiko Röglin; Melanie Schmidt 001 (ESA, 2020)

On Sampling Based Algorithms for k-Means. - Anup Bhattacharya; Dishant Goyal; Ragesh Jaiswal; Amit Kumar 001 (FSTTCS, 2020)

Comparison of data storage and analysis throughput in the light of high energy physics experiment MACE. - Debangana Sarkar; Mahesh Punna; Padmini S.; Nilesh Chouhan; Chinmay Borwankar; Anup Kumar Bhattacharya; A. K. Tickoo; R. C. Rannot (Astron. Comput., 2020)

Hardness of Approximation for Euclidean k-Median. - Anup Bhattacharya; Dishant Goyal; Ragesh Jaiswal (APPROX-RANDOM, 2021)

Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! - Anup Bhattacharya; Arijit Bishnu; Gopinath Mishra; Anannya Upasana (ITCS, 2021)

On Triangle Estimation Using Tripartite Independent Set Queries. - Anup Bhattacharya; Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (Theory Comput. Syst., 2021)

Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. - Anup Bhattacharya; Sourav Chakraborty 001; Arijit Ghosh; Gopinath Mishra; Manaswi Paraashar (Comput. Complex., 2022)

On the k-means/median cost function. - Anup Bhattacharya; Yoav Freund; Ragesh Jaiswal (Inf. Process. Lett., 2022)

Faster Counting and Sampling Algorithms using Colorful Decision Oracle. - Anup Bhattacharya; Arijit Bishnu; Arijit Ghosh; Gopinath Mishra (ACM Trans. Comput. Theory, 2024)

Improved Sublinear-Time Moment Estimation Using Weighted Sampling. - Anup Bhattacharya; Pinki Pradhan (CIAC (1), 2025)