default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlwin Zulehner
Person information
- affiliation: Johannes Kepler University Linz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[c25]Stefan Hillmich
, Alwin Zulehner, Robert Wille:
Exploiting Quantum Teleportation in Quantum Circuit Mapping. ASP-DAC 2021: 792-797- 2020
- [j8]Phrangboklang Lyngton Thangkhiew, Alwin Zulehner, Robert Wille, Kamalika Datta, Indranil Sengupta:
An efficient memristor crossbar architecture for mapping Boolean functions using Binary Decision Diagrams (BDD). Integr. 71: 125-133 (2020) - [j7]Philipp Niemann, Alwin Zulehner, Rolf Drechsler, Robert Wille:
Overcoming the Tradeoff Between Accuracy and Compactness in Decision Diagrams for Quantum Computation. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 39(12): 4657-4668 (2020) - [j6]Xiaotong Cui, Samah Mohamed Saeed, Alwin Zulehner, Robert Wille, Kaijie Wu, Rolf Drechsler, Ramesh Karri:
On the Difficulty of Inserting Trojans in Reversible Computing Architectures. IEEE Trans. Emerg. Top. Comput. 8(4): 960-972 (2020) - [c24]Stefan Hillmich, Alwin Zulehner, Robert Wille:
Concurrency in DD-based Quantum Circuit Simulation. ASP-DAC 2020: 115-120 - [c23]Alwin Zulehner, Stefan Hillmich, Igor L. Markov, Robert Wille:
Approximation of Quantum States Using Decision Diagrams. ASP-DAC 2020: 121-126 - [p2]Alwin Zulehner, Robert Wille:
Simulation and Design of Quantum Circuits. Selected Results of the COST Action IC1405 2020: 60-82
2010 – 2019
- 2019
- [j5]Samah Mohamed Saeed, Nithin Mahendran, Alwin Zulehner, Robert Wille, Ramesh Karri:
Identification of Synthesis Approaches for IP/IC Piracy of Reversible Circuits. ACM J. Emerg. Technol. Comput. Syst. 15(3): 23:1-23:17 (2019) - [j4]Alwin Zulehner, Robert Wille:
Advanced Simulation of Quantum Computations. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(5): 848-859 (2019) - [j3]Alwin Zulehner, Alexandru Paler, Robert Wille:
An Efficient Methodology for Mapping Quantum Circuits to the IBM QX Architectures. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 38(7): 1226-1236 (2019) - [j2]Samah Mohamed Saeed, Alwin Zulehner, Robert Wille, Rolf Drechsler, Ramesh Karri:
Reversible Circuits: IC/IP Piracy Attacks and Countermeasures. IEEE Trans. Very Large Scale Integr. Syst. 27(11): 2523-2535 (2019) - [c22]Alwin Zulehner, Robert Wille:
Compiling SU(4) quantum circuits to IBM QX architectures. ASP-DAC 2019: 185-190 - [c21]Alwin Zulehner, Kamalika Datta, Indranil Sengupta, Robert Wille:
A staircase structure for scalable and efficient synthesis of memristor-aided logic. ASP-DAC 2019: 237-242 - [c20]Alwin Zulehner, Michael P. Frank, Robert Wille:
Design automation for adiabatic circuits. ASP-DAC 2019: 669-674 - [c19]Robert Wille, Lukas Burgholzer, Alwin Zulehner:
Mapping Quantum Circuits to IBM QX Architectures Using the Minimal Number of SWAP and H Operations. DAC 2019: 142 - [c18]Alwin Zulehner, Robert Wille:
Matrix-Vector vs. Matrix-Matrix Multiplication: Potential in DD-based Simulation of Quantum Computations. DATE 2019: 90-95 - [c17]Alwin Zulehner, Philipp Niemann, Rolf Drechsler, Robert Wille:
Accuracy and Compactness in Decision Diagrams for Quantum Computation. DATE 2019: 280-283 - [c16]Alwin Zulehner, Stefan Hillmich, Robert Wille:
How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing. ICCAD 2019: 1-7 - [c15]Alwin Zulehner, Philipp Niemann, Rolf Drechsler, Robert Wille:
One Additional Qubit is Enough: Encoded Embeddings for Boolean Components in Quantum Circuits. ISMVL 2019: 1-6 - [c14]Alwin Zulehner, Hartwig Bauer, Robert Wille:
Evaluating the Flexibility of A* for Mapping Quantum Circuits. RC 2019: 171-190 - [p1]Alwin Zulehner:
Entwurfsautomatisierung für Quantencomputer. Ausgezeichnete Informatikdissertationen 2019: 249-258 - [i7]Alwin Zulehner, Philipp Niemann, Rolf Drechsler, Robert Wille:
One Additional Qubit is Enough: Encoded Embeddings for Boolean Components in Quantum Circuits. CoRR abs/1906.02352 (2019) - [i6]Alwin Zulehner, Stefan Hillmich, Robert Wille:
How to Efficiently Handle Complex Values? Implementing Decision Diagrams for Quantum Computing. CoRR abs/1911.12691 (2019) - 2018
- [j1]Alwin Zulehner, Robert Wille:
One-Pass Design of Reversible Circuits: Combining Embedding and Synthesis for Reversible Logic. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 37(5): 996-1008 (2018) - [c13]Alwin Zulehner, Robert Wille:
Exploiting coding techniques for logic synthesis of reversible circuits. ASP-DAC 2018: 670-675 - [c12]Alwin Zulehner, Alexandru Paler, Robert Wille:
Efficient mapping of quantum circuits to the IBM QX architectures. DATE 2018: 1135-1138 - [c11]Alwin Zulehner, Robert Wille:
Pushing the number of qubits below the "minimum": Realizing compact boolean components for quantum logic. DATE 2018: 1179-1182 - [c10]Samah Mohamed Saeed, Xiaotong Cui, Alwin Zulehner, Robert Wille, Rolf Drechsler, Kaijie Wu, Ramesh Karri:
IC/IP piracy assessment of reversible logic. ICCAD 2018: 5 - [c9]Alwin Zulehner, P. Mercy Nesa Rani, Kamalika Datta, Indranil Sengupta, Robert Wille:
Generalizing the Concept of Scalable Reversible Circuit Synthesis for Multiple-Valued Logic. ISMVL 2018: 115-120 - [c8]Alwin Zulehner, Robert Wille:
QMDD-Based One-Pass Design of Reversible Logic: Exploring the Available Degree of Freedom (Work-in-Progress Report). RC 2018: 244-250 - [i5]Alexandru Paler, Alwin Zulehner, Robert Wille:
NISQ circuit compilers: search space structure and heuristics. CoRR abs/1806.07241 (2018) - [i4]Alwin Zulehner, Michael P. Frank, Robert Wille:
Design Automation for Adiabatic Circuits. CoRR abs/1809.02421 (2018) - 2017
- [c7]Alwin Zulehner, Robert Wille:
Make it reversible: Efficient embedding of non-reversible functions. DATE 2017: 458-463 - [c6]Alwin Zulehner, Robert Wille:
Taking one-to-one mappings for granted: Advanced logic design of encoder circuits. DATE 2017: 818-823 - [c5]Samah Mohamed Saeed, Nithin Mahendran, Alwin Zulehner, Robert Wille, Ramesh Karri:
Identifying Reversible Circuit Synthesis Approaches to Enable IP Piracy Attacks. ICCD 2017: 537-540 - [c4]Alwin Zulehner, Robert Wille:
Skipping Embedding in the Design of Reversible Circuits. ISMVL 2017: 173-178 - [c3]Alwin Zulehner, Stefan Gasser, Robert Wille:
Exact Global Reordering for Nearest Neighbor Quantum Circuits Using A ^* ∗. RC 2017: 185-201 - [c2]Philipp Niemann, Alwin Zulehner, Robert Wille, Rolf Drechsler:
Efficient Construction of QMDDs for Irreversible, Reversible, and Quantum Functions. RC 2017: 214-231 - [c1]Alwin Zulehner, Robert Wille:
Improving Synthesis of Reversible Circuits: Exploiting Redundancies in Paths and Nodes of QMDDs. RC 2017: 232-247 - [i3]Samah Mohamed Saeed, Xiaotong Cui, Robert Wille, Alwin Zulehner, Kaijie Wu, Rolf Drechsler, Ramesh Karri:
Towards Reverse Engineering Reversible Logic. CoRR abs/1704.08397 (2017) - [i2]Xiaotong Cui, Samah Mohamed Saeed, Alwin Zulehner, Robert Wille, Rolf Drechsler, Kaijie Wu, Ramesh Karri:
On the Difficulty of Inserting Trojans in Reversible Computing Architectures. CoRR abs/1705.00767 (2017) - [i1]Alwin Zulehner, Robert Wille:
Advanced Simulation of Quantum Computations: Compact Representation Rather than Hardware Power. CoRR abs/1707.00865 (2017)
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-24 22:46 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:
