default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc Mezzarobba
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Denis Arzelier, Florent Bréhard, Mioara Joldes, Marc Mezzarobba:
Rounding Error Analysis of an Orbital Collision Probability Evaluation Algorithm. ARITH 2024: 96-103- [i16]Frédéric Chyzak, Thomas Dreyfus, Philippe Dumas, Marc Mezzarobba:
First-order factors of linear Mahler operators. CoRR abs/2403.11545 (2024) - 2023
- [j8]Ruiwen Dong
, Stephen Melczer, Marc Mezzarobba:
Computing error bounds for asymptotic expansions of regular P-recursive sequences. Math. Comput. 93(346): 977-1017 (2023) - 2022
- [j7]Stephen Melczer, Marc Mezzarobba:
Sequence positivity through numeric analytic continuation: uniqueness of the Canham model for biomembranes. Comb. Theory 2(2) (2022) - [c9]Frédéric Chyzak, Alexandre Goyer, Marc Mezzarobba:
Symbolic-Numeric Factorization of Differential Operators. ISSAC 2022: 73-82 - [i15]Frédéric Chyzak, Alexandre Goyer, Marc Mezzarobba:
Symbolic-Numeric Factorization of Differential Operators. CoRR abs/2205.08991 (2022) - [i14]Ruiwen Dong, Stephen Melczer, Marc Mezzarobba:
Computing error bounds for asymptotic expansions of regular P-recursive sequences. CoRR abs/2212.11742 (2022) - 2021
- [i13]Xavier Caruso, Marc Mezzarobba, Nobuki Takayama, Tristan Vaccon:
Fast evaluation of some p-adic transcendental functions. CoRR abs/2106.09315 (2021) - 2020
- [i12]Marc Mezzarobba:
Rounding Error Analysis of Linear Recurrences Using Generating Series. CoRR abs/2011.00827 (2020) - [i11]Stephen Melczer, Marc Mezzarobba:
Sequence Positivity Through Numeric Analytic Continuation: Uniqueness of the Canham Model for Biomembranes. CoRR abs/2011.08155 (2020)
2010 – 2019
- 2019
- [j6]Manuel Kauers, Marc Mezzarobba:
Multivariate ore polynomials in SageMath. ACM Commun. Comput. Algebra 53(2): 57-60 (2019) - [c8]Pierre Lairez, Marc Mezzarobba, Mohab Safey El Din:
Computing the Volume of Compact Semi-Algebraic Sets. ISSAC 2019: 259-266 - [i10]Pierre Lairez, Marc Mezzarobba, Mohab Safey El Din:
Computing the volume of compact semi-algebraic sets. CoRR abs/1904.11705 (2019) - 2018
- [j5]Frédéric Chyzak, Thomas Dreyfus, Philippe Dumas, Marc Mezzarobba:
Computing solutions of linear Mahler equations. Math. Comput. 87(314): 2977-3021 (2018) - [j4]Fredrik Johansson, Marc Mezzarobba:
Fast and Rigorous Arbitrary-Precision Computation of Gauss-Legendre Quadrature Nodes and Weights. SIAM J. Sci. Comput. 40(6): C726-C747 (2018) - [i9]Fredrik Johansson, Marc Mezzarobba:
Fast and rigorous arbitrary-precision computation of Gauss-Legendre quadrature nodes and weights. CoRR abs/1802.03948 (2018) - 2017
- [j3]Alexandre Benoît, Mioara Joldes, Marc Mezzarobba:
Rigorous uniform approximation of D-finite functions using Chebyshev expansions. Math. Comput. 86(305): 1303-1341 (2017) - 2016
- [j2]Nicolas Brisebarre, Christoph Quirin Lauter, Marc Mezzarobba, Jean-Michel Muller:
Comparison between Binary and Decimal Floating-Point Numbers. IEEE Trans. Computers 65(7): 2032-2044 (2016) - [i8]Marc Mezzarobba:
Rigorous Multiple-Precision Evaluation of D-Finite Functions in SageMath. CoRR abs/1607.01967 (2016) - [i7]Frédéric Chyzak, Thomas Dreyfus, Philippe Dumas, Marc Mezzarobba:
Computing solutions of linear Mahler equations. CoRR abs/1612.05518 (2016) - 2015
- [c7]Christoph Quirin Lauter, Marc Mezzarobba:
Semi-Automatic Floating-Point Implementation of Special Functions. ARITH 2015: 58-65 - 2014
- [i6]Alexandre Benoît, Mioara Joldes, Marc Mezzarobba:
Rigorous uniform approximation of D-finite functions using Chebyshev expansions. CoRR abs/1407.2802 (2014) - 2013
- [c6]Nicolas Brisebarre, Marc Mezzarobba, Jean-Michel Muller, Christoph Quirin Lauter:
Comparison between Binary64 and Decimal64 Floating-Point Numbers. IEEE Symposium on Computer Arithmetic 2013: 145-152 - [c5]Sylvain Chevillard, Marc Mezzarobba:
Multiple-Precision Evaluation of the Airy Ai Function with Reduced Cancellation. IEEE Symposium on Computer Arithmetic 2013: 175-182 - [c4]Fredrik Johansson, Manuel Kauers, Marc Mezzarobba:
Finding hyperexponential solutions of linear ODEs by numerical evaluation. ISSAC 2013: 211-218 - [i5]Fredrik Johansson, Manuel Kauers, Marc Mezzarobba:
Finding Hyperexponential Solutions of Linear ODEs by Numerical Evaluation. CoRR abs/1301.2486 (2013) - 2012
- [c3]Marc Mezzarobba:
A Note on the Space Complexity of Fast D-Finite Function Evaluation. CASC 2012: 212-223 - [i4]Marc Mezzarobba:
A Note on the Space Complexity of Fast D-Finite Function Evaluation. CoRR abs/1209.5097 (2012) - [i3]Sylvain Chevillard, Marc Mezzarobba:
Multiple precision evaluation of the Airy Ai function with reduced cancellation. CoRR abs/1212.4731 (2012) - 2011
- [b1]Marc Mezzarobba:
Autour de l'évaluation numérique des fonctions D-finies. (Around the Numerical Evaluation of D-Finite Functions). École Polytechnique, Palaiseau, France, 2011 - 2010
- [j1]Marc Mezzarobba, Bruno Salvy:
Effective bounds for P-recursive sequences. J. Symb. Comput. 45(10): 1075-1096 (2010) - [c2]Alexandre Benoît, Frédéric Chyzak, Alexis Darrasse, Stefan Gerhold, Marc Mezzarobba, Bruno Salvy:
The Dynamic Dictionary of Mathematical Functions (DDMF). ICMS 2010: 35-41 - [c1]Marc Mezzarobba:
NumGfun: a package for numerical and analytic computation with D-finite functions. ISSAC 2010: 139-145 - [i2]Marc Mezzarobba:
NumGfun: a Package for Numerical and Analytic Computation with D-finite Functions. CoRR abs/1002.3077 (2010)
2000 – 2009
- 2009
- [i1]Marc Mezzarobba, Bruno Salvy:
Effective Bounds for P-Recursive Sequences. CoRR abs/0904.2452 (2009)
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 2025-01-21 00:13 CET 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:
