The SCEAS System
Navigation Menu

Conferences in DBLP

International Symposium on Symbolic and Algebraic Computation (ISSAC) (issac)
2001 (conf/issac/2001)

  1. Sergei A. Abramov, Manuel Bronstein
    On solutions of linear functional systems. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:1-6 [Conf]
  2. Sergei A. Abramov, Marko Petkovsek
    Minimal decomposition of indefinite hypergeometric sums. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:7-14 [Conf]
  3. Victor Adamchik
    On the Barnes function. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:15-20 [Conf]
  4. 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]
  5. Carlos D'Andrea, Ioannis Z. Emiris
    Hybrid sparse resultant matrices for bivariate systems. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:24-31 [Conf]
  6. Alessandro Armando, Clemens Ballarin
    Maple's evaluation process as constraint contextual rewriting. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:32-37 [Conf]
  7. François Boulier, François Lemaire, Marc Moreno Maza
    PARDI!. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:38-47 [Conf]
  8. Laurent Busé
    Residual resultant over the projective plane and the implicitization problem. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:48-55 [Conf]
  9. Massimo Caboara, Lorenzo Robbiano
    Families of estimable terms. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:56-63 [Conf]
  10. Howard Cheng, George Labahn
    Computing all factorizations in ***. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:64-71 [Conf]
  11. Francesca Cioffi, Ferruccio Orecchia
    Computation of minimal generators of ideals of fat points. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:72-76 [Conf]
  12. Gene Cooperman, Victor Grinberg
    Scalable parallel coset enumeration using bulk definition. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:77-84 [Conf]
  13. 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]
  14. 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]
  15. Jean Della Dora, Aude Maignan, Mihaela Mirica-Ruse, Sergio Yovine
    Hybrid computation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:101-108 [Conf]
  16. 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]
  17. 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]
  18. Steven Fortune
    Polynomial root finding using iterated Eigenvalue computation. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:121-128 [Conf]
  19. 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]
  20. 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]
  21. Luca Gemignani
    A generalized Graeffe's iteration for evaluating polynomials and rational functions. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:143-149 [Conf]
  22. 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]
  23. 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]
  24. 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]
  25. 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]
  26. 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]
  27. 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]
  28. Raya Khanin
    Dimensional analysis in computer algebra. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:201-208 [Conf]
  29. 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]
  30. Elizabeth L. Mansfield, Peter E. Hydon
    Towards approximations which preserve integrals. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:217-222 [Conf]
  31. Scott McCallum
    On propagation of equational constraints in CAD-based quantifier elimination. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:223-231 [Conf]
  32. 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]
  33. Wang Mingsheng, Zhuojun Liu
    Remarks on Gröbner basis for ideals under composition. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:237-244 [Conf]
  34. Jamie Mulholland, Michael B. Monagan
    Algorithms for trigonometric polynomials. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:245-252 [Conf]
  35. Victor Y. Pan
    Univariate polynomials: nearly optimal algorithms for factorization and rootfinding. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:253-267 [Conf]
  36. 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]
  37. Olivier Ruatta
    A multivariate Weierstrass iterative rootfinder. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:276-283 [Conf]
  38. Tateaki Sasaki
    Approximate multivariate polynomial factorization based on zero-sum relations. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:284-291 [Conf]
  39. Yosuke Sato, Akira Suzuki
    Discrete comprehensive Gröbner bases. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:292-296 [Conf]
  40. B. David Saunders
    Black box methods for least squares problems. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:297-302 [Conf]
  41. Sidi Mohammed Sedjelmaci
    On a parallel Lehmer-Euclid GCD algorithm. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:303-308 [Conf]
  42. Alexandre Sedoglavic
    A probabilistic algorithm to test local algebraic observability in polynomial time. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:309-317 [Conf]
  43. 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]
  44. 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]
  45. Joachim von zur Gathen
    Irreducible trinomials over finite fields. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:332-336 [Conf]
  46. 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]
  47. Eugene V. Zima
    On computational properties of chains of recurrences. [Citation Graph (0, 0)][DBLP]
    ISSAC, 2001, pp:345- [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002