MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named Enno Ohlebusch – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

31 documents found, showing 1 through 10. Next 10 →

ATOM

A Simple Proof of Sufficient Conditions for the Termination of the Disjoint Union of Term Rewriting Systems
by Enno Ohlebusch — 1993 — Bulletin of the European Association for Theoretical Computer Science 49
… Systems Enno Ohlebusch Universitat Bielefeld, 4800 Bielefeld 1, Germany, e-mail: enno…
Cited by 6 (4 self) – Add To MetaCart

A Note on Simple Termination of Infinite Term Rewriting Systems
by Enno Ohlebusch — 1992
…A Note on Simple Termination of Infinite Term Rewriting Systems Enno Ohlebusch Universitat…
Cited by 4 (2 self) – Add To MetaCart

On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems
by Enno Ohlebusch — 1994 — In Proceedings of the 19th colloquium on Trees in Algebra and Programming, LNCS 787
…On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems Enno Ohlebusch…
Cited by 10 (1 self) – Add To MetaCart

Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems
by Enno Ohlebusch — 1995 — Proceedings of the 4th International Workshop on Conditional Term Rewriting Systems, Jerusalem, Lecture Notes in Computer Science
…Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems Enno Ohlebusch…
Cited by 3 (0 self) – Add To MetaCart

Combinations of Simplifying Conditional Term Rewriting Systems
by Enno Ohlebusch — 1992 — In Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems
…Combinations of Simplifying Conditional Term Rewriting Systems Enno Ohlebusch Universitat…
Cited by 4 (2 self) – Add To MetaCart

Conditional Term Graph Rewriting
by Enno Ohlebusch — 1997 — In Proceedings of the 6th International Conference on Algebraic and Logic Programming
…Conditional Term Graph Rewriting Enno Ohlebusch Technische Fakultat, University of Bielefeld, P…
Cited by 2 (2 self) – Add To MetaCart

Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems
by Enno Ohlebusch — 1993
…Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems Enno Ohlebusch…
Cited by 3 (2 self) – Add To MetaCart

Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof
by Enno Ohlebusch — 1998 — Bulletin of the European Association for Theoretical Computer Science
…Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof Enno Ohlebusch…
Cited by 1 (1 self) – Add To MetaCart

Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
by Enno Ohlebusch — 1999 — In: Proc. LPAR '99, Tblisi
…Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems Enno…
Cited by 7 (2 self) – Add To MetaCart

On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems
by Enno Ohlebusch — Proceedings of the 4th International Symposium on Functional and Logic Programming ', Vol. 1722 of
…On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems Enno Ohlebusch…
Cited by 2 (0 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB