Manuel Kauers

CoRR, 2024

Towards a Parallel Summation Algorithm.

[BibT_eX]

[DOI]

CoRR, 2024

Hardinian Arrays.

[BibT_eX]

[DOI]

Robert Dougherty-Bliss

Electron. J. Comb., 2024

Parallel Summation in P-Recursive Extensions.

[BibT_eX]

[DOI]

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

On the Problem of Separating Variables in Multivariate Polynomial Ideals.

[BibT_eX]

[DOI]

Manfred Buchacher

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

2023

Lonely Points in Simplices.

[BibT_eX]

[DOI]

Maximilian Jaroschek

Laura Kovács

Discret. Comput. Geom., 2023

Some New Non-Commutative Matrix Multiplication Algorithms of Size (n, m, 6).

[BibT_eX]

[DOI]

CoRR, 2023

Some D-finite and some Possibly D-finite Sequences in the OEIS.

[BibT_eX]

[DOI]

CoRR, 2023

Order bounds for C2-finite sequences.

[BibT_eX]

[DOI]

Philipp Nuspl

CoRR, 2023

Order bounds for C2-finite sequences.

[BibT_eX]

[DOI]

Philipp Nuspl

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

Flip Graphs for Matrix Multiplication.

[BibT_eX]

[DOI]

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

Transcendence Certificates for D-finite Functions.

[BibT_eX]

[DOI]

Thibaut Verron

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

Hermite Reduction for D-finite Functions via Integral Bases.

[BibT_eX]

[DOI]

Lixin Du

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

2022

The FBHHRBNRSSSHK-Algorithm for Multiplication in $\mathbb{Z}_2^{5\times5}$ is still not the end of the story.

[BibT_eX]

[DOI]

CoRR, 2022

OuterCount: A First-Level Solution-Counter for Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Intelligent Computer Mathematics - 15th International Conference, 2022

Guessing with Little Data.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

Order-Degree-Height Surfaces for Linear Operators.

[BibT_eX]

[DOI]

Hui Huang

Gargi Mukherjee

Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

A Normal Form for Matrix Multiplication Schemes.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Informatics - 9th International Conference, 2022

2021

Foreword.

[BibT_eX]

[DOI]

Alexey Ovchinnikov

Éric Schost

J. Symb. Comput., 2021

New ways to multiply 3 × 3-matrices.

[BibT_eX]

[DOI]

Marijn J. H. Heule

J. Symb. Comput., 2021

Lazy Hermite Reduction and Creative Telescoping for Algebraic Functions.

[BibT_eX]

[DOI]

Lixin Du

Proceedings of the ISSAC '21: International Symposium on Symbolic and Algebraic Computation, 2021

2020

Asymptotic enumeration of compacted binary trees of bounded right height.

[BibT_eX]

[DOI]

Antoine Genitrini

Bernhard Gittenberger

Michael Wallner

J. Comb. Theory A, 2020

Incremental column-wise verification of arithmetic circuits using computer algebra.

[BibT_eX]

[DOI]

Daniela Kaufmann

Formal Methods Syst. Des., 2020

Integral P-Recursive Sequences.

[BibT_eX]

[DOI]

CoRR, 2020

Integral bases for p-recursive sequences.

[BibT_eX]

[DOI]

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

Separating variables in bivariate polynomial ideals.

[BibT_eX]

[DOI]

Manfred Buchacher

Gleb Pogudin

Proceedings of the ISSAC '20: International Symposium on Symbolic and Algebraic Computation, 2020

From DRUP to PAC and Back.

[BibT_eX]

[DOI]

Daniela Kaufmann

Proceedings of the 2020 Design, Automation & Test in Europe Conference & Exhibition, 2020

Good Pivots for Small Sparse Matrices.

[BibT_eX]

[DOI]

Proceedings of the Computer Algebra in Scientific Computing - 22nd International Workshop, 2020

2019

Apparent singularities of D-finite systems.

[BibT_eX]

[DOI]

J. Symb. Comput., 2019

New ways to multiply 3 x 3-matrices.

[BibT_eX]

[DOI]

Marijn J. H. Heule

CoRR, 2019

On the maximal minimal cube lengths in distinct DNF tautologies.

[BibT_eX]

[DOI]

CoRR, 2019

Why you should remove zeros from data before guessing.

[BibT_eX]

[DOI]

Thibaut Verron

ACM Commun. Comput. Algebra, 2019

Multivariate ore polynomials in SageMath.

[BibT_eX]

[DOI]

Marc Mezzarobba

ACM Commun. Comput. Algebra, 2019

A family of schemes for multiplying 3 × 3 matrices with 23 coefficient multiplications.

[BibT_eX]

[DOI]

Marijn Heule

ACM Commun. Comput. Algebra, 2019

SAT, Computer Algebra, Multipliers.

[BibT_eX]

[DOI]

Proceedings of the Vampire 2018 and Vampire 2019. The 5th and 6th Vampire Workshops, 2019

Local Search for Fast Matrix Multiplication.

[BibT_eX]

[DOI]

Marijn J. H. Heule

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2019, 2019

Verifying Large Multipliers by Combining SAT and Computer Algebra.

[BibT_eX]

[DOI]

Daniela Kaufmann

Proceedings of the 2019 Formal Methods in Computer Aided Design, 2019

2018

Reduction-based creative telescoping for fuchsian D-finite functions.

[BibT_eX]

[DOI]

J. Symb. Comput., 2018

Short proofs for some symmetric Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2018

A Simple Re-Derivation of Onsager's Solution of the 2D Ising Model using Experimental Mathematics.

[BibT_eX]

[DOI]

CoRR, 2018

A Practical Polynomial Calculus for Arithmetic Circuit Verification.

[BibT_eX]

[DOI]

Proceedings of the 3rd Workshop on Satisfiability Checking and Symbolic Computation co-located with Federated Logic Conference, 2018

Symmetries of Quantified Boolean Formulas.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2018, 2018

Improving and extending the algebraic approach for verifying gate-level multipliers.

[BibT_eX]

[DOI]

Proceedings of the 2018 Design, Automation & Test in Europe Conference & Exhibition, 2018

2017

Some open problems related to creative telescoping.

[BibT_eX]

[DOI]

J. Syst. Sci. Complex., 2017

Lattice walks in the octant with infinite associated groups.

[BibT_eX]

[DOI]

Rong-Hua Wang

Electron. Notes Discret. Math., 2017

Hypergeometric expressions for generating functions of walks with small steps in the quarter plane.

[BibT_eX]

[DOI]

Eur. J. Comb., 2017

Bounds for D-finite Substitution.

[BibT_eX]

[DOI]

Gleb Pogudin

CoRR, 2017

Asymptotic Enumeration of Compacted Binary Trees.

[BibT_eX]

[DOI]

Antoine Genitrini

Bernhard Gittenberger

Michael Wallner

CoRR, 2017

Challenges in Verifying Arithmetic Circuits Using Computer Algebra.

[BibT_eX]

[DOI]

Proceedings of the 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2017

Bounds for Substituting Algebraic Functions into D-finite Functions.

[BibT_eX]

[DOI]

Gleb Pogudin

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

Column-wise verification of multipliers using computer algebra.

[BibT_eX]

[DOI]

Proceedings of the 2017 Formal Methods in Computer Aided Design, 2017

2016

On a Conjecture of Cusick Concerning the Sum of Digits of n and n+t.

[BibT_eX]

[DOI]

Michael Drmota

Lukas Spiegelhofer

SIAM J. Discret. Math., 2016

Desingularization of Ore operators.

[BibT_eX]

[DOI]

Michael F. Singer

J. Symb. Comput., 2016

Factorization of C-finite Sequences.

[BibT_eX]

[DOI]

CoRR, 2016

D-finite Numbers.

[BibT_eX]

[DOI]

Hui Huang

CoRR, 2016

Workshop on symbolic combinatorics and algorithmic differential algebra.

[BibT_eX]

[DOI]

Peter Paule

Greg Reid

ACM Commun. Comput. Algebra, 2016

Reduction-Based Creative Telescoping for Algebraic Functions.

[BibT_eX]

[DOI]

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

2015

Ore Polynomials in Sage.

[BibT_eX]

[DOI]

Maximilian Jaroschek

Fredrik Johansson

Proceedings of the Computer Algebra and Polynomials, 2015

On the length of integers in telescopers for proper hypergeometric terms.

[BibT_eX]

[DOI]

Lily Yen

J. Symb. Comput., 2015

An Improved Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms.

[BibT_eX]

[DOI]

CoRR, 2015

Creative Telescoping via Hermite Reduction.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2015

Integral D-Finite Functions.

[BibT_eX]

[DOI]

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

A Modified Abramov-Petkovsek Reduction and Creative Telescoping for Hypergeometric Terms.

[BibT_eX]

[DOI]

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

2014

Hypercontractive inequalities via SOS, and the Frankl-Rödl graph.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 2014

Bounds for D-finite closure properties.

[BibT_eX]

[DOI]

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

A generalized Apagodu-Zeilberger algorithm.

[BibT_eX]

[DOI]

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

2013

Computer-Assisted Proofs of Some Identities for Bessel Functions of Fractional Order

[BibT_eX]

[DOI]

CoRR, 2013

Ore Polynomials in Sage.

[BibT_eX]

[DOI]

Maximilian Jaroschek

Fredrik Johansson

CoRR, 2013

Finding hyperexponential solutions of linear ODEs by numerical evaluation.

[BibT_eX]

[DOI]

Fredrik Johansson

Marc Mezzarobba

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

Desingularization explains order-degree curves for ore operators.

[BibT_eX]

[DOI]

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

2012

Trading order for degree in creative telescoping.

[BibT_eX]

[DOI]

J. Symb. Comput., 2012

Hypercontractive inequalities via SOS, with an application to Vertex-Cover

[BibT_eX]

[DOI]

CoRR, 2012

Telescopers for rational and algebraic functions via residues.

[BibT_eX]

[DOI]

Michael F. Singer

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

Order-degree curves for hypergeometric creative telescoping.

[BibT_eX]

[DOI]

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

2011

The Concrete Tetrahedron - Symbolic Sums, Recurrence Equations, Generating Functions, Asymptotic Estimates.

[BibT_eX]

[DOI]

Peter Paule

Texts & Monographs in Symbolic Computation, Springer, ISBN: 978-3-7091-0445-3, 2011

Buchberger's algorithm.

[BibT_eX]

[DOI]

Bruno Buchberger

Scholarpedia, 2011

Dominance in the family of Sugeno-Weber t-norms.

[BibT_eX]

[DOI]

Susanne Saminger-Platz

Fuzzy Sets Syst., 2011

A Method for Determining the Mod-2k Behaviour of Recursive Sequences, with Applications to Subgroup Counting.

[BibT_eX]

[DOI]

Christian Krattenthaler

Thomas W. Müller

Electron. J. Comb., 2011

The computational challenge of enumerating high-dimensional rook walks.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2011

A refined denominator bounding algorithm for multivariate linear difference equations.

[BibT_eX]

[DOI]

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

The concrete tetrahedron.

[BibT_eX]

[DOI]

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

2010

Groebner basis.

[BibT_eX]

[DOI]

Bruno Buchberger

Scholarpedia, 2010

When can we decide that a P-finite sequence is positive?

[BibT_eX]

[DOI]

CoRR, 2010

Proof of George Andrews's and David Robbins's q-TSPP Conjecture.

[BibT_eX]

[DOI]

CoRR, 2010

Partial denominator bounds for partial linear difference equations.

[BibT_eX]

[DOI]

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

When can we detect that a P-finite sequence is positive?

[BibT_eX]

[DOI]

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

2009

Determining the closed forms of the O(sS3) anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra.

[BibT_eX]

[DOI]

Comput. Phys. Commun., 2009

The complete Generating Function for Gessel Walks is Algebraic

[BibT_eX]

[DOI]

Alin Bostan

CoRR, 2009

From Moments to Functions in Quantum Chromodynamics

[BibT_eX]

[DOI]

CoRR, 2009

Determining the closed forms of the $O(a_s^3)$ anomalous dimensions and Wilson coefficients from Mellin moments by means of computer algebra

[BibT_eX]

[DOI]

CoRR, 2009

A non-holonomic systems approach to special function identities.

[BibT_eX]

[DOI]

Frédéric Chyzak

Bruno Salvy

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

Algorithms in Symbolic Computation.

[BibT_eX]

[DOI]

Proceedings of the Hagenberg Research, 2009

2008

Solving difference equations whose coefficients are not transcendental.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

A Telescoping Fibonacci Sum: 11258.

[BibT_eX]

[DOI]

Richard Stong

Am. Math. Mon., 2008

Computing the algebraic relations of C-finite sequences and multisequences.

[BibT_eX]

[DOI]

Burkhard Zimmermann

J. Symb. Comput., 2008

Experiments with a Positivity-Preserving Operator.

[BibT_eX]

[DOI]

Exp. Math., 2008

Automated Proofs for Some Stirling Number Identities.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

Integration of algebraic functions: a simple heuristic for finding the logarithmic part.

[BibT_eX]

[DOI]

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

2007

An algorithm for deciding zero equivalence of nested polynomially recurrent sequences.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2007

Summation algorithms for Stirling number identities.

[BibT_eX]

[DOI]

J. Symb. Comput., 2007

Symbolic summation with radical expressions.

[BibT_eX]

[DOI]

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

2006

Problem 11258.

[BibT_eX]

[DOI]

Am. Math. Mon., 2006

SumCracker: A package for manipulating symbolic sums and related objects.

[BibT_eX]

[DOI]

J. Symb. Comput., 2006

Indefinite summation with unspecified summands.

[BibT_eX]

[DOI]

Discret. Math., 2006

Shift Equivalence of P-finite Sequences.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

Application of unspecified sequences in symbolic summation.

[BibT_eX]

[DOI]

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

2005

A procedure for proving special function inequalities involving a discrete parameter.

[BibT_eX]

[DOI]

Stefan Gerhold

Proceedings of the Symbolic and Algebraic Computation, 2005

2004

Solving parametric linear systems: an experiment with constraint algebraic programming.

[BibT_eX]

[DOI]

Clemens Ballarin

SIGSAM Bull., 2004

Computer proofs for polynomial identities in arbitrary many variables.

[BibT_eX]

[DOI]

Proceedings of the Symbolic and Algebraic Computation, 2004

2003

Computing limits of sequences.

[BibT_eX]

[DOI]