Conferences in DBLP
Sergei A. Abramov , Manuel Bronstein On solutions of linear functional systems. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:1-6 [Conf ] Sergei A. Abramov , Marko Petkovsek Minimal decomposition of indefinite hypergeometric sums. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:7-14 [Conf ] Victor Adamchik On the Barnes function. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:15-20 [Conf ] Edith Aguirre , Abdul Salam Jarrah , Reinhard C. Laubenbacher Generic ideals and Moreno-Socías conjucture. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:21-23 [Conf ] Carlos D'Andrea , Ioannis Z. Emiris Hybrid sparse resultant matrices for bivariate systems. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:24-31 [Conf ] Alessandro Armando , Clemens Ballarin Maple's evaluation process as constraint contextual rewriting. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:32-37 [Conf ] François Boulier , François Lemaire , Marc Moreno Maza PARDI!. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:38-47 [Conf ] Laurent Busé Residual resultant over the projective plane and the implicitization problem. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:48-55 [Conf ] Massimo Caboara , Lorenzo Robbiano Families of estimable terms. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:56-63 [Conf ] Howard Cheng , George Labahn Computing all factorizations in ***. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:64-71 [Conf ] Francesca Cioffi , Ferruccio Orecchia Computation of minimal generators of ideals of fat points. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:72-76 [Conf ] Gene Cooperman , Victor Grinberg Scalable parallel coset enumeration using bulk definition. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:77-84 [Conf ] Robert M. Corless , Mark Giesbrecht , Mark van Hoeij , Ilias S. Kotsireas , Stephen M. Watt Towards factoring bivariate approximate polynomials. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:85-92 [Conf ] Olivier Cormier On Liouvillian solutions of linear differential equations of order 4 and 5. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:93-100 [Conf ] Jean Della Dora , Aude Maignan , Mihaela Mirica-Ruse , Sergio Yovine Hybrid computation. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:101-108 [Conf ] César Domínguez , Julio Rubio Modeling inheritance as coercion in a symbolic computation system. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:109-115 [Conf ] Elisabetta Fortuna , Patrizia M. Gianni , Barry M. Trager Computation of the radical of polynomial ideals over fields of arbitrary characteristic. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:116-120 [Conf ] Steven Fortune Polynomial root finding using iterated Eigenvalue computation. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:121-128 [Conf ] Mikhail V. Foursov , Marc Moreno Maza On computer-assisted classification of coupled integrable equations. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:129-136 [Conf ] André Galligo , David Rupprecht Semi-numerical determination of irreducible branches of a reduced space curve. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:137-142 [Conf ] Luca Gemignani A generalized Graeffe's iteration for evaluating polynomials and rational functions. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:143-149 [Conf ] Laurent Granvilliers , Eric Monfroy , Frédéric Benhamou Symbolic-interval cooperation in constraint programming. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:150-166 [Conf ] Jaime Gutierrez , Rosario Rubio San Miguel , David Sevilla Unirational fields of transcendence degree one and functional decomposition. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:167-174 [Conf ] Guillaume Hanrot , François Morain Solvability by radicals from an algorithmic point of view. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:175-182 [Conf ] Harry B. Hunt III , Madhav V. Marathe , Richard Edwin Stearns Strongly-local reductions and the complexity/efficient approximability of algebra and optimization on abstract algebraic structures. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:183-191 [Conf ] Liu Jinwang , Zhuojun Liu , Liu Xiaoqi , Wang Mingsheng The membership problem for ideals of binomial skew polynomial rings. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:192-195 [Conf ] Neven Jurkovic Diagnosing and correcting student's misconceptions in an educational computer algebra system. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:195-200 [Conf ] Raya Khanin Dimensional analysis in computer algebra. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:201-208 [Conf ] Joze Korelc Hybrid system for multi-language and multi-environment generation of numerical codes. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:209-216 [Conf ] Elizabeth L. Mansfield , Peter E. Hydon Towards approximations which preserve integrals. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:217-222 [Conf ] Scott McCallum On propagation of equational constraints in CAD-based quantifier elimination. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:223-231 [Conf ] Daniele Micciancio , Bogdan Warinschi A linear space algorithm for computing the herite normal form. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:231-236 [Conf ] Wang Mingsheng , Zhuojun Liu Remarks on Gröbner basis for ideals under composition. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:237-244 [Conf ] Jamie Mulholland , Michael B. Monagan Algorithms for trigonometric polynomials. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:245-252 [Conf ] Victor Y. Pan Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:253-267 [Conf ] Savvas Pericleous , Nicolai Vorobjov New complexity bounds for cylindrical decompositions of sub-pfaffian sets. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:268-275 [Conf ] Olivier Ruatta A multivariate Weierstrass iterative rootfinder. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:276-283 [Conf ] Tateaki Sasaki Approximate multivariate polynomial factorization based on zero-sum relations. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:284-291 [Conf ] Yosuke Sato , Akira Suzuki Discrete comprehensive Gröbner bases. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:292-296 [Conf ] B. David Saunders Black box methods for least squares problems. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:297-302 [Conf ] Sidi Mohammed Sedjelmaci On a parallel Lehmer-Euclid GCD algorithm. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:303-308 [Conf ] Alexandre Sedoglavic A probabilistic algorithm to test local algebraic observability in polynomial time. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:309-317 [Conf ] J. Rafael Sendra , Franz Winkler Computation of the degree of rational maps between curves. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:317-322 [Conf ] Emmanuel Thomé Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:323-331 [Conf ] Joachim von zur Gathen Irreducible trinomials over finite fields. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:332-336 [Conf ] Paul S. Wang , Simon Gray , Norbert Kajler , Dongdai Lin , Weidong Liao , Xiao Zou IAMC architecture and prototyping: a progress report. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:337-344 [Conf ] Eugene V. Zima On computational properties of chains of recurrences. [Citation Graph (0, 0)][DBLP ] ISSAC, 2001, pp:345- [Conf ]