ISSAC 2000: St. Andrews, UK

• John Abbott, Victor Shoup, Paul Zimmermann:
  Factorization in ***[x]: the searching phase. 1-7
  
• Sergei A. Abramov, Manuel Bronstein:
  Hypergeometric dispersion and the orbit problem. 8-13
  
• Hirokazu Anai, Volker Weispfenning:
  Deciding linear-trigonometric problems. 14-22
  
• Franz Binder, Erhard Aichinger, Jürgen Ecker, Christof Nöbauer, Peter Mayr:
  Algorithms for near-rings of non-linear transformations. 23-29
  
• Gábor Bodnár, Josef Schicho:
  An improved algorithm for the resolution of singularities. 30-37
  
• François Boulier, François Lemaire:
  Computing canonical representatives of regular differential ideals. 38-47
  
• Christopher W. Brown:
  Improved projection for CAD's of R³. 48-53
  
• Howard Cheng, Eugene V. Zima:
  On accelerated methods to evaluate sums of products of rational numbers. 54-61
  
• Arthur D. Chtcherba, Deepak Kapur:
  Conditions for exact resultants using the Dixon formulation. 62-70
  
• George E. Collins, Werner Krandick:
  Multiprecision floating point addition. 71-77
  
• Olivier Cormier, Michael F. Singer, Felix Ulmer:
  Computing the Galois group of a polynomial using linear differential equations. 78-85
  
• Andreas Dolzmann, Volker Weispfenning:
  Local quantifier elimination. 86-94
  
• Jean-Guillaume Dumas, B. David Saunders, Gilles Villard:
  Integer Smith form via the valence: experience with large sparse matrices from homology. 95-105
  
• Wayne Eberly:
  Black box Frobenius decompositions over small fields. 106-113
  
• Pilar Fernandez-Ferreiros, Maria de los Angeles Gomez-Molleda:
  A method for deciding whether the Galois group is abelian. 114-120
  
• Anne Fredet:
  Linear differential equations, iterative logarithms and orderings on monomial differential extensions. 121-128
  
• Edward L. Green, Lenwood S. Heath, Craig A. Struble:
  Constructing endomorphism rings via duals. 129-136
  
• Dima Grigoriev, Nicolai Vorobjov:
  Bounds on numers of vectors of multiplicities for polynomials which are easy to compute. 137-146
  
• Anshul Gupta, Pankaj Rohatgi, Ramesh C. Agarwal:
  Fast practical algorithms for the Boolean-product-witness-matrix problem. 146-152
  
• Jason F. Harris:
  Advanced notations in Mathematica. 153-160
  
• Yuzhen Huang, Wenda Wu, Hans J. Stetter, Lihong Zhi:
  Pseudofactors of multivariate polynomials. 161-168
  
• Namhyun Hur, James H. Davenport:
  An exact real algebraic arithmetic with equality determination. 169-174
  
• Gábor Ivanyos:
  Fast randomized algorithms for the structure of matrix algebras over finite fields (extended abstract). 175-183
  
• Claude-Pierre Jeannerod:
  An algorithm for the eigenvalue perturbation problem: reduction of a -matrix to a Lidskii matrix. 184-191
  
• Erich Kaltofen, Wen-shin Lee, A. Lobo:
  Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm. 192-201
  
• Günter Landsmann, Josef Schicho, Franz Winkler, Erik Hillgarter:
  Symbolic parametrization of pipe and canal surfaces. 202-208
  
• Grégoire Lecerf:
  Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions. 209-216
  
• Petr Lisonek, Robert B. Israel:
  Metric invariants of tetrahedra via polynomial elimination. 217-219
  
• Izumi Miyamoto:
  Computing normalizers of permutation groups efficiently using isomorphisms of association schemes. 220-224
  
• Michael B. Monagan, Allan D. Wittkopf:
  On the design and implementation of Brown's algorithm over the integers and number fields. 225-233
  
• Bernard Mourrain, Philippe Trebuchet:
  Solving projective complete intersection faster. 234-241
  
• Thom Mulders, Arne Storjohann:
  Rational solutions of singular linear systems. 242-249
  
• Michael Nöcker:
  Some remarks on parallel exponentiation (extended abstract). 250-257
  
• Arthur C. Norman:
  Further evaluation of Java for symbolic computation. 258-265
  
• Victor Y. Pan:
  Matrix structure, polynomial arithmetic, and erasure-resilient encoding/decoding. 266-271
  
• Gregory J. Reid, Allan D. Wittkopf:
  Determination of maximal symmetry groups of classes of differential equations. 272-280
  
• Birgit Reinert:
  Solving systems of linear one-sided equations in integer monoid and group rings. 281-287
  
• José Carlos Rosales, Pedro A. García-Sánchez, Juan Ignacio García-García:
  How to check if a finitely generated commutative monoid is a principal ideal commutative monoid. 288-291
  
• Josef Schicho:
  Proper parametrization of surfaces with a rational pencil. 292-300
  
• Ming Zhang, Ronald N. Goldman:
  Rectangular corner cutting and Sylvester A-resultants. 301-308
  
• Henk Barendregt, Arjeh M. Cohen:
  Representing and handling mathematical concepts by humans and machines.
  
• Felipe Cucker:
  Solving polynomial systems: a complexity theory viewpoint.
  
• Derek F. Holt:
  Computation in word-hyperbolic groups.
  

Last update Fri May 25 08:24:21 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page