#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1993

1998

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Beatrice Amrhein, Oliver Gloor, Wolfgang Küchlin
- ISSAC
- 1996

We investigate sources of parallelism in the Grobner Basis algorithm for their practical use on the desk-top. Our execution environment is a standard multi-processor workstation, and our parallel programming environment is PARSAC-2 on top of a multi-t breaded operating system. We invest igate the performance of two main variants of our master parallel… (More)

- Beatrice Amrhein, Oliver Gloor, Wolfgang Küchlin
- Theor. Comput. Sci.
- 1997

The Grr obner Walk is a basis conversion method proposed by Collart, Kalkbrener, and Mall. It converts a given Grr obner basis G of a (possibly positive dimensional) polynomial ideal I to a Grr obner basis G 0 of I with respect to another term order. The target Grr obner basis is approached in several steps (the Walk), each performing a simpler Grr obner… (More)

- Beatrice Amrhein, Oliver Gloor, Roman Maeder
- J. Symb. Comput.
- 1997

- Andreas Dolzmann, Oliver Gloor, Thomas Sturm
- ISSAC
- 1998

Special-purpose quanti er elimination procedures for problems of low degree using virtual substitution of test terms have recently turned out to be applicable to a variety of non-trivial non-academic problems. We study parallel algorithms based on these methods for several parallelization environments: a Cray YMP4/T3D, a workstation cluster, and a… (More)

The Grr obner Walk is an algorithm which converts a given Grr obner basis of a polynomial ideal I of arbitrary dimension to a Grr obner basis of I with respect to another term order. The conversion is done in several steps (the walk) following a path in the Grr obner fan of I. We report on our experiences with a rst implementation of the walk connected with… (More)

- Beatrice Amrhein, Oliver Gloor, Wolfgang Küchlin
- DISCO
- 1996

The Grr obner Walk is an algorithm that converts a given Grr obner basis of a polynomial ideal I of arbitrary dimension to a Grr obner basis of I with respect to another term order. The conversion is done in several steps (the walk) following a path in the Grr obner fan of I. We report on our experiences with an implementation of the walk. We discuss… (More)

- Oliver Gloor, Beatrice Amrhein, Roman Maeder
- University Education Uses of Visualization in…
- 1993

- ‹
- 1
- ›