Anup Bhattacharya

According to our database1, Anup Bhattacharya authored at least 23 papers between 2012 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On the <i>k</i>-means/median cost function.
Inf. Process. Lett., 2022

Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond.
Comput. Complex., 2022

Faster Counting and Sampling Algorithms Using Colorful Decision Oracle.
Proceedings of the 39th International Symposium on Theoretical Aspects of Computer Science, 2022

2021
On Triangle Estimation Using Tripartite Independent Set Queries.
Theory Comput. Syst., 2021

Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming!
Proceedings of the 12th Innovations in Theoretical Computer Science Conference, 2021

Hardness of Approximation for Euclidean k-Median.
Proceedings of the Approximation, 2021

2020
Comparison of data storage and analysis throughput in the light of high energy physics experiment MACE.
Astron. Comput., 2020

On Sampling Based Algorithms for k-Means.
Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

Noisy, Greedy and Not so Greedy k-Means++.
Proceedings of the 28th Annual European Symposium on Algorithms, 2020

2019
Streaming PTAS for Binary 𝓁<sub>0</sub>-Low Rank Approximation.
CoRR, 2019

Hyperedge Estimation using Polylogarithmic Subset Queries.
CoRR, 2019

2018
Faster Algorithms for the Constrained k-means Problem.
Theory Comput. Syst., 2018

Triangle Estimation using Polylogarithmic Queries.
CoRR, 2018

Sampling in Space Restricted Settings.
Algorithmica, 2018

Approximate Correlation Clustering Using Same-Cluster Queries.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Approximate Clustering with Same-Cluster Queries.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
On the k-Means/Median Cost Function.
CoRR, 2017

2016
Tight lower bound instances for k-means++ in two dimensions.
Theor. Comput. Sci., 2016

2014
A Tight Lower Bound Instance for k-means++ in Constant Dimension.
Proceedings of the Theory and Applications of Models of Computation, 2014

2013
GPU-Based Implementation of 128-Bit Secure Eta Pairing over a Binary Field.
Proceedings of the Progress in Cryptology, 2013

2012
SIMD-based Implementations of Eta Pairing Over Finite Fields of Small Characteristics.
Proceedings of the SECRYPT 2012, 2012

Autonomous Certification with List-Based Revocation for Secure V2V Communication.
Proceedings of the Information Systems Security, 8th International Conference, 2012

Use of SIMD Features to Speed up Eta Pairing.
Proceedings of the E-Business and Telecommunications - International Joint Conference, 2012


  Loading...