Erich L. Kaltofen

Emmanuel Thomé

CoRR, 2015

Jenks prize 2015 award citation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2015

Error-Correcting Sparse Interpolation in the Chebyshev Basis.

[BibT_eX]

[DOI]

Andrew Arnold

Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014

Sparse Polynomial Interpolation Codes and their decoding beyond half the minimal distance.

[BibT_eX]

[DOI]

Clément Pernet

CoRR, 2014

Numerical Linear System Solving with Parametric Entries by Error Correction.

[BibT_eX]

[DOI]

Brice Boyer

ACM Commun. Comput. Algebra, 2014

Cleaning-up data for sparse model synthesis: when symbolic-numeric computation meets error-correcting codes.

[BibT_eX]

[DOI]

Proceedings of the Symbolic-Numeric Computation 2014, 2014

Sparse multivariate function recovery with a high error rate in the evaluations.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Sparse polynomial interpolation codes and their decoding beyond half the minimum distance.

[BibT_eX]

[DOI]

Clément Pernet

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

Essentially optimal interactive certificates in linear algebra.

[BibT_eX]

[DOI]

Jean-Guillaume Dumas

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2014

2013

On the matrix berlekamp-massey algorithm.

[BibT_eX]

[DOI]

George Yuhasz

ACM Trans. Algorithms, 2013

NSF funding opportunities for symbolic computation.

[BibT_eX]

[DOI]

Alexey Ovchinnikov

ACM Commun. Comput. Algebra, 2013

Jenks prize 2013 award citation.

[BibT_eX]

[DOI]

ACM Commun. Comput. Algebra, 2013

Sparse multivariate function recovery from values with noise and outlier errors.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

Factorization of multivariate polynomials.

[BibT_eX]

Grégoire Lecerf

Proceedings of the Handbook of Finite Fields., 2013

2012

Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Special Issue on Symbolic and Algebraic Computation Foundations, Algorithmics and Applications: ISSAC 2009.

[BibT_eX]

[DOI]

Jeremy R. Johnson

Hyungju Park

J. Symb. Comput., 2012

On the Berlekamp/Massey algorithm and counting singular Hankel matrices over a finite field.

[BibT_eX]

[DOI]

Matthew T. Comer

J. Symb. Comput., 2012

Certificates of impossibility of Hilbert-Artin representations of a given degree for definite polynomials and functions.

[BibT_eX]

[DOI]

Feng Guo

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Sparse polynomial interpolation and Berlekamp/Massey algorithms that correct outlier errors in input values.

[BibT_eX]

[DOI]

Matthew T. Comer

Clément Pernet

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2012

Symbolic Computation and Complexity Theory Transcript of My Talk.

[BibT_eX]

[DOI]

Proceedings of the Computer Mathematics, 2012

Sparse Polynomial Interpolation by Variable Shift in the Presence of Noise and Outliers in the Evaluations.

[BibT_eX]

[DOI]

Brice Boyer

Matthew T. Comer

Proceedings of the Computer Mathematics, 2012

2011

What is Hybrid Symbolic-Numeric Computation?

[BibT_eX]

[DOI]

Proceedings of the 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2011

Symmetric Determinantal Representation of Weakly-Skew Circuits.

[BibT_eX]

[DOI]

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation.

[BibT_eX]

[DOI]

Proceedings of the SNC 2011, 2011

Quadratic-time certificates in linear algebra.

[BibT_eX]

[DOI]

Michael Nehring

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

Supersparse black box rational function interpolation.

[BibT_eX]

[DOI]

Michael Nehring

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010

Symmetric Determinantal Representation of Formulas and Weakly Skew Circuits

[BibT_eX]

[DOI]

CoRR, 2010

Efficiently Certifying Non-Integer Powers.

[BibT_eX]

[DOI]

Mark Lavin

Comput. Complex., 2010

Computing the radius of positive semidefiniteness of a multivariate real polynomial via a dual of Seidenberg's method.

[BibT_eX]

[DOI]

Sharon Hutton

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Fifteen years after DSC and WLSS2 what parallel computations I do today: invited lecture at PASCO 2010.

[BibT_eX]

[DOI]

Proceedings of the 4th International Workshop on Parallel Symbolic Computation, 2010

2009

A proof of the monotone column permanent (MCP) conjecture for dimension 4 via sums-of-squares of rational functions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic Numeric Computation, 2009

09471 Executive Summary - Computer-assisted proofs - tools, methods and applications.

[BibT_eX]

[DOI]

Proceedings of the Computer-assisted proofs - tools, methods and applications, 15.11., 2009

09471 Abstracts Collection - Computer-assisted proofs - tools, methods and applications.

[BibT_eX]

[DOI]

Proceedings of the Computer-assisted proofs - tools, methods and applications, 15.11., 2009

2008

Approximate factorization of multivariate polynomials using singular value decomposition.

[BibT_eX]

[DOI]

J. Symb. Comput., 2008

Computing minimal generators of integer matrix sequences (abstract only).

[BibT_eX]

[DOI]

George Yuhasz

ACM Commun. Comput. Algebra, 2008

Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

Expressing a fraction of two determinants as a determinant.

[BibT_eX]

[DOI]

Pascal Koiran

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007

Irreducible polynomials and barker sequences.

[BibT_eX]

[DOI]

Peter B. Borwein

Michael J. Mossinghoff

ACM Commun. Comput. Algebra, 2007

On probabilistic analysis of randomization in hybrid symbolic-numeric algorithms.

[BibT_eX]

[DOI]

Proceedings of the Symbolic-Numeric Computation, 2007

On exact and approximate interpolation of sparse rational functions.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Lower bounds for approximate factorizations via semidefinite programming: (extended abstract).

[BibT_eX]

[DOI]

Bin Li

Kartik Sivaramakrishnan

Proceedings of the Symbolic-Numeric Computation, 2007

2006

Hybrid symbolic-numeric computation.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

Finding small degree factors of multivariate supersparse (lacunary) polynomials over algebraic number fields.

[BibT_eX]

[DOI]

Pascal Koiran

Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2006

06271 Abstracts Collection -- Challenges in Symbolic Computation Software.

[BibT_eX]

[DOI]

Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

06271 Executive Summary - Challenges in Symbolic Computation Software.

[BibT_eX]

[DOI]

Proceedings of the Challenges in Symbolic Computation Software, 02.07. - 07.07.2006, 2006

2005

On the complexity of computing determinants.

[BibT_eX]

[DOI]

Gilles Villard

Comput. Complex., 2005

Generic matrix multiplication and memory management in linBox.

[BibT_eX]

[DOI]

Dmitriy Morozov

George Yuhasz

Proceedings of the Symbolic and Algebraic Computation, 2005

On the complexity of factoring bivariate supersparse (Lacunary) polynomials.

[BibT_eX]

[DOI]

Pascal Koiran

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

Deterministic distinct-degree factorization of polynomials over finite fields.

[BibT_eX]

[DOI]

Shuhong Gao

Alan G. B. Lauder

J. Symb. Comput., 2004

Approximate factorization of multivariate polynomials via differential equations.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Early termination in sparse interpolation algorithms.

[BibT_eX]

[DOI]

J. Symb. Comput., 2003

Algorithms for computing sparsest shifts of polynomials in power, Chebyshev, and Pochhammer bases.

[BibT_eX]

[DOI]

Mark Giesbrecht

J. Symb. Comput., 2003

On approximate irreducibility of polynomials in several variables.

[BibT_eX]

[DOI]

John P. May

Proceedings of the Symbolic and Algebraic Computation, 2003

Polynomial factorization: a success story.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2003

2002

An output-sensitive variant of the baby steps/giant steps determinant algorithm.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2002

Algorithms for computing the sparsest shifts of polynomials via the Berlekamp/Massey algorithm.

[BibT_eX]

[DOI]

Mark Giesbrecht

Proceedings of the Symbolic and Algebraic Computation, 2002

2000

Challenges of Symbolic Computation: My Favorite Open Problems.

[BibT_eX]

[DOI]

J. Symb. Comput., 2000

Early termination in Ben-Or/Tiwari sparse interpolation and a hybrid of Zippel's algorithm.

[BibT_eX]

[DOI]

Proceedings of the 2000 International Symposium on Symbolic and Algebraic Computation, 2000

1999

East Coast Computer Algebra Day '99 (April 24, 1999): abstracts of invited talks and presented posters.

[BibT_eX]

[DOI]

Hoon Hong

Michael F. Singer

SIGSAM Bull., 1999

Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields.

[BibT_eX]

[DOI]

Algorithmica, 1999

On the Genericity of the Modular Polynomial GCD Algorithm.

[BibT_eX]

[DOI]

Michael B. Monagan

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

Efficient Algorithms for Computing the Nearest Polynomial with a Real Root and Related Problems.

[BibT_eX]

[DOI]

Markus A. Hitz

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

Symbolic Computation in Java: An Appraisement.

[BibT_eX]

[DOI]

Laurent Bernardin

Bruce W. Char

Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

Algebraic Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Theory of Computation Handbook., 1999

1998

Subquadratic-time factoring of polynomials over finite fields.

[BibT_eX]

[DOI]

Victor Shoup

Math. Comput., 1998

Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots.

[BibT_eX]

[DOI]

Markus A. Hitz

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

FOXBOX: A System for Manipulating Symbolic Objects in Black Box Representation.

[BibT_eX]

[DOI]

Angel Díaz

Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997

Teaching Computational Abstract Algebra.

[BibT_eX]

[DOI]

J. Symb. Comput., 1997

Fast Polynomial Factorization Over High Algebraic Extensions of Finite Fields.

[BibT_eX]

[DOI]

Victor Shoup

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

On Randomized Lanczos Algorithms.

[BibT_eX]

[DOI]

Wayne Eberly

Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

Algebraic Algorithms.

[BibT_eX]

Angel Díaz

Proceedings of the Computer Science and Engineering Handbook, 1997

1996

On Rank Properties of Toeplitz Matrices over Finite Fields.

[BibT_eX]

[DOI]

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

Generic Gram-Schmidt Orthogonalization by Exact Division.

[BibT_eX]

[DOI]

Úlfar Erlingsson

David R. Musser

Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995

Integer Division in Residue Number Systems.

[BibT_eX]

[DOI]

Markus A. Hitz

IEEE Trans. Computers, 1995

Process Scheduling in DSC and the Large Sparse Linear Systems Challenge.

[BibT_eX]

[DOI]

J. Symb. Comput., 1995

Effective Noether Irreducibility Forms and Applications.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 1995

Prediction Based Task Scheduling in Distributed Computing (Abstract).

[BibT_eX]

[DOI]

Mehrdad Samadani

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

Prediction Based Task Scheduling in Distributed Computing.

[BibT_eX]

[DOI]

Mehrdad Samadani

Proceedings of the Languages, 1995

On Computing Greatest Common Divisors with Polynomials Given by Black Boxes for Their Evaluations.

[BibT_eX]

[DOI]

Angel Díaz

Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994

Parallel Solution of Toeplitz and Toeplitz-Like Linear Systems Over Fields of Small Positive Characteristic.

[BibT_eX]

Proceedings of the First International Symposium on Parallel Symbolic Computation, 1994

Factoring High-Degree Polynomials by the Black Box Berlekamp Algorithm.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

Asymptotically Fast Solution of Toeplitz-like Singular Linear Systems.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994

1993

Direct proof of a theorem by Kalkbrener, Sweedler, and Taylor.

[BibT_eX]

[DOI]

SIGSAM Bull., 1993

Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1993

1992

Polynomial Factorization 1987-1991.

[BibT_eX]

[DOI]

Proceedings of the LATIN '92, 1992

On Computing Determinants of Matrices without Divisions.

[BibT_eX]

[DOI]

Proceedings of the 1992 International Symposium on Symbolic and Algebraic Computation, 1992

Processor-Efficient Parallel Solution of Linear Systems II: The Positive Characteristic and Singular Cases (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991

On Fast Multiplication of Polynomials over Arbitrary Algebras.

[BibT_eX]

[DOI]

David G. Cantor

Acta Informatica, 1991

Effective Noether Irreducibility Forms and Applications (Extended Abstract)

[BibT_eX]

[DOI]

Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, 1991

Processor Efficient Parallel Solution of Linear Systems over an Abstract Field.

[BibT_eX]

[DOI]

Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, 1991

DSC: A System for Distributed Symbolic Computation.

[BibT_eX]

[DOI]

Proceedings of the 1991 International Symposium on Symbolic and Algebraic Computation, 1991

On Wiedemann's Method of Solving Sparse Linear Systems.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 1991

1990

Computing with Polynomials Given By Black Boxes for Their Evaluations: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators.

[BibT_eX]

[DOI]

Barry M. Trager

J. Symb. Comput., 1990

Special Issue Computational Algebraic Complexity Editorial.

[BibT_eX]

[DOI]

Bruno Buchberger

J. Symb. Comput., 1990

Computing the Irreducible Real Factors and Components of an Algebraic Curve.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 1990

Modular Rational Sparse Multivariate Polynomial Interpolation.

[BibT_eX]

[DOI]

J.-M. Wiley

Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1990

1989

Factorization of Polynomials Given by Straight-Line Programs.

[BibT_eX]

Adv. Comput. Res., 1989

An Improved Las Vegas Primality Test.

[BibT_eX]

[DOI]

Thomas Valente

Norika Yui

Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

Solving Systems of Nonlinear Polynomial Equations Faster.

[BibT_eX]

[DOI]

John F. Canny

Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, 1989

Computers and mathematics.

[BibT_eX]

[DOI]

Springer, ISBN: 0387970193, 1989

1988

Dagwood: a system for manipulating polynomials given by straight-line programs.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 1988

Efficient Parallel Evaluation of Straight-Line Code and Arithmetic Circuits.

[BibT_eX]

[DOI]

Gary L. Miller

Vijaya Ramachandran

SIAM J. Comput., 1988

Greatest common divisors of polynomials given by straight-line programs.

[BibT_eX]

[DOI]

J. ACM, 1988

Analysis of the binary complexity of asymptotically fast algorithms for linear system solving.

[BibT_eX]

[DOI]

Brent Gregory

SIGSAM Bull., 1988

Improved Sparse Multivariate Polynomial Interpolation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 1988

Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators

[BibT_eX]

[DOI]

Barry M. Trager

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

1987

Deterministic Irreducibility Testing of Polynomials over Large Finite Fields.

[BibT_eX]

[DOI]

J. Symb. Comput., 1987

Single-Factor Hensel Lifting and its Application to the Straight-Line Complexity of Certain Polynomials

[BibT_eX]

[DOI]

Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987

Mr. Smith goes to Las Vegas: Randomized parallel computation of the Smith Normal Form of polynomial matrices.

[BibT_eX]

[DOI]

Mukkai S. Krishnamoorthy

Proceedings of the EUROCAL '87, 1987

1986

Uniform Closure Properties of P-Computable Functions

[BibT_eX]

[DOI]

Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986

Fast parallel algorithms for similarity of matrices.

[BibT_eX]

[DOI]

Mukkai S. Krishnamoorthy

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

A system for manipulating polynomials given by straight-line programs.

[BibT_eX]

[DOI]

Timothy S. Freeman

Gregory M. Imirzian

Proceedings of the Symposium on Symbolic and Algebraic Manipulation, 1986

Efficient Parallel Evaluation of Straight-line Code and Arithmetric Circuits.

[BibT_eX]

[DOI]

Gary L. Miller

Vijaya Ramachandran

Proceedings of the VLSI Algorithms and Architectures, 1986

1985

Effective Hilbert Irreducibility

[BibT_eX]

[DOI]

Inf. Control., September, 1985

Polynomial-Time Reductions from Multivariate to Bi- and Univariate Integral Polynomial Factorization.

[BibT_eX]

[DOI]

SIAM J. Comput., 1985

Fast Parallel Absolute Irreducibility Testing.

[BibT_eX]

[DOI]

J. Symb. Comput., 1985

Factoring Sparse Multivariate Polynomials.

[BibT_eX]

[DOI]

Joachim von zur Gathen

J. Comput. Syst. Sci., 1985

Computing with Polynomials Given by Straight-Line Programs I: Greatest Common Divisors

[BibT_eX]

[DOI]

Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985

Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization

[BibT_eX]

[DOI]

Proceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985

Arithmetic in Quadratic Fields with Unique Factorization.

[BibT_eX]

[DOI]

Heinrich Rolletschek

Proceedings of the EUROCAL '85, 1985

Sparse Hensel Lifting.

[BibT_eX]

[DOI]

Proceedings of the EUROCAL '85, 1985

1984

Explicit Construction of the Hilbert Class Fields of Imaginary Quadratic Fields with Class Numbers 7 and 11.

[BibT_eX]

[DOI]

Noriko Yui

Proceedings of the EUROSAM 84, 1984

A Note on the Risch Differential Equation.

[BibT_eX]

[DOI]

Proceedings of the EUROSAM 84, 1984

1983

A Generalized Class of Polynomials that are Hard to Factor.

[BibT_eX]

[DOI]

David R. Musser

SIAM J. Comput., 1983

Polynomial-Time Factorization of Multivariate Polynomials over Finite Fields.

[BibT_eX]

[DOI]

Joachim von zur Gathen

Proceedings of the Automata, 1983

On the complexity of finding short vectors in integer lattices.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra, 1983

1982

Polynomial reduction from multivariate to bivariate integral polynomial factorization.

[BibT_eX]

[DOI]

SIGSAM Bull., 1982

A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization

[BibT_eX]

[DOI]