You can find lists of our papers that focus on other topics: 

• Trust and Security Engineering 
• Future Internet technologies: Web 3.0
• Next-generation Internet applications in:
  Web-University,  Telemedicine and other applications
• Innovation method Design Thinking
• Theoretical Computer Science: Computational Complexity

These are our papers on Binary Decision Diagrams (BDDs) in Electronic Design Automation (EAD) and Formal Verification:

• M. Ghasemzadeh , S. Khanchi, Christoph Meinel
  K-terminal Network Reliability Evaluation Using Binary Decision Diagram, 3rd IEEE International Conf. on Information & Communication Technologies(ICTTA´08), Damascus, Syria, April 2008
• M. Ghasemzadeh, Christoph Meinel
  An Operator for Removal of Subsumed Clauses, 13th International CSI Computer Science (CSICC08), Kish Island, Persian Gulf, Iran, March 2008
  (To be published by Springer-Verlag).
• M. Ghasemzadeh, Christoph Meinel, M. Shirmohammadi, M. H. Shahzamanian
  ZDD based Cryptanalysis of E0 Keystream generator, Third International Conference on Mathematical Sciences (ICM 2008), Al Ain, UAE, March 2008
  (To be published)
• M. Ghasemzadeh, Christoph Meinel
  Accepting More General Forms of QBFs. 38th Annual Iranians Mathematics Conference
  Zanjan - Iran, Sept. 2007, pp. 377-383.
• M. Ghasemzadeh, V. Klotz, Christoph Meinel
  Splitting Versus Unfolding
  Proc. RM 2005 Tokyo (Japan), 2005, pp. 30-34
• M. Ghasemzadeh, V. Klotz, Christoph Meinel
  Representation and Evaluation of QBFs in Prenex-NNF
  Proc. AI-METH 2004 Gliwice (Poland), 2004, pp. 115-120
• M. Ghasemzadeh, V. Klotz, Christoph Meinel
  Strengthening Semantic-tree Method in evaluating QBFs
  Proc. IWSBP 2004 Freiberg (Germany), 2004, pp. 257-264
• M. Ghasemzadeh, V. Klotz, Christoph Meinel
  FZQSAT: A QSAT Solver for QBFs in Prenex NNF - a Tool for Circuit Verification
  Proc. IWLS 2004 California (USA), 2004, pp 135-142
• M. Ghasemzadeh, V. Klotz, Christoph Meinel
  Embedding Memorization to the Semantic Tree Search for deciding QBFs
  Proc. ACS 2004, Cairns (Australia), 2004, pp. 681-693
• Christoph Meinel, H. Sack
  Adapted Variable Reordering for XOR-OBDDs
  Proc. RM 2003, Trier (Germany), 2003, pp. 135-144
• M. GhasemZadeh, Christoph Meinel
  BDDS, Horn Clauses and Resolution
  Proc. RM 2003, Trier (Germany), 2003, pp. 63-68
• Christoph Meinel, C. Stangier
  Modular Partitioning and Dynamic Conjunction Scheduling in Image Computation
  Proc. ACM IWLS 2002, New Orleans (Louisiana, USA), 2002, pp. 391-396
• Christoph Meinel, H. Sack, V. Schillings
  VisBDD - A Webbased Visualization Framework for OBDD Algorithms
  Proc. ACM IWLS 2002, New Orleans (Louisiana, USA), 2002, pp. 385-390
• Christoph Meinel, R. Mubarakzjanov
  Nonlinear Sifting of Decision Diagrams
  Proc. VLSI 2002, Las Vegas (Nevada, USA), 2002, pp. 117-127.
• Christoph Meinel, H. Sack
  Improving XOR-node Placement for Mod2-OBDD Minimzation
  Proc. Reed-Muller 2001, Starkville (Mississippi,USA), 2001, pp. 51-56
• Christoph Meinel, H. Sack
  A Simple Heuristic for Mod2-OBDD Minimization
  Proc. ACM IWLS 2001, Lake Tahoe (California, USA), 2001, pp. 304-309.
• Christoph Meinel, Ch. Stangier
  Hierarchical Image Computation with Dynamic Conjunction Scheduling
  Proc. IEEE ICCD 2001, Austin (Texas, USA), 2001, pp. 354-359.
• Christoph Meinel, Ch. Stangier
  Hierarchical Image Computation with Dynamic Conjunction Scheduling
  Proc. ACM IWLS 2001, Lake Tahoe (California, USA), 2001, pp. 316-321
• Christoph Meinel, Ch. Stangier
  A new Partitioning Scheme for Improvement of Image Computation
  Proc. IEEE ASP-DAC 2001, Yokohama (Japan), 2001, pp. 97-102.
• Christoph Meinel, Ch. Stangier
  Speeding Up Image Computation by using RTL Information
  Proc. FMCAD 2000, Austin (Texas, USA), 2000, pp. 443-454.
• H. Sack, Christoph Meinel
  Functional Extension of Decision Diagrams in Practice
  Proc. FMTOOLS 2000, Reisenburg (Germany), 2000, pp. 195-196.
• Christoph Meinel, Ch. Stangier
  Accelerating Techniques for OBDD-based Formal Verification of Sequential Systems
  Proc. FMTOOLS 2000, Reisenburg (Germany), 2000, pp. 129-134.
• H. Sack, E. Dubrova, Christoph Meinel
  Representation of Multiple-Valued Functions with Mod-p Decision Diagrams Proc. ACM IWLS 2000, Dana Point (California, USA), 2000, pp. 341-348.
• Christoph Meinel, A. Wagner
  WWW.BDD-PORTAL.ORG
  Proc. ACM IWLS 2000, Dana Point (California, USA), 2000, pp. 349-353.
• H. Sack, E. Dubrova, Christoph Meinel
  Mod-p-DDs: A Data-Structure for Multiple-Valued Functions
  Proc. 30th IEEE ISMVL 2000, Portland (Oregon, USA), 2000, pp. 233-238.
• Christoph Meinel, A. Wagner
  WWW.BDD-PORTAL.ORG - An Electronical Basis for Cooperative Research in EDA
  Proc.CRIS 2000, Helsinki (Finland), 2000, pp. 1-7
• Christoph Meinel, Ch. Stangier
  Speeding up Symbolic Model Checking by Accelerating Dynamic Variable Reordering
  Proc. GLS-VLSI 2000, Chicago (USA), 2000, pp. 39-42.
• Christoph Meinel, H. Sack, Ch. Stangier
  Overcoming Ordering Restrictions for Synthesizing Binary Decision Diagrams
  Proc. NORCHIP´99, Oslo (Norway), 1999, pp. 52-60.
• Christoph Meinel, H. Sack
  Algorithmic Considerations for (+)OBDD Reordering
  Proc. ACM IWLS 99, Lake Tahoe (California, USA), 1999, pp. 71-74.
• Christoph Meinel, A. Wagner
• OBDD Heuristics Online
  Proc. ACM IWLS 99, Lake Tahoe (California, USA), 1999, pp. 177-181.
• Christoph Meinel, K. Schwettmann, A. Slobodová
  Application Driven Variable Reordering and an Example Implementation in Reachability Analysis
  Proc. ASP-DAC 99, Hongkong, 1999, pp. 327-330.
• Christoph Meinel, Ch. Stangier
  Speeding Up Symbolic Model Checking
  Proc. ACS 98, Szczecin, (Polen), 1998, pp. 548-554.
• Christoph Meinel, A. Slobodová
  Sample Method for Minimization of OBDDs
  Proc. SOFSEM'98, Jasna (Slowakia), 1998, pp. 419-428.
• Christoph Meinel, H. Sack
  MOD_2_OBBDs - a BDD Structure for Probabilistic Verification
  Proc. PROBMIV 98, Indianapolis (USA), 1998, pp. 141-151.
• Christoph Meinel, A. Slobodová
  Sample Method for Minimization of OBDDs
  Proc. ACM IWLS 98, Lake Tahoe (California, USA), 1998, pp. 311-316.
• Christoph Meinel, H. Sack
  (+)OBDDs - a BDD Structure for Probabilistic Verification
  Proc. ACM IWLS 98, Lake Tahoe (California, USA), 1998.
• Christoph Meinel, F. Somenzi, T. Theobald
  Function Decomposition and Synthesis Using Linear Sifting
  Proc. ASP-DAC 98, Yokohama (Japan), 1998, pp. 81-86.
• Christoph Meinel, T. Theobald
  Geordnete binäre Entscheidungsgraphen und ihre Bedeutung im rechnergestützten Entwurf hochintegrierter Schaltkreise
  Proc. Informatik 97, Jahrestagung der GI, Aachen, 1997, pp. 307-316.
• Christoph Meinel, A. Slobodová
  Speeding up Variable Ordering of OBDDs
  Proc. of ICCD 97, Austin (Texas, USA), 1997, pp. 338-343.
• Christoph Meinel, H. Sack
  Case Study: Manipulating (+)-OBDDs by Means of Signatures
  Proc. Reed-Muller 97, Oxford (Großbritannien), 1997, pp. 175-185.
• Christoph Meinel, T. Theobald
  On the Influence of the State Encoding on OBDD-Representations of Finite State Machines
  Proc. MFCS 97, Bratislava (Slowakei), LNCS 1295, 1997, 408-417.
• Christoph Meinel, F. Somenzi, T. Theobald
  Linear Sifting of Decision Diagrams
  Proc. 34th IEEE/ACM DAC, Anaheim (USA), IEEE Computer Society Press, 1997, 202-207.
• Christoph Meinel, A. Slobodová
  Speeding up Variable Reordering of OBDDs
  Proc. ACM IWLS, Granlibakken Resort, Lake Tahoe (USA), 1997.
• Christoph Meinel, T. Theobald
  Local Encoding Transformations for Optimizing OBDD-Representations of Finite State Machines
  Proc. FMCAD 96, Palo Alto (California, USA), LNCS 1166, Springer-Verlag 1996, 404-418.
• Christoph Meinel
  Die Entwicklung der Informatik braucht Theorie und Praxis. Ein Fallbeispiel aus dem CAD-Schaltkreisentwurf
  Proc. GISI 95, Zürich (Switzerland), F. Huber-Wäschle, H. Schauer, P. Widmayer Ed., Informatik aktuell, Springer-Verlag 1995, 339-346.
• Christoph Meinel, A. Slobodová
  Dynamic Global Rebuilding (Poster)
  Proc. ACM IWLS 95, Granlibakken (USA), 1995.
• J. Bern, Christoph Meinel, A. Slobodová
  Global Rebuilding of OBDD's - Tunneling Memory Requirement Maxima
  Proc. CAV 95, Liège (Belgium), LNCS 939, Springer-Verlag 1995, 4-15.
• J. Bern, Christoph Meinel, A. Slobodová
  Efficient OBDD-Based Boolean Manipulation in CAD Beyond Current Limits Proc. 32nd IEEE/ACM DAC, San Francisco (USA), IEEE Computer Society Press 1995, 408-413.
• Christoph Meinel, A. Slobodová
  On the Complexity of Constructing Optimal Ordered Binary Decision Diagrams Proc. MFCS 94, Kosice (Slovakia), LNCS 841, Springer-Verlag 1994, 515-524.
• J. Gergov, Christoph Meinel
  Boolean Manipulation with Free BDDs. An Application in Combinational Logic Verification
  Proc. 13th IFIP World Computer Congress 94, Hamburg (Germany), IFIP Transactions A-51 Technology and Foundations, Vol. 1, North-Holland 1994, 309-314.
• J. Bern, J. Gergov, Christoph Meinel, A. Slobodová
  Boolean Manipulation with Free BDDs. First Experimental Results
  Proc. EDAC 94, Paris (France), IEEE Computer Society Press 1994, 200-207.
• J. Gergov, Christoph Meinel
  Mod-2-OBDD's - a Generalization of OBDD's and EXOR-Sum-of-Products
  Proc. IFIP WG 10.5 Workshop on Applications of the Reed-Muller Expansion in Circuit Design, Hamburg (Germany), TR WSI-93-2, W. Schickard-Institut für Informatik, Universität Tübingen, 1993, 170-175.
• J. Gergov, Christoph Meinel
  Frontiers of Feasible and Probabilistic Feasible Boolean Manipulation with Branching Programs
  Proc. STACS 93, Würzburg (Germany), LNCS 665, Springer-Verlag 1993, 576-585.
• J. Gergov, Christoph Meinel
  Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs
  Proc. WG 92, Frankfurt a. M. (Germany), LNCS 657, Springer-Verlag 1993, 310-320.
• L. Budach, E.-G. Giessmann, H. Grassmann, B. Graw, Christoph Meinel
  RELACS - a Recursive Layout Computing System
  Proc. Parallel Algorithms and Architectures, Mathem. Forschungen, Vol. 38, Akademie-Verlag, Berlin, 1987, 86-88.
• Christoph Meinel
  The Recursive Design Paradigma and its Application in the Layout Computing System RELACS
  Proc. Sofsem 87, CSSR, 1987, 171-188.
• Christoph Meinel
  The Parallelization Index of Synchronous Systems Proc. Parcella'86, Berlin (Germany),
  Mathem. Forschungen, Vol. 29, Akademie-Verlag, Berlin, 1986, 192-201.