PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bollig, Beate"

Author of the publication

copydeleteadd this publication to your clipboard
On the Effect of Local Changes in the Variable Ordering of Ordered Decision Diagrams.

, , and . Inf. Process. Lett., 59 (5): 233-239 (1996)

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.

Beate Kaebel University of Stuttgart

Beate Holley University of Stuttgart

Beate Koch University of Stuttgart

Beate Langer University of Stuttgart

Beate Haußmann University of Stuttgart

 

Other publications of authors with the same name

Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication.. ITA, 35 (2): 149-162 (2001)On the complexity of the hidden weighted bit function for various BDD models., , , and . ITA, 33 (2): 103-116 (1999)New Results on the Most Significant Bit of Integer Multiplication., and . ISAAC, volume 5369 of Lecture Notes in Computer Science, page 883-894. Springer, (2008)On the OBDD Complexity of the Most Significant Bit of Integer Multiplication.. TAMC, volume 4978 of Lecture Notes in Computer Science, page 306-317. Springer, (2008)On the Complexity of Some Ordering Problems.. MFCS (2), volume 8635 of Lecture Notes in Computer Science, page 118-129. Springer, (2014)On Symbolic OBDD-Based Algorithms for the Minimum Spanning Tree Problem.. COCOA (2), volume 6509 of Lecture Notes in Computer Science, page 16-30. Springer, (2010)Randomized OBDDs for the Most Significant Bit of Multiplication Need Exponential Size., and . SOFSEM, volume 6543 of Lecture Notes in Computer Science, page 135-145. Springer, (2011)On the OBDD Complexity of Threshold Functions and the Variable Ordering Problem.. SOFSEM, volume 5404 of Lecture Notes in Computer Science, page 129-140. Springer, (2009)Improving the Variable Ordering of OBDDs Is NP-Complete., and . IEEE Trans. Computers, 45 (9): 993-1002 (1996)Parity Graph-driven Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication, , and . Electronic Colloquium on Computational Complexity (ECCC), (2001)