Dr. Mathias Soeken
Researcher, Lausanne, Switzerland
Mathias Soeken works as a research design engineer at Microsoft and as a researcher at the EPFL in Lausanne, Switzerland. From 2009 to 2015 he worked at the University of Bremen, Germany and has been a regularly visiting post doc at UC Berkeley, CA, USA in the group of Robert K. Brayton. He holds a Ph.D. degree (Dr.-Ing.) in Computer Science from University of Bremen, Germany (2013). His research interests are logic synthesis, quantum computing, reversible logic, and formal verification. Mathias Soeken is member of the IEEE and of the ACM.
- The paper A logic synthesis toolbox for reducing the multiplicative complexity in logic networks has been accepted by the DATE 2020 conference. publication
- The paper A hybrid spectral method for checking Boolean function equivalence has been accepted by the PACRIM 2019 conference. publication
- The paper The role of multiplicative complexity in compiling low T-count oracle circuits has been accepted by the ICCAD 2019 conference. publication
- Using ZDDs in the mapping of quantum circuits
- ROS: Resource-constrained oracle synthesis for quantum computers
- Reducing the multiplicative complexity in logic networks for cryptography and security applications
- Scalable generic logic synthesis: one approach to rule them all
- The article LUT-based hierarchical reversible logic synthesis got accepted for publication in IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. publication
- Advanced functional decomposition using majority and its applications
- SAT-based exact synthesis: encodings, topology families, and parallelism
- The article Mapping monotone Boolean functions into majority got accepted for publication in IEEE Transactions on Computer. publication
- The article Logic synthesis for established and emerging computing got accepted for publication in Proceedings of the IEEE. publication
Disclaimer: Any opinions expressed on this blog are mine, not those of my employer.