( en | de | ru )

 

Disambiguation of "Soeken, Mathias"

Author of the publication

copydeleteadd this publication to your clipboard
Extending Boolean Methods for Scalable Logic Synthesis.

, , , , , , and . IEEE Access, (2020)

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 Rausch

Stärkung des Informationsanspruchs durch das Arca-nigra-Verfahren: ein In-camera-Verfahren zur Kontrolle der Informationsgabe. Uni Köln, (2009)
 

Other publications of authors with the same name

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)A Logic Synthesis Toolbox for Reducing the Multiplicative Complexity in Logic Networks., , , , and . IACR Cryptol. ePrint Arch., (2020)Integrated ESOP Refactoring for Industrial Designs., , , , , and . ICECS, page 369-372. IEEE, (2018)Improvements to boolean resynthesis., , , , , , , and . DATE, page 755-760. IEEE, (2018)Compiling Permutations for Superconducting QPUs., , , and . DATE, page 1349-1354. IEEE, (2019)SAT-Based Exact Synthesis: Encodings, Topology Families, and Parallelism., , , and . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 39 (4): 871-884 (2020)Automatic Uniform Quantum State Preparation Using Decision Diagrams., , , and . ISMVL, page 170-175. IEEE, (2020)Structural rewriting in XOR-majority graphs., , , , and . ASP-DAC, page 663-668. ACM, (2019)The Role of Multiplicative Complexity in Compiling Low $T$-count Oracle Circuits., , , , and . ICCAD, page 1-8. ACM, (2019)