| Publication | Date of Publication | Type |
|---|
An Algorithm for Linear, Affine and Spectral Classification of Boolean Functions
Advanced Boolean Techniques | 2024-01-23 | Paper |
Improved quantum circuits for elliptic curve discrete logarithms
Post-Quantum Cryptography | 2022-10-13 | Paper |
scientific article; zbMATH DE number 7453177 (Why is no real title available?)
| 2022-01-06 | Paper |
scientific article; zbMATH DE number 7453178 (Why is no real title available?)
| 2022-01-06 | Paper |
Boolean satisfiability in quantum compilation
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2021-06-15 | Paper |
A spectral algorithm for 3-valued function equivalence classification
| 2021-01-15 | Paper |
Mapping Monotone Boolean Functions into Majority
IEEE Transactions on Computers | 2019-08-13 | Paper |
The complexity of error metrics
Information Processing Letters | 2018-10-19 | Paper |
Pairs of majority-decomposing functions
Information Processing Letters | 2018-10-19 | Paper |
Quantum circuits for floating-point arithmetic
| 2018-10-17 | Paper |
SAT-based {CNOT, \(T\)} quantum circuit synthesis
| 2018-10-17 | Paper |
Ricercar: a language for describing and rewriting reversible circuits with ancillae and its permutation semantics
Reversible Computation | 2016-09-30 | Paper |
Technology mapping for single target gate based circuits using Boolean functional decomposition
Reversible Computation | 2016-09-30 | Paper |
Heuristic NPN classification for large functions using AIGs and LEXSAT
Theory and Applications of Satisfiability Testing – SAT 2016 | 2016-09-05 | Paper |
A fast symbolic transformation based algorithm for reversible logic synthesis
Reversible Computation | 2016-08-10 | Paper |
Enumeration of reversible functions and its application to circuit complexity
Reversible Computation | 2016-08-10 | Paper |
Complexity of reversible circuits and their quantum implementations
Theoretical Computer Science | 2016-02-18 | Paper |
Property checking of quantum circuits using quantum multiple-valued decision diagrams
Reversible Computation | 2015-11-30 | Paper |
Using \(\pi\)DDs in the design of reversible circuits
Reversible Computation | 2015-11-30 | Paper |
Ancilla-free synthesis of large reversible functions using binary decision diagrams
Journal of Symbolic Computation | 2015-08-24 | Paper |
Translating between the roots of the identity in quantum computers
| 2015-03-30 | Paper |
Self-Inverse Functions and Palindromic Circuits
| 2015-02-20 | Paper |
Quantum circuit optimization by Hadamard gate reduction
Reversible Computation | 2014-09-02 | Paper |
Mapping NCV Circuits to Optimized Clifford+T Circuits
Reversible Computation | 2014-09-02 | Paper |
Upper bounds for reversible circuits based on Young subgroups
Information Processing Letters | 2014-04-17 | Paper |
Reducing the Depth of Quantum Circuits Using Additional Circuit Lines
Reversible Computation | 2013-12-17 | Paper |
White dots do matter: rewriting reversible logic circuits
Reversible Computation | 2013-12-17 | Paper |
Encoding OCL data types for SAT-based verification of UML/OCL models
Tests and Proofs | 2011-07-07 | Paper |
