default search action
Zafar Ahmad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Zafar Ahmad, Muhammad Salman Khan, Muhammad E. H. Chowdhury, Susu M. Zughaier, Wanis Hamad Ibrahim:
Phonocardiogram Classification Based on 1D CNN with Pitch-Shifting and Signal Uniformity Techniques. EUSIPCO 2024: 1536-1540 - [c11]Zafar Ahmad
, Reilly Browne
Fast American Option Pricing using Nonlinear Stencils. PPoPP 2024: 316-332 - 2023
- [j1]Zafar Ahmad
A Fast Algorithm for Aperiodic Linear Stencil Computation using Fast Fourier Transforms. ACM Trans. Parallel Comput. 10(4): 22:1-22:34 (2023) - [i3]Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Yushen Huang, Yimin Zhu
Fast Option Pricing using Nonlinear Stencils. CoRR abs/2303.02317 (2023) - 2022
- [c10]Zafar Ahmad, Mohammad Mahdi Javanmard, Gregory Thomas Croisdale
FOURST: A code generator for FFT-based fast stencil computations. ISPASS 2022: 99-108 - [c9]Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu
Brief Announcement: Faster Stencil Computations using Gaussian Approximations. SPAA 2022: 291-293 - 2021
- [c8]Poornima Nookala
Understanding Recursive Divide-and-Conquer Dynamic Programs in Fork-Join and Data-Flow Execution Models. IPDPS Workshops 2021: 407-416 - [c7]Zafar Ahmad
Fast Stencil Computations using Fast Fourier Transforms. SPAA 2021: 8-21 - [c6]Zafar Ahmad
Low-Span Parallel Algorithms for the Binary-Forking Model. SPAA 2021: 22-34 - [i2]Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Yimin Zhu:
Fast Stencil Computations using Fast Fourier Transforms. CoRR abs/2105.06676 (2021) - 2020
- [c5]Mohammad Mahdi Javanmard, Zafar Ahmad
Deriving parametric multi-way recursive divide-and-conquer dynamic programming algorithms using polyhedral compilers. CGO 2020: 317-329 - [c4]Mohammad Mahdi Javanmard, Zafar Ahmad
Efficient Execution of Dynamic Programming Algorithms on Apache Spark. CLUSTER 2020: 337-348 - [c3]Zafar Ahmad
Improved MapReduce Load Balancing through Distribution-Dependent Hash Function Optimization. ICPADS 2020: 9-18 - [i1]Zafar Ahmad, Rezaul Chowdhury, Rathish Das, Pramod Ganapathi, Aaron Gregory, Mohammad Mahdi Javanmard:
Low-Depth Parallel Algorithms for the Binary-Forking Model without Atomics. CoRR abs/2008.13292 (2020)
2010 – 2019
- 2019
- [c2]Mohammad Mahdi Javanmard, Pramod Ganapathi, Rathish Das, Zafar Ahmad, Stephen L. Tschudi, Rezaul Chowdhury:
Toward efficient architecture-independent algorithms for dynamic programs: poster. PPoPP 2019: 413-414 - [c1]Mohammad Mahdi Javanmard, Pramod Ganapathi, Rathish Das, Zafar Ahmad
Toward Efficient Architecture-Independent Algorithms for Dynamic Programs. ISC 2019: 143-164
Coauthor Index
aka: Rezaul Chowdhury
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-11-07 21:32 CET 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: