PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Sauerhoff, Martin"

Author of the publication

copydeleteadd this publication to your clipboard
Binary Decision Diagrams.

, , , , , and . Boolean Models and Methods, Cambridge University Press, (2010)

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.

Dr. -Ing. Martin Schneider University of Stuttgart

DuMux 3.5.0, , , , , , , , , and 16 other author(s). Software, (2022)

Dr. -Ing. Martin Dazer University of Stuttgart

Degradation analysis of several performance characteristics of capacitors under elevated thermal and electrical stress, and . Proceedings of the 35th European Safety and Reliability Conference (ESREL 2025), (June 2025)

Univ. -Prof. Dr. -Ing. Ullrich Martin University of Stuttgart

Hon. -Prof. Dr. -Ing. Martin Krus University of Stuttgart

Martin Baumann

 

Other publications of authors with the same name

On the complexity of minimizing the OBDD size for incompletely specified functions., and . IEEE Trans. on CAD of Integrated Circuits and Systems, 15 (11): 1435-1437 (1996)Applying Approximate Counting for Computing the Frequency Moments of Long Data Streams., and . Theory Comput. Syst., 44 (3): 332-348 (2009)Approximation of boolean functions by combinatorial rectangles.. Theor. Comput. Sci., 301 (1-3): 45-78 (2003)Binary Decision Diagrams., , , , , and . Boolean Models and Methods, Cambridge University Press, (2010)On the complexity of the hidden weighted bit function for various BDD models., , , and . ITA, 33 (2): 103-116 (1999)Hierarchy Theorems for kOBDDs and kIBDDs., , , and . Theor. Comput. Sci., 205 (1-2): 45-60 (1998)On the Power of Different Types of Restricted Branching Programs, , , and . Electronic Colloquium on Computational Complexity (ECCC), (1994)Relating Branching Program Size and Formula Size over the Full Binary Basis., , and . STACS, volume 1563 of Lecture Notes in Computer Science, page 57-67. Springer, (1999)Tradeoffs between Nondeterminism and Complexity for Communication Protocols and Branching Programs., and . STACS, volume 1770 of Lecture Notes in Computer Science, page 145-156. Springer, (2000)On the Non-Approximability of Boolean Functions by OBDDs and Read-K-Times Branching Programs., , and . Computational Complexity Conference, page 172-183. IEEE Computer Society, (2001)