Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDACM SIGSAM Bulletin, Volume 37
Volume 37, Number 1, March 2003
- Ehrenfried Walter von Tschirnhaus, R. F. Green:
A method for removing all intermediate terms from a given equation. 1-3
- Richard J. Fateman:
Comparing the speed of programs for sparse polynomial multiplication. 4-15
- Philippe Gimenez
:
Abstracts of the eighth Spanish meeting on computer algebra and applications: EACA-2002. 16-27
- Matt Davison:
Review of risk management: value at risk and beyond, edited by M.A.H. Dempster. Cambridge University Press 2002. 28-29
Volume 37, Number 2, June 2003
- Bodo Renschuch, Hartmut Roloff, Georgij G. Rasputin, Michael Abramson:
Contributions to constructive polynomial ideal theory XXIII: forgotten works of Leningrad mathematician N. M. Gjunter on polynomial ideal theory. 35-48
- Michael P. Barnett:
Symbolic computation of integrals by recurrence. 49-63
Volume 37, Number 3, September 2003
- Olga Caprotti:
International symposium on symbolic and algebraic computation poster abstracts 2003. 65-89 - Victor S. Adamchik, David J. Jeffrey:
Polynomial transformations of Tschirnhaus, Bring and Jerrard. 90-94
- Bert Jüttler, Josef Schicho, Mohamed Shalaby:
C1 spline implicitization of planar curves. 65 - Olga Caprotti:
International symposium on symbolic and algebraic computation poster abstracts 2003. 65 - Fabrizio Caruso:
Interpolation in symbolic summation. 66 - Arthur D. Chtcherba, Deepak Kapur:
On the relationship between the Dixon-based resultant construction and the supports of polynomial systems. 66-67 - Robert M. Corless, Hiroshi Kai, Stephen M. Watt:
Approximate computation of pseudovarieties. 67-71 - Ruyong Feng, Xiao-Shan Gao:
Polynomial solutions for first order ODEs with constant coefficients. 71-72 - Masaaki Kanno, Malcolm C. Smith:
Validated numerical methods for systems and control engineering. 72-73 - Manuel Kauers:
Computing limits of sequences. 74-77 - Viktor Levandovskyy, Hans Schönemann:
Using computer algebra system SINGULAR: PLURAL for computations in noncommutative polynomial algebras. 77-78 - Ilias S. Kotsireas, Edmond Lau, Richard Voino:
Exact implicitization of polynomial curves and surfaces. 78 - Ludovic Meunier:
MAD: a flexible system for authoring mathematical documents. 79-81 - Masayuki Noro, Kazuhiro Yokoyama:
Implementation of prime decomposition of polynomial ideals over small finite fields. 81-82 - Clément Pernet, Zhendong Wan:
LU based algorithms for characteristic polynomial over a finite field. 83-84 - Tianjiao Wu:
On optimization problems. 87-88 - Burkhard Zimmermann:
A Sister Celine type algorithm for definite summation and integration. 89
- Victor S. Adamchik, David J. Jeffrey:
Polynomial transformations of Tschirnhaus, Bring and Jerrard. 90-94
Volume 37, Number 4, December 2003
- Christopher W. Brown:
QEPCAD B: a program for computing with semi-algebraic sets using CADs. 97-108 - Richard J. Fateman:
Memory cache and lisp: faster list processing via automatically rearranging memory. 109-116
- Tanush Shaska:
Computational algebra and algebraic curves. 117-124
- Alex Buchel:
Review of D-Branes by Clifford V. Johnson. Cambridge University Press 2002. 125-127
a service of 
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.
last updated on 2024-05-10 19:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
