default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark van Hoeij
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j26]Mark van Hoeij:
Submodule approach to creative telescoping. J. Symb. Comput. 126: 102342 (2025)- 2024
- [c31]Heba Bou Kaedbey
, Mark van Hoeij, Man Cheung Tsui:
Solving Third Order Linear Difference Equations in Terms of Second Order Equations. ISSAC 2024: 457-463 - [i16]Mark van Hoeij:
Submodule approach to creative telescoping. CoRR abs/2401.08455 (2024) - [i15]Moulay A. Barkatou, Mark van Hoeij, Johannes Middeke, Yi Zhou:
Hypergeometric Solutions of Linear Difference Systems. CoRR abs/2401.08470 (2024) - 2022
- [c30]Yi Zhou, Mark van Hoeij:
Desingularization and p-Curvature of Recurrence Operators. ISSAC 2022: 111-118 - [i14]Yi Zhou, Mark van Hoeij:
Desingularization and p-Curvature of Recurrence Operators. CoRR abs/2202.08931 (2022) - 2020
- [i13]Mark van Hoeij, Moulay A. Barkatou, Johannes Middeke:
A Family of Denominator Bounds for First Order Linear Recurrence Systems. CoRR abs/2007.02926 (2020)
2010 – 2019
- 2019
- [j25]Shayea Aldossari, Mark van Hoeij:
Methods for simplifying differential equations. ACM Commun. Comput. Algebra 53(3): 93-95 (2019) - [j24]Yi Zhou, Mark van Hoeij:
Fast algorithm for factoring difference operators. ACM Commun. Comput. Algebra 53(3): 150-152 (2019) - [j23]Jonas Szutkoski, Mark van Hoeij:
The complexity of computing all subfields of an algebraic number field. J. Symb. Comput. 93: 161-182 (2019) - 2018
- [j22]Shaoshi Chen, Mark van Hoeij, Manuel Kauers, Christoph Koutschan:
Reduction-based creative telescoping for fuchsian D-finite functions. J. Symb. Comput. 85: 108-127 (2018) - 2017
- [j21]Alin Bostan, Frédéric Chyzak, Mark van Hoeij, Manuel Kauers, Lucien Pech:
Hypergeometric expressions for generating functions of walks with small steps in the quarter plane. Eur. J. Comb. 61: 242-275 (2017) - [j20]Erdal Imamoglu, Mark van Hoeij:
Computing hypergeometric solutions of second order linear differential equations using quotients of formal solutions and integral bases. J. Symb. Comput. 83: 254-271 (2017) - [c29]Mark van Hoeij:
Closed Form Solutions for Linear Differential and Difference Equations. ISSAC 2017: 3-4 - [c28]Luiz Emilio Allem, Juliane G. Capaverde, Mark van Hoeij, Jonas Szutkoski:
Functional Decomposition Using Principal Subfields. ISSAC 2017: 421-428 - [i12]Jonas Szutkoski, Mark van Hoeij, Luiz Emilio Allem, Juliane Capaverde:
Functional Decomposition using Principal Subfields. CoRR abs/1701.03529 (2017) - [i11]Jakob Ablinger, Johannes Blümlein, Abilio De Freitas, Mark van Hoeij, Erdal Imamoglu, Clemens G. Raab, Cristian-Silviu Radu, Carsten Schneider:
Iterated Elliptic and Hypergeometric Integrals for Feynman Diagrams. CoRR abs/1706.01299 (2017) - 2016
- [i10]Mark van Hoeij, Michael B. Monagan:
A Modular Algorithm for Computing Polynomial GCDs over Number Fields presented with Multiple Extensions. CoRR abs/1601.01038 (2016) - [i9]Jonas Szutkoski, Mark van Hoeij:
The Complexity of Computing all Subfields of an Algebraic Number Field. CoRR abs/1606.01140 (2016) - [i8]Erdal Imamoglu, Mark van Hoeij:
Computing Hypergeometric Solutions of Second Order Linear Differential Equations using Quotients of Formal Solutions and Integral Bases. CoRR abs/1606.01576 (2016) - [i7]Alin Bostan, Frédéric Chyzak, Mark van Hoeij, Manuel Kauers, Lucien Pech:
Hypergeometric Expressions for Generating Functions of Walks with Small Steps in the Quarter Plane. CoRR abs/1606.02982 (2016) - [i6]Shaoshi Chen, Mark van Hoeij, Manuel Kauers, Christoph Koutschan:
Reduction-Based Creative Telescoping for Fuchsian D-finite Functions. CoRR abs/1611.07421 (2016) - 2015
- [c27]Erdal Imamoglu, Mark van Hoeij:
Computing Hypergeometric Solutions of Second Order Linear Differential Equations using Quotients of Formal Solutions. ISSAC 2015: 235-242 - [i5]Mark van Hoeij:
Groebner basis in Boolean rings is not polynomial-space. CoRR abs/1502.07220 (2015) - 2014
- [j19]Mark van Hoeij, Erdal Imamoglu:
2F1-type Solutions of Second Order Differential Equations. ACM Commun. Comput. Algebra 48(3/4): 143-144 (2014) - [c26]Mark van Hoeij, Raimundas Vidunas:
Computation of Genus 0 Belyi Functions. ICMS 2014: 92-98 - 2013
- [j18]Mark van Hoeij, Jürgen Klüners, Andrew Novocin:
Generating subfields. J. Symb. Comput. 52: 17-34 (2013) - [c25]Mark van Hoeij:
The complexity of factoring univariatepolynomials over the rationals: tutorial abstract. ISSAC 2013: 13-14 - [c24]Vijay Jung Kunwar, Mark van Hoeij:
Second order differential equations with hypergeometric solutions of degree three. ISSAC 2013: 235-242 - [i4]Mark van Hoeij:
Computing Puiseux Expansions at Cusps of the Modular Curve X0(N). CoRR abs/1307.1627 (2013) - 2012
- [j17]Mark van Hoeij, Andrew Novocin:
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. Algorithmica 63(3): 616-633 (2012) - [j16]Mark van Hoeij, Vijay Jung Kunwar:
Finding 2F1 type solutions of differential equations with 5 singularities. ACM Commun. Comput. Algebra 46(3/4): 96-97 (2012) - [e1]Joris van der Hoeven, Mark van Hoeij:
International Symposium on Symbolic and Algebraic Computation, ISSAC'12, Grenoble, France - July 22 - 25, 2012. ACM 2012, ISBN 978-1-4503-1269-1 [contents] - 2011
- [j15]Sergei A. Abramov, Moulay A. Barkatou, Mark van Hoeij, Marko Petkovsek:
Subanalytic solutions of linear difference equations and multidimensional hypergeometric sequences. J. Symb. Comput. 46(11): 1205-1228 (2011) - [c23]Tingting Fang, Mark van Hoeij:
2-descent for second order linear differential equations. ISSAC 2011: 107-114 - [c22]William Hart, Mark van Hoeij, Andrew Novocin:
Practical polynomial factoring in polynomial time. ISSAC 2011: 163-170 - [c21]Mark van Hoeij, Jürgen Klüners, Andrew Novocin:
Generating subfields. ISSAC 2011: 345-352 - [i3]Alin Bostan, Frédéric Chyzak, Mark van Hoeij, Lucien Pech:
Explicit formula for the generating series of diagonal 3D rook paths. CoRR abs/1105.4456 (2011) - 2010
- [j14]Mark van Hoeij:
Abstract only: The complexity of factoring univariate polynomials over the rationals. ACM Commun. Comput. Algebra 44(1/2): 24 (2010) - [j13]Yongjae Cha, Mark van Hoeij, Giles Levy:
Abstract only: Solving linear recurrence relations. ACM Commun. Comput. Algebra 44(1/2): 26 (2010) - [j12]Tingting Fang, Mark van Hoeij:
Abstract only: Solving linear differential equations by using descent. ACM Commun. Comput. Algebra 44(1/2): 26 (2010) - [j11]Yongjae Cha, Mark van Hoeij, Giles Levy:
Solving linear recurrence equations. ACM Commun. Comput. Algebra 44(3/4): 183-185 (2010) - [c20]Mark van Hoeij, Quan Yuan:
Finding all bessel type solutions for linear differential equations with rational function coefficients. ISSAC 2010: 37-44 - [c19]Mark van Hoeij, Giles Levy:
Liouvillian solutions of irreducible second order linear difference equations. ISSAC 2010: 297-301 - [c18]Yongjae Cha, Mark van Hoeij, Giles Levy:
Solving recurrence relations using local invariants. ISSAC 2010: 303-309 - [c17]Mark van Hoeij, Andrew Novocin:
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials. LATIN 2010: 539-553 - [i2]Mark van Hoeij, Andrew Novocin:
Gradual sub-lattice reduction and a new complexity for factoring polynomials. CoRR abs/1002.0739 (2010) - [i1]Mark van Hoeij, Vivek Pal:
Isomorphisms of Algebraic Number Fields. CoRR abs/1012.0096 (2010)
2000 – 2009
- 2009
- [c16]Yongjae Cha, Mark van Hoeij:
Liouvillian solutions of irreducible linear difference equations. ISSAC 2009: 87-94 - 2008
- [j10]Andy Novocin, Mark van Hoeij:
Factoring univariate polynomials over the rationals. ACM Commun. Comput. Algebra 42(3): 157 (2008) - [c15]Ruben Debeerst, Mark van Hoeij, Wolfram Koepf:
Solving differential equations in terms of bessel functions. ISSAC 2008: 39-46 - 2007
- [c14]André Galligo, Mark van Hoeij:
Approximate bivariate factorization: a geometric viewpoint. SNC 2007: 1-10 - [c13]Mark van Hoeij:
Solving third order linear differential equations in terms of second order equations. ISSAC 2007: 355-360 - 2006
- [j9]Thomas Cluzeau, Mark van Hoeij:
Computing Hypergeometric Solutions of Linear Recurrence Equations. Appl. Algebra Eng. Commun. Comput. 17(2): 83-115 (2006) - [j8]Sergei A. Abramov, Moulay A. Barkatou, Mark van Hoeij:
Apparent singularities of linear difference equations with polynomial coefficients. Appl. Algebra Eng. Commun. Comput. 17(2): 117-133 (2006) - 2005
- [c12]Mark van Hoeij, Jacques-Arthur Weil:
Solving second order linear differential equations with Klein's theorem. ISSAC 2005: 340-347 - 2004
- [j7]Thomas Cluzeau, Mark van Hoeij:
A modular algorithm for computing the exponential solutions of a linear differential operator. J. Symb. Comput. 38(3): 1043-1076 (2004) - [j6]Bernard Deconinck, Matthias Heil, Alexander I. Bobenko, Mark van Hoeij, Markus Schmies:
Computing Riemann theta functions. Math. Comput. 73(247): 1417-1442 (2004) - [c11]Reinhold Burger, George Labahn, Mark van Hoeij:
Closed form solutions of linear odes having elliptic function coefficients. ISSAC 2004: 58-64 - [c10]Mark van Hoeij, Michael B. Monagan:
Algorithms for polynomial GCD computation over algebraic function fields. ISSAC 2004: 297-304 - 2002
- [c9]Mark van Hoeij, Michael B. Monagan:
A modular GCD algorithm over number fields presented with multiple extensions. ISSAC 2002: 109-116 - 2001
- [c8]Mark van Hoeij:
Factoring Polynomials and 0-1 Vectors. CaLC 2001: 45-50 - [c7]Robert M. Corless, Mark Giesbrecht, Mark van Hoeij, Ilias S. Kotsireas, Stephen M. Watt:
Towards factoring bivariate approximate polynomials. ISSAC 2001: 85-92
1990 – 1999
- 1999
- [j5]Mark van Hoeij, Jean-François Ragot, Felix Ulmer, Jacques-Arthur Weil:
Liouvillian Solutions of Linear Differential Equations of Order Three and Higher. J. Symb. Comput. 28(4-5): 589-609 (1999) - [c6]Sergei A. Abramov, Mark van Hoeij:
Desingularization of Linear Difference Operators with Polynomial Coefficients. ISSAC 1999: 269-275 - 1998
- [c5]Mark van Hoeij:
Rational Solutions of Linear Difference Equations. ISSAC 1998: 120-123 - 1997
- [j4]Mark van Hoeij:
Rational Parametrizations of Algebraic Curves Using a Canonical Divisor. J. Symb. Comput. 23(2/3): 209-227 (1997) - [j3]Mark van Hoeij:
Formal Solutions and Factorization of Differential Operators with Power Series Coefficients. J. Symb. Comput. 24(1): 1-30 (1997) - [j2]Mark van Hoeij:
Factorization of Differential Operators with Rational Functions Coefficients. J. Symb. Comput. 24(5): 537-561 (1997) - [c4]Sergei A. Abramov, Mark van Hoeij:
A Method for the Integration of Solutions of Ore Equations. ISSAC 1997: 172-175 - 1996
- [c3]Mark van Hoeij:
Rational Solutions of the Mixed Differential Equation and Its Application to Factorization of Differential Operators. ISSAC 1996: 219-225 - 1995
- [c2]Mark van Hoeij:
An Algorithm for Computing the Weierstrass Normal Form. ISSAC 1995: 90-95 - 1994
- [j1]Mark van Hoeij:
An Algorithm for Computing an Integral Basis in an Algebraic Function Field. J. Symb. Comput. 18(4): 353-363 (1994) - [c1]Mark van Hoeij:
Computing Parameterizations of Rational Algebraic Curves. ISSAC 1994: 187-190
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-20 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
