Previous Page | Next Page | Expand All | Collapse All | Search (Full Text)
# | Year | Title | Type | |||||
---|---|---|---|---|---|---|---|---|
2 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
8 |
| |||||||
1 |
| |||||||
2 |
| |||||||
1 |
| |||||||
1 |
| |||||||
5 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
6 |
| |||||||
2002 | A New Input Technique for Accented Letters in Alphabetical Scripts In: Proceedings of the 20th International Unicode Conference, C12 | Proceedings Article | ||||||
2002 | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part II) In: Journal of Symbolic Computation [33], 831-861 | Journal Article | ||||||
2002 | Cancellative Abelian Monoids and Related Structures in Refutational Theorem Proving (Part I) In: Journal of Symbolic Computation [33], 777-829 | Journal Article | ||||||
1998 | Extending reduction orderings to ACU-compatible reduction orderings In: Information Processing Letters [67], 43-49 | Journal Article | ||||||
1997 | Cancellative Abelian Monoids in Refutational Theorem Proving Universität des Saarlandes | Thesis - PhD thesis | ||||||
1992 | Semantics of Order-Sorted Specifications In: Theoretical Computer Science [94], 1-35 | Journal Article | ||||||
1 |
| |||||||
1 |
| |||||||
1 |
| |||||||
1 |
|