Searching for authors named "Olaf Bachmann" – sorted by Relevance.
10 documents found, showing 1 through 10.
-
MAXIZIC - a MAXIMA interface to IZIC
- …MAXIZIC - a MAXIMA interface to IZIC version 1.15 Olaf Bachmann y RIACA Kruislaan 419, 1098 VA…
- Add To MetaCart
-
MPCR: An Efficient and Flexible Chains of Recurrences Server
- …MPCR: An Efficient and Flexible Chains of Recurrences Server Olaf Bachmann Department…
- Cited by 2 (0 self) – Add To MetaCart
-
Chains of Recurrences for Functions of Two Variables and Their Application to Surface Plotting
- … Olaf Bachmann 1 Introduction When generating curves or surfaces of closed-form mathematical functions…
- Cited by 5 (2 self) – Add To MetaCart
-
The SymbolicData Project
- … of Computer Algebra Software Olaf Bachmann Department of Mathematics University of Kaiserslautern, Germany…
- Add To MetaCart
-
Monomial Representations for Gröbner Bases Computations
- …Monomial Representations for Grobner Bases Computations Olaf Bachmann Hans Schonemann Centre…
- Cited by 8 (0 self) – Add To MetaCart
-
From Honest to Intelligent Plotting
- …From Honest to Intelligent Plotting Ron Avitzur Olaf Bachmann y Norbert Kajler z RIACA…
- Cited by 9 (3 self) – Add To MetaCart
-
MPP: A Framework for Distributed Polynomial Computations
- …MPP: A Framework for Distributed Polynomial Computations Olaf Bachmann y Hans Schonemann Centre…
- Cited by 4 (0 self) – Add To MetaCart
-
A Proposal for Syntactic Data Integration for Math Protocols
- …Abstract A Proposal for Syntactic Data Integration for Math Protocols Olaf Bachmann Hans…
- Cited by 10 (2 self) – Add To MetaCart
-
Chains of Recurrences - a method to expedite the evaluation of closed-form functions
- …Chains of Recurrences - a method to expedite the evaluation of closed-form functions Olaf…
- Add To MetaCart
-
Chains of Recurrences - a method to expedite the evaluation of closed-form functions
- …Chains of Recurrences - a method to expedite the evaluation of closed-form functions Olaf…
- Cited by 30 (6 self) – Add To MetaCart
Showing 1 through 10.
