Conferences in DBLP
Joachim von zur Gathen Who was who in polynomial factorization: 1. [Citation Graph (0, 0)][DBLP ] Conf ] Hennie Poulisse Computational communicative algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Christopher Umans Group-theoretic algorithms for matrix multiplication. [Citation Graph (0, 0)][DBLP ] Conf ] Anna Maria Bigatti , Lorenzo Robbiano CoCoA: a system for computations in commutative algebra. [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen , Lihong Zhi Hybrid symbolic-numeric computation. [Citation Graph (0, 0)][DBLP ] Conf ] Marc Moreno Maza Triangular decompositions of polynomial systems: from theory to practice. [Citation Graph (0, 0)][DBLP ] Conf ] Hirotachi Abo , Chris Peterson Implementation of Kumar's correspondence. [Citation Graph (0, 0)][DBLP ] Conf ] Sergei A. Abramov On the summation of P-recursive sequences. [Citation Graph (0, 0)][DBLP ] Conf ] Jonathan M. Borwein , Chris H. Hamilton Symbolic computation of multidimensional Fenchel conjugates. [Citation Graph (0, 0)][DBLP ] Conf ] Alin Bostan , Frédéric Chyzak , Bruno Salvy , Thomas Cluzeau Low complexity algorithms for linear recurrences. [Citation Graph (0, 0)][DBLP ] Conf ] Phelim Boyle , Alex Potapchik Application of high-precision computing for pricing arithmetic asian options. [Citation Graph (0, 0)][DBLP ] Conf ] Howard Cheng , George Labahn On computing polynomial GCDs in alternate bases. [Citation Graph (0, 0)][DBLP ] Conf ] Arthur D. Chtcherba , Deepak Kapur Conditions for determinantal formula for resultant of a polynomial system. [Citation Graph (0, 0)][DBLP ] Conf ] Wayne Eberly , Mark Giesbrecht , Pascal Giorgi , Arne Storjohann , Gilles Villard Solving sparse rational linear systems. [Citation Graph (0, 0)][DBLP ] Conf ] Arno Eigenwillig , Vikram Sharma , Chee-Keng Yap Almost tight recursion tree bounds for the Descartes method. [Citation Graph (0, 0)][DBLP ] Conf ] Etienne Farcot Symbolic numeric analysis of attractors in randomly generated piecewise affine models of gene networks. [Citation Graph (0, 0)][DBLP ] Conf ] Arash Farzan , J. Ian Munro Succinct representation of finite abelian groups. [Citation Graph (0, 0)][DBLP ] Conf ] Akpodigha Filatei , Xin Li , Marc Moreno Maza , Éric Schost Implementation techniques for fast polynomial arithmetic in a high-level programming environment. [Citation Graph (0, 0)][DBLP ] Conf ] Xiao-Shan Gao , Chun-Ming Yuan Resolvent systems of difference polynomial ideals. [Citation Graph (0, 0)][DBLP ] Conf ] Pierrick Gaudry , François Morain Fast algorithms for computing the eigenvalue in the Schoof-Elkies-Atkin algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Mark Giesbrecht , George Labahn , Wen-shin Lee Symbolic-numeric sparse interpolation of multivariate polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Li Guo , William Y. Sit Enumeration of Rota-Baxter words. [Citation Graph (0, 0)][DBLP ] Conf ] Michael Harrison , Josef Schicho Rational parametrisation for degree 6 Del Pezzo surfaces using lie algebras. [Citation Graph (0, 0)][DBLP ] Conf ] Joris van der Hoeven Effective real numbers in Mmxlib. [Citation Graph (0, 0)][DBLP ] Conf ] Itnuit Janovitz-Freireich , Lajos Rónyai , Ágnes Szántó Approximate radical of ideals with clusters of roots. [Citation Graph (0, 0)][DBLP ] Conf ] Jeremy R. Johnson , Werner Krandick , Kevin Lynch , David G. Richardson , Anatole D. Ruslanov High-performance implementations of the Descartes method. [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen , Pascal Koiran Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields. [Citation Graph (0, 0)][DBLP ] Conf ] Erich Kaltofen , Zhengfeng Yang , Lihong Zhi Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Manuel Kauers , Carsten Schneider Application of unspecified sequences in symbolic summation. [Citation Graph (0, 0)][DBLP ] Conf ] Sara Khodadad , Michael B. Monagan Fast rational function reconstruction. [Citation Graph (0, 0)][DBLP ] Conf ] Santiago Laplagne An algorithm for the computation of the radical of an ideal. [Citation Graph (0, 0)][DBLP ] Conf ] Daniel Lazard Solving Kaltofen's challenge on Zolotarev's approximation problem. [Citation Graph (0, 0)][DBLP ] Conf ] Nicolas Le Roux , Moulay A. Barkatou Rank reduction of a class of pfaffian systems in two variables. [Citation Graph (0, 0)][DBLP ] Conf ] Viktor Levandovskyy Intersection of ideals with non-commutative subalgebras. [Citation Graph (0, 0)][DBLP ] Conf ] Ziming Li , Michael F. Singer , Min Wu , Dabin Zheng A recursive method for determining the one-dimensional submodules of Laurent-Ore modules. [Citation Graph (0, 0)][DBLP ] Conf ] Manfred Minimair Resultants of skewly composed polynomials. [Citation Graph (0, 0)][DBLP ] Conf ] Izumi Miyamoto An improvement of GAP normalizer function for permutation groups. [Citation Graph (0, 0)][DBLP ] Conf ] Michael B. Monagan , Roman Pearce Rational simplification modulo a polynomial ideal. [Citation Graph (0, 0)][DBLP ] Conf ] Guillaume Moroz Complexity of the resolution of parametric systems of polynomial equations and inequations. [Citation Graph (0, 0)][DBLP ] Conf ] Max Neunhöffer , Ákos Seress A data structure for a uniform approach to computations with finite groups. [Citation Graph (0, 0)][DBLP ] Conf ] Masayuki Noro Modular dynamic evaluation. [Citation Graph (0, 0)][DBLP ] Conf ] Wei Pan , Dongming Wang Uniform Gröbner bases for ideals generated by polynomials with parametric exponents. [Citation Graph (0, 0)][DBLP ] Conf ] Cyril Pascal , Éric Schost Change of order for bivariate triangular sets. [Citation Graph (0, 0)][DBLP ] Conf ] Victoria Powers , Bruce Reznick A quantitative Pólya's Theorem with corner zeros. [Citation Graph (0, 0)][DBLP ] Conf ] Guénaël Renault Computation of the splitting field of a dihedral polynomial. [Citation Graph (0, 0)][DBLP ] Conf ] Eric Robinson , Gene Cooperman A parallel architecture for disk-based computing over the Baby Monster and other large finite simple groups. [Citation Graph (0, 0)][DBLP ] Conf ] Rosario Rubio , J. Miguel Serradilla , M. Pilar Vélez A note on implicitization and normal parametrization of rational curves. [Citation Graph (0, 0)][DBLP ] Conf ] Hiroshi Sekigawa , Kiyoshi Shirayanagi Locating real multiple zeros of a real interval polynomial. [Citation Graph (0, 0)][DBLP ] Conf ] Alan P. Sexton , Volker Sorge Abstract matrices in symbolic computation. [Citation Graph (0, 0)][DBLP ] Conf ] Akira Suzuki , Yosuke Sato A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases. [Citation Graph (0, 0)][DBLP ] Conf ] William J. Turner A block Wiedemann rank algorithm. [Citation Graph (0, 0)][DBLP ] Conf ] Christiaan van de Woestijne Surface parametrisation without diagonalisation. [Citation Graph (0, 0)][DBLP ] Conf ] Wenyuan Wu , Greg Reid Application of numerical algebraic geometry and numerical linear algebra to PDE. [Citation Graph (0, 0)][DBLP ] Conf ] Meng Zhou , Franz Winkler Gröbner bases in difference-differential modules. [Citation Graph (0, 0)][DBLP ] Conf ] 