PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Sieling, Detlef"

Author of the publication

copydeleteadd this publication to your clipboard
Graph Driven BDDs - A New Data Structure for Boolean Functions.

, and . Theor. Comput. Sci., 141 (1&2): 283-310 (1995)

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.

Detlef Clauß University of Stuttgart

 

Other publications of authors with the same name

Reduction of OBDDs in Linear Time., and . Inf. Process. Lett., 48 (3): 139-144 (1993)A separation of syntactic and nonsyntactic (1, +k)-branching programs.. Computational Complexity, 9 (3-4): 247-263 (2000)NC-Algorithms for Operations on Binary Decision Diagrams., and . Parallel Processing Letters, (1993)Playing Poker by Email.. Algorithms Unplugged, Springer, (2011)A Separation of Syntactic and Nonsyntactic (1,+k)-Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), (1998)A Hierarchy Result for Read-Once Branching Programs with Restricted Parity Nondeterminism., and . MFCS, volume 1893 of Lecture Notes in Computer Science, page 650-659. Springer, (2000)Binary Decision Diagrams., , , , , and . Boolean Models and Methods, Cambridge University Press, (2010)New Lower Bounds and Hierarchy Results for Restricted Branching Programs. Electronic Colloquium on Computational Complexity (ECCC), (1995)The complexity of minimizing and learning OBDDs and FBDDs.. Discrete Applied Mathematics, 122 (1-3): 263-282 (2002)Variable orderings and the size of OBDDs for random partially symmetric Boolean functions.. Random Struct. Algorithms, 13 (1): 49-70 (1998)