Le cluster Christoph Meinel - Uwe Roth
| 000227 (2000) | Ernst-Georg Haffner [Allemagne] ; Uwe Roth [Allemagne] ; Andreas Heuer [Allemagne] ; Thomas Engel [Allemagne] ; Christoph Meinel [Allemagne] | What Do Hyperlink-Proposals and Request-Prediction Have in Common? |
| 000233 (2000) | Ernst-Georg Haffner [Allemagne] ; Andreas Heuer [Allemagne] ; Uwe Roth [Allemagne] ; Thomas Engel [Allemagne] ; Christoph Meinel [Allemagne] | Advanced Studies on Link Proposals and Knowledge Retrieval of Hypertexts with CBR |
| 000201 (2003) | Wanjun Huang [Allemagne] ; Uwe Roth [Allemagne] ; Christoph Meinel [Allemagne] | A Flexible Middleware Platform with Piped Workflow |
| 000202 (2003) | WANJUN HUANG [Allemagne] ; Uwe Roth [Allemagne] ; Christoph Meinel [Allemagne] | A flexible middleware platform with piped workflow |
| 000213 (2002) | Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne] | Algorithms and Heuristics in VLSI Design |
| 000223 (2001) | Christoph Meinel [Allemagne] ; Christian Stangier [Allemagne] | Data Structures for Boolean Functions BDDs — Foundations and Applications |
| 000228 (2000) | Christoph Meinel [États-Unis, Allemagne] ; Christian Stangier [États-Unis, Allemagne] | Speeding Up Image Computation by Using RTL Information |
| 000258 (1997) | Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne] | On the influence of the state encoding on OBDD-representations of finite state machines |
| 000267 (1997) | Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne] | A reducibility concept for problems defined in terms of ordered binary decision diagrams |
| 000270 (1996) | Christoph Meinel [Allemagne] ; Stephan Waack | The “log rank” conjecture for modular communication complexity |
| 000275 (1996) | Christoph Meinel [Allemagne] ; Thorsten Theobald [Allemagne] | Local encoding transformations for optimizing OBDD-representations of finite state machines |
| 000288 (1995) | Christoph Meinel [Allemagne] ; Stephan Waack | Lower bounds for the majority communication complexity of various graph accessibility problems |
| 000290 (1995) | Jochen Bern [Allemagne] ; Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne] | Global rebuilding of OBDDs avoiding memory requirement maxima |
| 000294 (1994) | Christoph Meinel [Allemagne] ; Anna Slobodová [Allemagne] | On the complexity of constructing optimal ordered binary decision diagrams |
| 000298 (1993) | Christoph Meinel [Allemagne] ; Stephan Waack [Allemagne] | Separating complexity classes related to bounded alternating Ω-branching programs |
| 000151 (2005) | Long Wang [Allemagne] ; Christoph Meinel [Allemagne] ; Chunnian Liu [République populaire de Chine] | Discovering Characteristic Individual Accessing Behaviors in Web Environment |
| 000172 (2005) | LONG WANG [Allemagne] ; Christoph Meinel [Allemagne] ; CHUNNIAN LIU [République populaire de Chine] | Discovering characteristic individual accessing behaviors in web environment |
| 000178 (2004) | Mohammad Ghasemzadeh [Allemagne] ; Volker Klotz [Allemagne] ; Christoph Meinel [Allemagne] | Embedding Memoization to the Semantic Tree Search for Deciding QBFs |
| 000184 (2004) | Long Wang [Allemagne] ; Christoph Meinel [Allemagne] | Behaviour Recovery and Complicated Pattern Definition in Web Usage Mining |
| 000185 (2004) | Serge Linckels [Allemagne] ; Christoph Meinel [Allemagne] | Automatic Interpretation of Natural Language for a Multimedia E-learning Tool |
| 000187 (2004) | LONG WANG [Allemagne] ; Christoph Meinel [Allemagne] | Behaviour recovery and complicated pattern definition in web usage mining |
| 000203 (2002) | Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] ; Arno Wagner [Suisse] | WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms |
| 000243 (1998) | Jochen Bern [Allemagne] ; Christoph Meinel [Allemagne] ; Harald Sack [Allemagne] | The STACS Electronic Submission Service |
| 000245 (1998) | Anna Slobodova [États-Unis, Slovaquie] ; Christoph Meinel [Allemagne] | Sample Method for Minimization of OBDDs |
| 000247 (1998) | Anna Slobodová [Allemagne] | On the composition problem for OBDDs with multiple variable orders |
| 000289 (1995) | Thorsten Theobald [Allemagne] | How to Break Shamir’s Asymmetric Basis |
| 000304 (1993) | Jordan Gergov ; Christoph Meinel [Allemagne] | Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs |
| 000305 (1993) | Jordan Gergov ; Christoph Meinel [Allemagne] | Analysis and manipulation of Boolean functions in terms of decision graphs |
| This area was generated with Dilib version V0.6.31. |  |