default search action
ACM SIGSAM Bulletin, Volume 34
Volume 34, Number 1, March 2000
- María José González-López, Laureano González-Vega, Carlo Traverso, Alberto Zanoni:
Gröbner bases specialization through Hilbert functions: the homogeneous case. 1-8 - Tateaki Sasaki, Daiju Inaba:
Hensel construction of F(x, u1, ..., xl) l ≥ 2 at a singular point and its applications. 9-17 - Kevin G. Hare:
Rapid computation of Bernoulli and related numbers. 18-19 - Birkett Huber:
Computing gröbner fans of toric ideals. 19-20 - Hiroshi Kai, Matu-Tarow Noda:
Hybrid computation of bivariate rational interpolation. 20-21 - Nainn-Ping Ke:
Symbolic and algebraic computation in robust stability analysis. 21 - Robert H. Lewis:
Comparison of polynomial-oriented computer algebra systems. 24 - Hirokazu Murao:
2W-aray algorithm for extended problem of integer GCD. 25 - Bogdan A. Popov:
Optimal starting approximation and iterative algorithm for inverse error function. 25-26 - Yosuke Sato:
Parallel computation of boolean gröbner bases. 27-28 - Harrison Tsai:
Weyl closure of a D-ideal. 29-30 - Nicolas M. Thiéry:
algebraic invariants of graphs: a computer aided study. 29 - Volker Weispfenning:
Deciding linear-exponential problems. 30-31
Volume 34, Number 2, June 2000
- Mike Dewar:
OpenMath: an overview. 2-5 - David Carlisle:
OpenMath, MathML, and XSL. 6-11 - James H. Davenport:
On writing OpenMath content dictionaries. 12-15 - James H. Davenport:
A small OpenMath type system. 16-21 - Hélène Prieto, Stéphane Dalmas, Yves Papegay:
Mathematica as an OpenMath application. 22-26 - Arrigo Triulzi:
OpenMath support under CSL-hosted REDUCE. 27-30 - Luis Alvarez Sobreviela:
A reduce-based OpenMath ↔ MathML translator. 31-32 - Olga Caprotti, Arjeh M. Cohen, Manfred Riem:
JAVA Phrasebooks for computer algebra and automated deduction. 33-37 - Laurent Dirat:
JOME, a software component for interactive and distributed mathematics. 38-42 - Michael Kohlhase:
OMDoc: an infrastructure for OpenMath content dictionary information. 43-48 - Francis J. Wright:
Interactive mathematics via the Web using MathML. 49-57 - Robert M. Corless, David J. Jeffrey, Stephen M. Watt, James H. Davenport:
"According to Abramowitz and Stegun" or arccoth needn't be uncouth. 58-65 - Andreas Strotmann, Ladislav J. Kohout:
OpenMath: compositionality achieved at last. 66-72
Volume 34, Number 3, September 2000
- Christian Schulzky, Astrid Franz, Karl-Heinz Hoffmann:
Resistance scaling and random walk dimensions for finitely ramified Sierpinski carpets. 1-8 - Nicolas M. Thiéry:
Algebraic invariants of graphs; a study based on computer exploration. 9-20 - Mark Giesbrecht:
East Coast Computer Algebra Day. 21-27 - Robert M. Corless:
Southern Ontario Numerical Analysis Day. 28-31
Volume 34, Number 4, December 2000
- Sergei A. Abramov:
A note on the number of division steps in the Euclidean algorithm. 1-2 - Rainer Steinwandt:
On computing a separating transcendence basis. 3-6 - Robert M. Corless:
An elementary solution of a minimax problem arising in algorithms for automatic mesh selection. 7-15 - Christopher Essex, Matt Davison, Christian Schulzky:
Numerical monsters. 16-32
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.