Mark van Hoeij

According to our database1, Mark van Hoeij authored at least 62 papers between 1994 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Hypergeometric Solutions of Linear Difference Systems.
CoRR, 2024

Submodule approach to creative telescoping.
CoRR, 2024

2022
Desingularization and p-Curvature of Recurrence Operators.
Proceedings of the ISSAC '22: International Symposium on Symbolic and Algebraic Computation, Villeneuve-d'Ascq, France, July 4, 2022

2020
A Family of Denominator Bounds for First Order Linear Recurrence Systems.
CoRR, 2020

2019
The complexity of computing all subfields of an algebraic number field.
J. Symb. Comput., 2019

Fast algorithm for factoring difference operators.
ACM Commun. Comput. Algebra, 2019

Methods for simplifying differential equations.
ACM Commun. Comput. Algebra, 2019

2018
Reduction-based creative telescoping for fuchsian D-finite functions.
J. Symb. Comput., 2018

2017
Computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases.
J. Symb. Comput., 2017

Hypergeometric expressions for generating functions of walks with small steps in the quarter plane.
Eur. J. Comb., 2017

Iterated Elliptic and Hypergeometric Integrals for Feynman Diagrams.
CoRR, 2017

Closed Form Solutions for Linear Differential and Difference Equations.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

Functional Decomposition Using Principal Subfields.
Proceedings of the 2017 ACM on International Symposium on Symbolic and Algebraic Computation, 2017

2016
A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions.
CoRR, 2016

2015
Groebner basis in Boolean rings is not polynomial-space.
CoRR, 2015

Computing Hypergeometric Solutions of Second Order Linear Differential Equations using Quotients of Formal Solutions.
Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, 2015

2014
<sup>2</sup>F<sup>1</sup>-type Solutions of Second Order Differential Equations.
ACM Commun. Comput. Algebra, 2014

Computation of Genus 0 Belyi Functions.
Proceedings of the Mathematical Software - ICMS 2014, 2014

2013
Generating subfields.
J. Symb. Comput., 2013

Computing Puiseux Expansions at Cusps of the Modular Curve X0(N).
CoRR, 2013

Second order differential equations with hypergeometric solutions of degree three.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

The complexity of factoring univariatepolynomials over the rationals: tutorial abstract.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
Finding <sub>2</sub>F<sub>1</sub> type solutions of differential equations with 5 singularities.
ACM Commun. Comput. Algebra, 2012

Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials.
Algorithmica, 2012

2011
Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences.
J. Symb. Comput., 2011

Explicit formula for the generating series of diagonal 3D rook paths
CoRR, 2011

Practical polynomial factoring in polynomial time.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2-descent for second order linear differential equations.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2011

2010
Isomorphisms of Algebraic Number Fields
CoRR, 2010

Abstract only: The complexity of factoring univariate polynomials over the rationals.
ACM Commun. Comput. Algebra, 2010

Abstract only: Solving linear differential equations by using descent.
ACM Commun. Comput. Algebra, 2010

Solving linear recurrence equations.
ACM Commun. Comput. Algebra, 2010

Abstract only: Solving linear recurrence relations.
ACM Commun. Comput. Algebra, 2010

Finding all bessel type solutions for linear differential equations with rational function coefficients.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Liouvillian solutions of irreducible second order linear difference equations.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

Solving recurrence relations using local invariants.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2010

2009
Liouvillian solutions of irreducible linear difference equations.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009

2008
Factoring univariate polynomials over the rationals.
ACM Commun. Comput. Algebra, 2008

Solving differential equations in terms of bessel functions.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2008

2007
Solving third order linear differential equations in terms of second order equations.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2007

Approximate bivariate factorization: a geometric viewpoint.
Proceedings of the Symbolic-Numeric Computation, 2007

2006
Computing Hypergeometric Solutions of Linear Recurrence Equations.
Appl. Algebra Eng. Commun. Comput., 2006

Apparent singularities of linear difference equations with polynomial coefficients.
Appl. Algebra Eng. Commun. Comput., 2006

2005
Solving second order linear differential equations with Klein's theorem.
Proceedings of the Symbolic and Algebraic Computation, 2005

2004
Computing Riemann theta functions.
Math. Comput., 2004

A modular algorithm for computing the exponential solutions of a linear differential operator.
J. Symb. Comput., 2004

Algorithms for polynomial GCD computation over algebraic function fields.
Proceedings of the Symbolic and Algebraic Computation, 2004

Closed form solutions of linear odes having elliptic function coefficients.
Proceedings of the Symbolic and Algebraic Computation, 2004

2002
A modular GCD algorithm over number fields presented with multiple extensions.
Proceedings of the Symbolic and Algebraic Computation, 2002

2001
Towards factoring bivariate approximate polynomials.
Proceedings of the 2001 International Symposium on Symbolic and Algebraic Computation, 2001

Factoring Polynomials and 0-1 Vectors.
Proceedings of the Cryptography and Lattices, International Conference, 2001

1999
Liouvillian Solutions of Linear Differential Equations of Order Three and Higher.
J. Symb. Comput., 1999

Desingularization of Linear Difference Operators with Polynomial Coefficients.
Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, 1999

1998
Rational Solutions of Linear Difference Equations.
Proceedings of the 1998 International Symposium on Symbolic and Algebraic Computation, 1998

1997
Factorization of Differential Operators with Rational Functions Coefficients.
J. Symb. Comput., 1997

Formal Solutions and Factorization of Differential Operators with Power Series Coefficients.
J. Symb. Comput., 1997

Rational Parametrizations of Algebraic Curves Using a Canonical Divisor.
J. Symb. Comput., 1997

A Method for the Integration of Solutions of Ore Equations.
Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, 1997

1996
Rational Solutions of the Mixed Differential Equation and Its Application to Factorization of Differential Operators.
Proceedings of the 1996 International Symposium on Symbolic and Algebraic Computation, 1996

1995
An Algorithm for Computing the Weierstrass Normal Form.
Proceedings of the 1995 International Symposium on Symbolic and Algebraic Computation, 1995

1994
An Algorithm for Computing an Integral Basis in an Algebraic Function Field.
J. Symb. Comput., 1994

Computing Parameterizations of Rational Algebraic Curves.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 1994


  Loading...