 | 2000 |
|---|
| 23 |       | Wolfgang Blochinger,
Reinhard Bündgen,
Andreas Heinemann:
Dependable High Performance Computing on a Parallel Sysplex Cluster.
PDPTA 2000 |
| 1998 |
|---|
| 22 | | Reinhard Bündgen:
Termersetzungssysteme - Theorie, Implementierung, Anwendung.
Vieweg 1998: I-XIV, 1-228 |
| 21 | | Reinhard Bündgen,
Alfons Geser:
Formale Hardware-Verifikation mit Termersetzung.
KI 12(4): 19-24 (1998) |
| 1996 |
|---|
| 20 |  | Reinhard Bündgen:
Proof Transformation for Non-Compatible Rewriting.
AISMC 1996: 160-175 |
| 19 | | Reinhard Bündgen,
Werner Lauterbach:
Combining Reductions and Computations in ReDuX.
AMAST 1996: 633-636 |
| 18 | | Reinhard Bündgen,
Manfred Göbel,
Wolfgang Küchlin:
A Master-Slave Approach to Parallel Term Rewriting on a Hierarchical Multiprocessor.
DISCO 1996: 183-194 |
| 17 | | Reinhard Bündgen,
Wolfgang Küchlin,
Werner Lauterbach:
Verification of the Sparrow Processor.
ECBS 1996: 86- |
| 16 | | Reinhard Bündgen,
Carsten Sinz,
Jochen Walter:
ReDuX 1.5: New Facets of Rewriting.
RTA 1996: 412-415 |
| 15 | | Reinhard Bündgen,
Manfred Göbel,
Wolfgang Küchlin:
Strategy Compliant Multi-Threaded Term Completion.
J. Symb. Comput. 21(4): 475-505 (1996) |
| 14 | | Reinhard Bündgen:
Buchberger's Algorithm: The Term Rewriter's Point of View.
Theor. Comput. Sci. 159(2): 143-190 (1996) |
| 1995 |
|---|
| 13 | | Reinhard Bündgen,
Werner Lauterbach:
Experiments with Partial Evaluation Domains for Rewrite Specifications.
COMPASS/ADT 1995: 125-142 |
| 12 | | Reinhard Bündgen,
Manfred Göbel,
Wolfgang Küchlin:
Parallel ReDuX -> PaReDuX.
RTA 1995: 408-413 |
| 1994 |
|---|
| 11 | | Reinhard Bündgen:
Combining Computer Algebra and Rule Based Reasoning.
AISMC 1994: 209-223 |
| 10 | | Reinhard Bündgen:
On Pot, Pans and Pudding or How to Discover Generalised Critical Pairs.
CADE 1994: 693-707 |
| 9 | | Reinhard Bündgen:
Preserving Confluence for Rewrite Systems with Built-in Operations.
CTRS 1994: 71-88 |
| 8 | | Reinhard Bündgen,
Manfred Göbel,
Wolfgang Küchlin:
A Fine-Grained Parallel Completion Procedure.
ISSAC 1994: 269-277 |
| 1993 |
|---|
| 7 | | Reinhard Bündgen:
Reduce the Redex -> ReDuX.
RTA 1993: 446-450 |
| 1992 |
|---|
| 6 | | Reinhard Bündgen,
Hasko Eckhardt:
A Fast Algorithm for Ground Normal Form Analysis.
ALP 1992: 291-305 |
| 5 | | Reinhard Bündgen:
Buchberger's Algorithm: The Term Rewriter's Point of View (Extended Abstract).
ICALP 1992: 380-391 |
| 1991 |
|---|
| 4 | | Reinhard Bündgen:
Completion of Integral Polynomials by AC-Term Completion.
ISSAC 1991: 70-78 |
| 3 | | Reinhard Bündgen:
Simulation Buchberger's Algorithm by Knuth-Bendix Completion.
RTA 1991: 386-397 |
| 1990 |
|---|
| 2 | | Reinhard Bündgen:
Applying Term Rewriting Methods to Finite Groups.
ALP 1990: 332-346 |
| 1989 |
|---|
| 1 | | Reinhard Bündgen,
Wolfgang Küchlin:
Computing Ground Reducability and Inductively Complete Positions.
RTA 1989: 59-75 |
Data released under the ODC-BY 1.0 license — See also our legal information page