default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMd. Mazder Rahman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[c12]Gerhard W. Dueck, Anirban Pathak
, Md. Mazder Rahman, Abhishek Shukla, Anindita Banerjee:
Optimization of Circuits for IBM's Five-Qubit Quantum Computers. DSD 2018: 680-684- [i2]Gerhard W. Dueck, Anirban Pathak, Md. Mazder Rahman, Abhishek Shukla, Anindita Banerjee:
Optimization of Circuits for IBM's five-qubit Quantum Computers. CoRR abs/1810.00129 (2018) - 2016
- [j2]Konstantin Nasartschuk, Marcel Dombrowski, Tristan Basa, Md. Mazder Rahman, Kenneth B. Kent, Gerhard W. Dueck:
GarCoSim: A Framework for Automated Memory Management Research and Evaluation. EAI Endorsed Trans. Scalable Inf. Syst. 3(9): e4 (2016) - [c11]Mathias Soeken, Gerhard W. Dueck, Md. Mazder Rahman, D. Michael Miller:
An extension of transformation-based reversible and quantum circuit synthesis. ISCAS 2016: 2290-2293 - [c10]Md. Mazder Rahman, Gerhard W. Dueck, Anupam Chattopadhyay, Robert Wille:
Integrated Synthesis of Linear Nearest Neighbor Ancilla-Free MCT Circuits. ISMVL 2016: 144-149 - [c9]Md. Mazder Rahman, Konstantin Nasartschuk, Kenneth B. Kent, Gerhard W. Dueck:
Trace Files for Automatic Memory Management Systems. VST@SANER 2016: 9-12 - 2015
- [c8]Md. Mazder Rahman, Mathias Soeken, Gerhard W. Dueck:
Dynamic Template Matching with Mixed-Polarity Toffoli Gates. ISMVL 2015: 72-77 - [i1]Md. Mazder Rahman, Gerhard W. Dueck:
Synthesis of Linear Nearest Neighbor Quantum Circuits. CoRR abs/1508.05430 (2015) - 2014
- [j1]Md. Mazder Rahman, Gerhard W. Dueck, Joseph D. Horton:
An Algorithm for Quantum Template Matching. ACM J. Emerg. Technol. Comput. Syst. 11(3): 31:1-31:20 (2014) - 2012
- [c7]Md. Mazder Rahman, Gerhard W. Dueck:
An algorithm to find quantum templates. IEEE Congress on Evolutionary Computation 2012: 1-7 - [c6]Md. Mazder Rahman, Gerhard W. Dueck:
Optimal Quantum Circuits of Three Qubits. ISMVL 2012: 161-166 - [c5]Md. Mazder Rahman, Gerhard W. Dueck:
Properties of Quantum Templates. RC 2012: 125-137 - 2011
- [c4]Md. Mazder Rahman, Anindita Banerjee, Gerhard W. Dueck, Anirban Pathak:
Two-Qubit Quantum Gates to Reduce the Quantum Cost of Reversible Circuit. ISMVL 2011: 86-92 - [c3]Md. Mazder Rahman, Gerhard W. Dueck, Anindita Banerjee:
Optimization of Reversible Circuits Using Reconfigured Templates. RC 2011: 43-53
2000 – 2009
- 2004
- [c2]Hafiz Md. Hasan Babu, Moinul Islam Zaber, Md. Mazder Rahman, Md. Rafiqul Islam:
Implementation of Multiple-Valued Flip-Flips Using Pass Transistor Logic. DSD 2004: 603-606 - [c1]Hafiz Md. Hasan Babu, Moinul Islam Zaber, Md. Rafiqul Islam, Md. Mazder Rahman:
On the Minimization of Multiple-Valued Input Binary-Valued Output Functions. ISMVL 2004: 321-326
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 2025-01-21 00:05 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:
