ISSAC B

48 papers

YearTitle / Authors
2001A generalized Graeffe's iteration for evaluating polynomials and rational functions.
Luca Gemignani
2001A linear space algorithm for computing the herite normal form.
Daniele Micciancio, Bogdan Warinschi
2001A multivariate Weierstrass iterative rootfinder.
Olivier Ruatta
2001A probabilistic algorithm to test local algebraic observability in polynomial time.
Alexandre Sedoglavic
2001Algorithms for trigonometric polynomials.
Jamie Mulholland, Michael B. Monagan
2001Approximate multivariate polynomial factorization based on zero-sum relations.
Tateaki Sasaki
2001Black box methods for least squares problems.
B. David Saunders
2001Computation of minimal generators of ideals of fat points.
Francesca Cioffi, Ferruccio Orecchia
2001Computation of the degree of rational maps between curves.
J. Rafael Sendra, Franz Winkler
2001Computation of the radical of polynomial ideals over fields of arbitrary characteristic.
Elisabetta Fortuna, Patrizia M. Gianni, Barry M. Trager
2001Computing all factorizations in ***.
Howard Cheng, George Labahn
2001Diagnosing and correcting student's misconceptions in an educational computer algebra system.
Neven Jurkovic
2001Dimensional analysis in computer algebra.
Raya Khanin
2001Discrete comprehensive Gröbner bases.
Yosuke Sato, Akira Suzuki
2001Families of estimable terms.
Massimo Caboara, Lorenzo Robbiano
2001Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm.
Emmanuel Thomé
2001Generic ideals and Moreno-Socías conjucture.
Edith Aguirre, Abdul Salam Jarrah, Reinhard C. Laubenbacher
2001Hybrid computation.
Jean Della Dora, Aude Maignan, Mihaela Mirica-Ruse, Sergio Yovine
2001Hybrid sparse resultant matrices for bivariate systems.
Carlos D'Andrea, Ioannis Z. Emiris
2001Hybrid system for multi-language and multi-environment generation of numerical codes.
Joze Korelc
2001IAMC architecture and prototyping: a progress report.
Paul S. Wang, Simon Gray, Norbert Kajler, Dongdai Lin, Weidong Liao, Xiao Zou
2001Irreducible trinomials over finite fields.
Joachim von zur Gathen
2001Maple's evaluation process as constraint contextual rewriting.
Alessandro Armando, Clemens Ballarin
2001Minimal decomposition of indefinite hypergeometric sums.
Sergei A. Abramov, Marko Petkovsek
2001Modeling inheritance as coercion in a symbolic computation system.
César Domínguez, Julio Rubio
2001New complexity bounds for cylindrical decompositions of sub-pfaffian sets.
Savvas Pericleous, Nicolai N. Vorobjov Jr.
2001On Liouvillian solutions of linear differential equations of order 4 and 5.
Olivier Cormier
2001On a parallel Lehmer-Euclid GCD algorithm.
Sidi Mohamed Sedjelmaci
2001On computational properties of chains of recurrences.
Eugene V. Zima
2001On computer-assisted classification of coupled integrable equations.
Mikhail V. Foursov, Marc Moreno Maza
2001On propagation of equational constraints in CAD-based quantifier elimination.
Scott McCallum
2001On solutions of linear functional systems.
Sergei A. Abramov, Manuel Bronstein
2001On the Barnes function.
Victor Adamchik
2001PARDI!.
François Boulier, François Lemaire, Marc Moreno Maza
2001Polynomial root finding using iterated Eigenvalue computation.
Steven Fortune
2001Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, ISSAC 2001, ORCCA & University of Western Ontario, London, Ontario, Canada, July 22-25, 2001
Erich L. Kaltofen, Gilles Villard
2001Remarks on Gröbner basis for ideals under composition.
Mingsheng Wang, Zhuojun Liu
2001Residual resultant over the projective plane and the implicitization problem.
Laurent Busé
2001Scalable parallel coset enumeration using bulk definition.
Gene Cooperman, Victor Grinberg
2001Semi-numerical determination of irreducible branches of a reduced space curve.
André Galligo, David Rupprecht
2001Solvability by radicals from an algorithmic point of view.
Guillaume Hanrot, François Morain
2001Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures.
Harry B. Hunt III, Madhav V. Marathe, Richard Edwin Stearns
2001Symbolic-interval cooperation in constraint programming.
Laurent Granvilliers, Éric Monfroy, Frédéric Benhamou
2001The membership problem for ideals of binomial skew polynomial rings.
Jinwang Liu, Zhuojun Liu, Xiaoqi Liu, Mingsheng Wang
2001Towards approximations which preserve integrals.
Elizabeth L. Mansfield, Peter E. Hydon
2001Towards factoring bivariate approximate polynomials.
Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt
2001Unirational fields of transcendence degree one and functional decomposition.
Jaime Gutierrez, Rosario Rubio San Miguel, David Sevilla
2001Univariate polynomials: nearly optimal algorithms for factorization and rootfinding.
Victor Y. Pan