( en | de | ru )

 

Disambiguation of "Soeken, Mathias"

Author of the publication

copydeleteadd this publication to your clipboard
Majority logic synthesis.

, , , , , and . ICCAD, page 79. ACM, (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Mathias Soeken

Bernd Soeken

Gerhard Soeken

Heinrich Soeken

Mathias Rafler

Gaussian loop- and Pólya processes: a point process approach. Uni Potsdam, (2009)
 

Other publications of authors with the same name

On-the-fly and DAG-aware: Rewriting Boolean Networks with Exact Synthesis., , , , and . DATE, page 1649-1654. IEEE, (2019)Three-Input Gates for Logic Synthesis., , , , , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 40 (10): 2184-2188 (2021)Reducing the Multiplicative Complexity in Logic Networks for Cryptography and Security Applications., , , and . DAC, page 74. ACM, (2019)Design and Automation for Quantum Computation and Quantum Technologies., , , and . IEEE J. Emerg. Sel. Topics Circuits Syst., 12 (3): 581-583 (2022)A Resource Estimation and Verification Workflow in Q# Special session paper., , , , and . DATE, page 1050-1055. IEEE, (2021)Mapping NCV Circuits to Optimized Clifford+T Circuits., , and . RC, volume 8507 of Lecture Notes in Computer Science, page 163-175. Springer, (2014)Exact Synthesis of Boolean Functions in Majority-of-Five Forms., , , , , and . ISCAS, page 1-5. IEEE, (2019)An adaptive prioritized ε-preferred evolutionary algorithm for approximate BDD optimization., , , and . GECCO, page 1232-1239. ACM, (2017)Improvements to boolean resynthesis., , , , , , , and . DATE, page 755-760. IEEE, (2018)Compiling Permutations for Superconducting QPUs., , , and . DATE, page 1349-1354. IEEE, (2019)