Attributive concept descriptions with complements M Schmidt-Schauß, G Smolka Artificial intelligence 48 (1), 1-26, 1991 | 1476 | 1991 |

Subsumption in KL-ONE is undecidable M Schmidt-Schau Principles of Knowledge Representation and Reasoning: Proceedings of the 1st …, 1989 | 305 | 1989 |

Computational aspects of an order-sorted logic with term declarations M Schmidt-Schauß | 265 | 1989 |

Unification in a combination of arbitrary disjoint equational theories M Schmidt-Schauß Journal of Symbolic Computation 8 (1-2), 51-99, 1989 | 155 | 1989 |

On equational theories, unification, and (un) decidability HJ Bürckert, A Herold, M Schmidt-Schauss Journal of Symbolic Computation 8 (1-2), 3-49, 1989 | 87 | 1989 |

Implication of clauses is undecidable M Schmidt-Schauss Theoretical Computer Science 59 (3), 287-296, 1988 | 74 | 1988 |

Safety of nöcker's strictness analysis M Schmidt-Schauß, D Sabel, M SchÜtz Journal of Functional Programming 18 (4), 503-551, 2008 | 60 | 2008 |

Unification in Boolean rings and Abelian groups A Boudet, JP Jouannaud, M Schmidt-Schauss Journal of Symbolic Computation 8 (5), 449-477, 1989 | 60 | 1989 |

A decision algorithm for distributive unification M Schmidt-Schauβ Theoretical Computer Science 208 (1-2), 111-148, 1998 | 53* | 1998 |

Unification under associativity and idempotence is of type nullary M Schmidt-Schauss Journal of Automated Reasoning 2 (3), 277-281, 1986 | 53 | 1986 |

On the exponent of periodicity of minimal solutions of context equations M Schmidt-Schauß, KU Schulz International Conference on Rewriting Techniques and Applications, 61-75, 1998 | 52 | 1998 |

A call-by-need lambda calculus with locally bottom-avoiding choice: context lemma and correctness of transformations D Sabel, M Schmidt-Schauß Mathematical Structures in Computer Science 18 (3), 501-553, 2008 | 50 | 2008 |

A non-deterministic call-by-need lambda calculus A Kutzner, M Schmidt-Schauß ACM SIGPLAN Notices 34 (1), 324-335, 1998 | 46 | 1998 |

A decision algorithm for stratified context unification M Schmidt‐Schauß Journal of Logic and Computation 12 (6), 929-953, 2002 | 45 | 2002 |

TEA: Automatically proving termination of programs in a non-strict higher-order functional language SE Panitz, M Schmidt-Schauß International Static Analysis Symposium, 345-360, 1997 | 43 | 1997 |

Combination of unification algorithms M Schmidt-Schau Journal of Symbolic Computation 8 (1), 51-100, 1989 | 41 | 1989 |

A fast branching algorithm for cluster vertex deletion A Boral, M Cygan, T Kociumaka, M Pilipczuk Theory of Computing Systems 58 (2), 357-376, 2016 | 40* | 2016 |

Observational semantics for a concurrent lambda calculus with reference cells and futures J Niehren, D Sabel, M Schmidt-Schauß, J Schwinghammer Electronic Notes in Theoretical Computer Science 173, 313-337, 2007 | 40 | 2007 |

Solvability of context equations with two context variables is decidable M Schmidt-Schauß, KU Schulz Journal of Symbolic Computation 33 (1), 77-122, 2002 | 39 | 2002 |

Unification in many-sorted equational theories M Schmidt-Schauß International Conference on Automated Deduction, 538-552, 1986 | 39 | 1986 |