Travelled to:1 × Austria
1 × Canada
1 × Germany
2 × France
2 × Italy
2 × USA
Collaborated with:∅ W.Küchlin H.Eckhardt C.Sinz J.Walter M.Göbel
Talks about:algorithm (3) rewrit (3) buchberg (2) complet (2) ground (2) reduc (2) term (2) generalis (1) parallel (1) analysi (1)
Person: Reinhard Bündgen
DBLP: B=uuml=ndgen:Reinhard
Contributed to:
19961995
19941993
1992
1992199119901989Wrote 9 papers:
- RTA-1996-BundgenSW
- ReDuX 1.5: New Facets of Rewriting (RB, CS, JW), pp. 412–415.
- RTA-1995-BundgenGK #parallel
- Parallel ReDuX -> PaReDuX (RB, MG, WK), pp. 408–413.
- CADE-1994-Bundgen #how #on the
- On Pot, Pans and Pudding or How to Discover Generalised Critical Pairs (RB), pp. 693–707.
- RTA-1993-Bundgen
- Reduce the Redex → ReDuX (RB), pp. 446–450.
- ALP-1992-BundgenE #algorithm #analysis #normalisation #performance
- A Fast Algorithm for Ground Normal Form Analysis (RB, HE), pp. 291–305.
- ICALP-1992-Bundgen #algorithm #perspective #term rewriting
- Buchberger’s Algorithm: The Term Rewriter’s Point of View (RB), pp. 380–391.
- RTA-1991-Bundgen #algorithm #simulation
- Simulation Buchberger’s Algorithm by Knuth-Bendix Completion (RB), pp. 386–397.
- ALP-1990-Bundgen #finite #term rewriting
- Applying Term Rewriting Methods to Finite Groups (RB), pp. 332–346.
- RTA-1989-BundgenK
- Computing Ground Reducability and Inductively Complete Positions (RB, WK), pp. 59–75.