default search action
Sardar Anisul Haque
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j3]Sardar Anisul Haque, Mohammad Tanvir Parvez, Shahadat Hossain:
GPU Algorithms for Structured Sparse Matrix Multiplication with Diagonal Storage Schemes. Algorithms 17(1): 31 (2024) - 2023
- [c9]Sardar Anisul Haque
, Nazim Choudhury
Matrix Multiplication with Diagonals: Structured Sparse Matrices and Beyond. HP3C 2023: 69-76 - [c8]Sardar Anisul Haque, Ali Jaoua, Jihad Mohamad Al Ja'am, Hafeez Ur Rehman:
Reducing a 3-SAT Instance to a Set of 2-SAT Instances Using the Idea of Set Covering Problem. ICCA 2023: 1-3 - 2022
- [c7]Shamsed Mahmud, Sardar Anisul Haque, Nazim Choudhury:
Improving counting sort algorithm via data locality. ACM Southeast Regional Conference 2022: 211-214
2010 – 2019
- 2018
- [c6]Mohammad Tanvir Parvez, Sardar Anisul Haque
Multi-Perspective Multi-Modal Trajectory Descriptions for Handwritten Strokes. ICFHR 2018: 285-290 - 2017
- [j2]Sardar Anisul Haque, X. Li, Farnam Mansouri, Marc Moreno Maza, Davood Mohajerani, Wei Pan:
CUMODP: a CUDA library for modular polynomial computation. ACM Commun. Comput. Algebra 51(3): 89-91 (2017) - [c5]Sardar Anisul Haque
Plain, and Somehow Sparse, Univariate Polynomial Division on Graphics Processing Units. PASCO@ISSAC 2017: 10:1-10:10 - 2015
- [c4]Sardar Anisul Haque
A Many-Core Machine Model for Designing Algorithms with Minimum Parallelism Overheads. PARCO 2015: 35-44 - 2014
- [c3]Sardar Anisul Haque
On the Parallelization of Subproduct Tree Techniques Targeting Many-Core Architectures. CASC 2014: 171-185 - [c2]Sardar Anisul Haque
Dense Arithmetic over Finite Fields with the CUMODP Library. ICMS 2014: 725-732 - [i1]Sardar Anisul Haque, Marc Moreno Maza, Ning Xie:
A Many-core Machine Model for Designing Algorithms with Minimum Parallelism Overheads. CoRR abs/1402.0264 (2014) - 2010
- [j1]Sardar Anisul Haque, Shahadat Hossain, Marc Moreno Maza:
Cache friendly sparse matrix-vector multiplication. ACM Commun. Comput. Algebra 44(3/4): 111-112 (2010) - [c1]Sardar Anisul Haque
Cache friendly sparse matrix-vector multiplication. PASCO 2010: 175-176
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-04-25 05:57 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: