default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnup Bhattacharya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j8]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra
:
Faster Counting and Sampling Algorithms using Colorful Decision Oracle. ACM Trans. Comput. Theory 16(2): 12:1-12:19 (2024)- 2022
- [j7]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Comput. Complex. 31(2): 9 (2022) - [j6]Anup Bhattacharya, Yoav Freund, Ragesh Jaiswal:
On the k-means/median cost function. Inf. Process. Lett. 177: 106252 (2022) - [c16]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Faster Counting and Sampling Algorithms Using Colorful Decision Oracle. STACS 2022: 10:1-10:16 - [i15]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Faster Counting and Sampling Algorithms using Colorful Decision Oracle. CoRR abs/2201.04975 (2022) - 2021
- [j5]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
On Triangle Estimation Using Tripartite Independent Set Queries. Theory Comput. Syst. 65(8): 1165-1192 (2021) - [c15]Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal:
Hardness of Approximation for Euclidean k-Median. APPROX-RANDOM 2021: 4:1-4:23 - [c14]Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana:
Even the Easiest(?) Graph Coloring Problem Is Not Easy in Streaming! ITCS 2021: 15:1-15:19 - 2020
- [j4]Debangana Sarkar, Mahesh Punna, Padmini S., Nilesh Chouhan, Chinmay Borwankar, Anup Kumar Bhattacharya, A. K. Tickoo, R. C. Rannot:
Comparison of data storage and analysis throughput in the light of high energy physics experiment MACE. Astron. Comput. 33: 100409 (2020) - [c13]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness Through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. APPROX-RANDOM 2020: 23:1-23:15 - [c12]Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not so Greedy k-Means++. ESA 2020: 18:1-18:21 - [c11]Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
On Sampling Based Algorithms for k-Means. FSTTCS 2020: 13:1-13:17 - [i14]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. CoRR abs/2006.13712 (2020) - [i13]Anup Bhattacharya, Arijit Bishnu, Gopinath Mishra, Anannya Upasana:
Even the Easiest(?) Graph Coloring Problem is not Easy in Streaming! CoRR abs/2010.13143 (2020) - [i12]Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal:
Hardness of Approximation of Euclidean k-Median. CoRR abs/2011.04221 (2020) - [i11]Anup Bhattacharya, Sourav Chakraborty, Arijit Ghosh, Gopinath Mishra, Manaswi Paraashar:
Disjointness through the Lens of Vapnik-Chervonenkis Dimension: Sparsity and Beyond. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c10]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Triangle Estimation Using Tripartite Independent Set Queries. ISAAC 2019: 19:1-19:17 - [i10]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Hyperedge Estimation using Polylogarithmic Subset Queries. CoRR abs/1908.04196 (2019) - [i9]Anup Bhattacharya, Dishant Goyal, Ragesh Jaiswal, Amit Kumar:
Streaming PTAS for Binary 𝓁0-Low Rank Approximation. CoRR abs/1909.11744 (2019) - [i8]Anup Bhattacharya, Jan Eube, Heiko Röglin, Melanie Schmidt:
Noisy, Greedy and Not So Greedy k-means++. CoRR abs/1912.00653 (2019) - 2018
- [j3]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. Algorithmica 80(5): 1439-1458 (2018) - [j2]Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Faster Algorithms for the Constrained k-means Problem. Theory Comput. Syst. 62(1): 93-115 (2018) - [c9]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Approximate Clustering with Same-Cluster Queries. ITCS 2018: 40:1-40:21 - [c8]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal:
Approximate Correlation Clustering Using Same-Cluster Queries. LATIN 2018: 14-27 - [i7]Anup Bhattacharya, Arijit Bishnu, Arijit Ghosh, Gopinath Mishra:
Triangle Estimation using Polylogarithmic Queries. CoRR abs/1808.00691 (2018) - 2017
- [i6]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Approximate Clustering with Same-Cluster Queries. CoRR abs/1704.01862 (2017) - [i5]Anup Bhattacharya, Ragesh Jaiswal:
On the k-Means/Median Cost Function. CoRR abs/1704.05232 (2017) - [i4]Nir Ailon, Anup Bhattacharya, Ragesh Jaiswal:
Approximate Correlation Clustering Using Same-Cluster Queries. CoRR abs/1712.06865 (2017) - 2016
- [j1]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
Tight lower bound instances for k-means++ in two dimensions. Theor. Comput. Sci. 634: 55-66 (2016) - [c7]Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Faster Algorithms for the Constrained k-Means Problem. STACS 2016: 16:1-16:13 - 2015
- [c6]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. COCOON 2015: 483-494 - [i3]Anup Bhattacharya, Ragesh Jaiswal, Amit Kumar:
Faster Algorithms for the Constrained k-means Problem. CoRR abs/1504.02564 (2015) - 2014
- [c5]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
A Tight Lower Bound Instance for k-means++ in Constant Dimension. TAMC 2014: 7-22 - [i2]Anup Bhattacharya, Ragesh Jaiswal, Nir Ailon:
A tight lower bound instance for k-means++ in constant dimension. CoRR abs/1401.2912 (2014) - [i1]Anup Bhattacharya, Davis Issac, Ragesh Jaiswal, Amit Kumar:
Sampling in Space Restricted Settings. CoRR abs/1407.1689 (2014) - 2013
- [c4]Utsab Bose, Anup Kumar Bhattacharya, Abhijit Das:
GPU-Based Implementation of 128-Bit Secure Eta Pairing over a Binary Field. AFRICACRYPT 2013: 26-42 - 2012
- [c3]Anup Kumar Bhattacharya, Sabyasachi Karati, Abhijit Das, Dipanwita Roy Chowdhury, Bhargav Bellur, Aravind Iyer:
Use of SIMD Features to Speed up Eta Pairing. ICETE (Selected Papers) 2012: 137-154 - [c2]Anup Kumar Bhattacharya, Abhijit Das, Dipanwita Roy Chowdhury, Aravind Iyer, Debojyoti Bhattacharya:
Autonomous Certification with List-Based Revocation for Secure V2V Communication. ICISS 2012: 208-222 - [c1]Anup Kumar Bhattacharya, Abhijit Das, Dipanwita Roy Chowdhury, Bhargav Bellur, Aravind Iyer:
SIMD-based Implementations of Eta Pairing Over Finite Fields of Small Characteristics. SECRYPT 2012: 94-101
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-09 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
