default search action
Pawel Kerntopf
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j4]Martin Lukac
, Pawel Kerntopf, Michitaka Kameyama:
Optimization of LNN Reversible Circuits Using an Analytic Sifting Method. J. Circuits Syst. Comput. 30(9): 2150166:1-2150166:23 (2021) - 2020
- [p1]Pawel Kerntopf, Claudio Moraga, Krzysztof Podlaski
Research on Reversible Functions Having Component Functions with Specified Properties: An Overview. Selected Results of the COST Action IC1405 2020: 83-107
2010 – 2019
- 2018
- [c20]Pawel Kerntopf, Radomir S. Stankovic, Krzysztof Podlaski
Ternary/MV Reversible Functions with Component Functions from Different Equivalence Classes. ISMVL 2018: 109-114 - 2017
- [c19]Pawel Kerntopf, Krzysztof Podlaski
Study of Reversible Ternary Functions with Homogeneous Component Functions. ISMVL 2017: 191-196 - 2016
- [c18]Marcin Bryk, Krzysztof Gracki, Pawel Kerntopf, Marek Pawlowski, Andrzej Skorupski:
Encryption using reconfigurable reversible logic gate and its simulation in FPGAs. MIXDES 2016: 203-206 - 2014
- [j3]Linh Tran
Synthesis of Reversible Circuits Based on EXORs of Products of EXORs. Trans. Comput. Sci. 24: 111-128 (2014) - [c17]Martin Lukac, Maher Hawash, Michitaka Kameyama, Marek A. Perkowski, Pawel Kerntopf:
Minimizing Reversible Circuits in the 2n Scheme Using Two and Three Bits Patterns. DSD 2014: 708-711 - [c16]Martin Lukac, Michitaka Kameyama, Marek A. Perkowski, Pawel Kerntopf, Claudio Moraga:
Analysis of Faults in Reversible Computing. ISMVL 2014: 115-120 - 2013
- [c15]Ben Schaeffer, Linh Tran
Synthesis of Reversible Circuits Based on Products of Exclusive OR Sums. ISMVL 2013: 35-40 - [c14]Martin Lukac, Michitaka Kameyama, Marek A. Perkowski, Pawel Kerntopf:
Analysis of Reversible and Quantum Finite State Machines Using Homing, Synchronizing and Distinguishing Input Sequences. ISMVL 2013: 322-327 - 2012
- [c13]Marek Szyprowski, Pawel Kerntopf:
Optimal 4-bit Reversible Mixed-Polarity Toffoli Circuits. RC 2012: 138-151 - 2011
- [i1]Marek Szyprowski, Pawel Kerntopf:
Reducing Quantum Cost in Reversible Toffoli Circuits. CoRR abs/1105.5831 (2011) - 2010
- [c12]Marek Szyprowski, Pawel Kerntopf:
Estimating the quality of complexity measures in heuristics for reversible logic synthesis. IEEE Congress on Evolutionary Computation 2010: 1-8
2000 – 2009
- 2006
- [j2]Pawel Kerntopf, Marek A. Perkowski, Mozammel H. A. Khan:
On Universality of General Reversible Multiple-Valued Logic Gates. J. Multiple Valued Log. Soft Comput. 12(5-6): 417-429 (2006) - 2005
- [j1]Mozammel H. A. Khan, Marek A. Perkowski, Mujibur R. Khan, Pawel Kerntopf:
Terary GFSOP Minimization Using Kronecker Decision Diagrams and Their Synthesis with Quantum Cascades. J. Multiple Valued Log. Soft Comput. 11(5-6): 567-602 (2005) - 2004
- [c11]Pawel Kerntopf:
A new heuristic algorithm for reversible logic synthesis. DAC 2004: 834-837 - [c10]Pawel Kerntopf, Marek A. Perkowski, Mozammel H. A. Khan:
On Universality of General Reversible Multiple-Valued Logic Gates. ISMVL 2004: 68-73 - 2003
- [c9]Mozammel H. A. Khan, Marek A. Perkowski, Pawel Kerntopf:
Multi-Output Galois Field Sum of Products Synthesis with New Quantum Cascades. ISMVL 2003: 146-153 - 2002
- [c8]Pawel Kerntopf:
Synthesis of Multipurpose Reversible Logic Gates. DSD 2002: 259-267 - [c7]Pawel Kerntopf:
An Approach to Designing Complex Reversible Logic Gates. IWLS 2002: 31-36 - [c6]Pawel Kerntopf:
Nonlinear Sifting of Decision Diagrams. IWLS 2002: 85-90 - [c5]Andrei B. Khlopotine, Marek A. Perkowski, Pawel Kerntopf:
Reversible Logic Synthesis by Iterative Compositions. IWLS 2002: 261-266 - 2001
- [c4]Pawel Kerntopf:
An Approach to Minimization of Decision Diagrams . DSD 2001: 79-86 - [c3]Marek A. Perkowski, Pawel Kerntopf:
Fundamentals of Reversible Logic and Computing. DSD 2001: 244 - [c2]Marek A. Perkowski, Malgorzata Chrzanowska-Jeske, Alan Mishchenko, Xiaoyu Song, Anas Al-Rabadi, Bart Massey, Pawel Kerntopf, Andrzej Buller, Lech Józwiak, Alan J. Coppola:
Regular Realization of Symmetric Functions Using Reversible Logic. DSD 2001: 245-253
1970 – 1979
- 1974
- [c1]Pawel Kerntopf:
On Boolean Functions Having Maximal Number of Subfunction Classes. SWAT 1974: 205-211
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:55 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: