Author of the publication

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)

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.

 

Other publications of authors with the same name

A Combined BIT and TIMESTAMP Algorithm for the List Update Problem., , and . Inf. Process. Lett., 56 (3): 135-139 (1995)Optimal Ordered Binary Decision Diagrams for Tree-like Circuits, , and . Electronic Colloquium on Computational Complexity (ECCC), (1996)Complexity of Searching an Immobile Hider in a Graph., and . Discrete Applied Mathematics, 78 (1-3): 235-249 (1997)On the Security of Server-Aided RSA Protocols., and . Public Key Cryptography, volume 1431 of Lecture Notes in Computer Science, page 99-116. Springer, (1998)Optimal Tree Constraction and Term Matching on the Hypercube and Related Networks., and . Algorithmica, 18 (3): 445-460 (1997)Optimal ordered binary decision diagrams for read-once formulas., , and . Discrete Applied Mathematics, 103 (1-3): 237-258 (2000)Divide-and-Conquer Algorithmen auf dem Hyperwürfel.. Goethe University Frankfurt, Frankfurt am Main, Germany, (1994)Optimal Tree Contraction on the Hypercube and Related Networks., and . ESA, volume 726 of Lecture Notes in Computer Science, page 295-305. Springer, (1993)Optimal Expression Evaluation and Term Matching on the Boolean Hypercube and on Hypercubic Networks., and . HICSS (2), page 140-149. IEEE Computer Society, (1994)Divide-and-Conquer Algorithms on the Hypercube., and . STACS, volume 665 of Lecture Notes in Computer Science, page 153-162. Springer, (1993)