Conferences in DBLP

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

1. 
   A Gröbner free alternative to solving and a geometric analogue to Cook's thesis. [Citation Graph (, )][DBLP]
   
   
2. 
   Symbolic and algebraic methods in computational origami: invited talk. [Citation Graph (, )][DBLP]
   
   
3. 
   Automatic synthesis of high performance mathematical programs. [Citation Graph (, )][DBLP]
   
   
4. 
   Algorithms for regular solutions of higher-order linear differential systems. [Citation Graph (, )][DBLP]
   
   
5. 
   Fraction-free computation of simultaneous padé approximants. [Citation Graph (, )][DBLP]
   
   
6. 
   Chebyshev expansions for solutions of linear differential equations. [Citation Graph (, )][DBLP]
   
   
7. 
   Computation of the (n-1)-st Koszul Homology of monomialideals and related algorithms. [Citation Graph (, )][DBLP]
   
   
8. 
   Faster real feasibility via circuit discriminants. [Citation Graph (, )][DBLP]
   
   
9. 
   Fast algorithms for differential equations in positive characteristic. [Citation Graph (, )][DBLP]
   
   
10. 
    Memory efficient scheduling of Strassen-Winograd's matrix multiplication algorithm. [Citation Graph (, )][DBLP]
    
    
11. 
    Fast simplifications for Tarski formulas. [Citation Graph (, )][DBLP]
    
    
12. 
    On delineability of varieties in CAD-based quantifier elimination with two equational constraints. [Citation Graph (, )][DBLP]
    
    
13. 
    Lower bounds for zero-dimensional projections. [Citation Graph (, )][DBLP]
    
    
14. 
    Liouvillian solutions of irreducible linear difference equations. [Citation Graph (, )][DBLP]
    
    
15. 
    Computing cylindrical algebraic decomposition via triangular decomposition. [Citation Graph (, )][DBLP]
    
    
16. 
    Root isolation for bivariate polynomial systems with local generic position method. [Citation Graph (, )][DBLP]
    
    
17. 
    A non-holonomic systems approach to special function identities. [Citation Graph (, )][DBLP]
    
    
18. 
    Size of coefficients of lexicographical Groöbner bases: the zero-dimensional, radical and bivariate case. [Citation Graph (, )][DBLP]
    
    
19. 
    Fast arithmetics in artin-schreier towers over finite fields. [Citation Graph (, )][DBLP]
    
    
20. 
    On finding multiplicities of characteristic polynomial factors of black-box matrices. [Citation Graph (, )][DBLP]
    
    
21. 
    Multihomogeneous resultant formulae for systems with scaled support. [Citation Graph (, )][DBLP]
    
    
22. 
    Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases. [Citation Graph (, )][DBLP]
    
    
23. 
    Analyzing group based matrix multiplication algorithms. [Citation Graph (, )][DBLP]
    
    
24. 
    A new algorithm for computing certified numerical approximations of the roots of a zero-dimensional system. [Citation Graph (, )][DBLP]
    
    
25. 
    Submersive rational difference systems and their accessibility. [Citation Graph (, )][DBLP]
    
    
26. 
    Variant real quantifier elimination: algorithm and application. [Citation Graph (, )][DBLP]
    
    
27. 
    Schemes for deterministic polynomial factoring. [Citation Graph (, )][DBLP]
    
    
28. 
    On factorization of multivariate polynomials over algebraic number and function fields. [Citation Graph (, )][DBLP]
    
    
29. 
    High order derivatives and decomposition of multivariate polynomials. [Citation Graph (, )][DBLP]
    
    
30. 
    Solution of algebraic riccati equations using the sum of roots. [Citation Graph (, )][DBLP]
    
    
31. 
    Biased tadpoles: a fast algorithm for centralizers in large matrix groups. [Citation Graph (, )][DBLP]
    
    
32. 
    Principal intersection and bernstein-sato polynomial of an affine variety. [Citation Graph (, )][DBLP]
    
    
33. 
    Computations modulo regular chains. [Citation Graph (, )][DBLP]
    
    
34. 
    Isolating real roots of real polynomials. [Citation Graph (, )][DBLP]
    
    
35. 
    Solutions of polynomial systems derived from the steady cavity flow problem. [Citation Graph (, )][DBLP]
    
    
36. 
    Parallel sparse polynomial multiplication using heaps. [Citation Graph (, )][DBLP]
    
    
37. 
    H-LLL: using householder inside LLL. [Citation Graph (, )][DBLP]
    
    
38. 
    Computation schemes for splitting fields of polynomials. [Citation Graph (, )][DBLP]
    
    
39. 
    A skew polynomial approach to integro-differential operators. [Citation Graph (, )][DBLP]
    
    
40. 
    Space- and time-efficient polynomial multiplication. [Citation Graph (, )][DBLP]
    
    
41. 
    Interoperating between computer algebra systems: computing homology of groups with kenzo and GAP. [Citation Graph (, )][DBLP]
    
    
42. 
    Computation of inverses in residue class rings of parametric polynomial ideals. [Citation Graph (, )][DBLP]
    
    
43. 
    Large matrix, small rank. [Citation Graph (, )][DBLP]
    
    
44. 
    Computing with abstract matrix structures. [Citation Graph (, )][DBLP]
    
    
45. 
    Integer matrix rank certification. [Citation Graph (, )][DBLP]
    
    
46. 
    Real root isolation for tame elementary functions. [Citation Graph (, )][DBLP]
    
    
47. 
    An iterative method for calculating approximate GCD of univariate polynomials. [Citation Graph (, )][DBLP]
    
    
48. 
    The number of decomposable univariate polynomials. extended abstract. [Citation Graph (, )][DBLP]
    
    
49. 
    The approximate irreducible factorization of a univariate polynomial: revisited. [Citation Graph (, )][DBLP]
    
    
50. 
    Efficient computation of order bases. [Citation Graph (, )][DBLP]
    
    
51. 
    Interactions between computer algebra (Gröbner bases) and cryptology. [Citation Graph (, )][DBLP]
    
    
52. 
    Describing convex semialgebraic sets by linear matrix inequalities. [Citation Graph (, )][DBLP]
    
    
53. 
    Exact numerical computation in algebra and geometry. [Citation Graph (, )][DBLP]