# Conference Papers for OBDD at the Chair of Prof. Dr. Christoph Meinel

Here you can find our peer-reviewed conference papers on Branching Programs, (Ordered) Binary Decision Diagrams - (O)BDDs, and on BDD-based Efficient Data Structures and Algorithms:

[2004] [2003] [2000]

2004 [ to top ]

• GhasemZadeh, M., Klotz, V. & Meinel, C., 2004. Strengthening Semantic-tree Method in evaluating QBFs. In Proceedings of the 6th International Workshop on Boolean Problems (IWSBP 2004). Freiberg, Germany, , S. 257-264.

• Ghasemzadeh, M., Klotz, V. & Meinel, C., 2004. Representation and Evaluation of QBFs in Prenex-NNF. In Proceedings of Symposium of Methods on AI (AI-METH 2004). Gliwice, Poland, , S. 115-120.

• Ghasemzadeh, M., Klotz, V. & Meinel, C., 2004. Embedding Memorization to Semantic Tree Search for deciding QBFs. In Proceedings of the 17th Australian Joint Conference on Artificial Intelligence (ACS 2004). Cairns, Australia, , S. 681–693.

2003 [ to top ]

• GhasemZadeh, M. & Meinel, C., 2003. BDDS, Horn Clauses and Resolution. In Proceedings of the 6th International Symposium on Representations and Methodology of Future Computing Technology (RM 2003). Trier, Germany, , S. 63-68.

2000 [ to top ]

• Sack, H., Dubrova, E. & Meinel, C., 2000. Representation of Multiple-Valued Functions with Mod-p Decision Diagrams. In Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000). Dana Point, California, USA: IEEE Press, , S. 341-348.

• Sack, H., Dubrova, E. & Meinel, C., 2000. Mod-p-DDs: A Data-Structure for Multiple-Valued Functions. In Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000). Portland, Oregon, USA: IEEE Press, , S. 233-238.

You can find other sub-lists of our conference papers focusing on

Go back to the complete list of peer-reviewed conference papers.