default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAurélien Alfonsi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i4]Aurélien Alfonsi, Edoardo Lombardo:
High order approximations of the log-Heston process semigroup. CoRR abs/2407.17151 (2024)- 2023
- [j12]Aurélien Alfonsi, Ahmed Kebaier:
Approximation of Stochastic Volterra Equations with kernels of completely monotone type. Math. Comput. 93(346): 643-677 (2023) - 2022
- [i3]Aurélien Alfonsi, Edoardo Lombardo:
High order approximations of the Cox-Ingersoll-Ross process semigroup using random grids. CoRR abs/2209.13334 (2022) - 2021
- [j11]Aurélien Alfonsi
, Rafaël Coyaud, Virginie Ehrlacher, Damiano Lombardi:
Approximation of optimal transport problems with marginal moments constraints. Math. Comput. 90(328): 689-737 (2021) - [j10]Aurélien Alfonsi, Vlad Bally:
A generic construction for high order approximation schemes of semigroups using random grids. Numerische Mathematik 148(4): 743-793 (2021) - [i2]Aurélien Alfonsi, Rafaël Coyaud, Virginie Ehrlacher:
Constrained overdamped Langevin dynamics for symmetric multimarginal optimal transportation. CoRR abs/2102.03091 (2021) - [i1]Aurélien Alfonsi, Ahmed Kebaier:
Approximation of Stochastic Volterra Equations with kernels of completely monotone type. CoRR abs/2102.13505 (2021)
2010 – 2019
- 2019
- [j9]Aurélien Alfonsi, David Krief, Peter Tankov:
Long-Time Large Deviations for the Multiasset Wishart Stochastic Volatility Model and Option Pricing. SIAM J. Financial Math. 10(4): 942-976 (2019) - 2016
- [j8]Aurélien Alfonsi, Pierre Blanc:
Dynamic optimal execution in a mixed-market-impact Hawkes price model. Finance Stochastics 20(1): 183-218 (2016) - [j7]Aurélien Alfonsi, Florian Klöck, Alexander Schied:
Multivariate Transient Price Impact and Matrix-Valued Positive Definite Functions. Math. Oper. Res. 41(3): 914-934 (2016) - 2013
- [j6]Aurélien Alfonsi, Alexander Schied:
Capacitary Measures for Completely Monotone Kernels via Singular Control. SIAM J. Control. Optim. 51(2): 1758-1780 (2013) - 2012
- [j5]Aurélien Alfonsi, Alexander Schied, Alla Slynko:
Order Book Resilience, Price Manipulation, and the Positive Portfolio Problem. SIAM J. Financial Math. 3(1): 511-533 (2012) - 2010
- [j4]Aurélien Alfonsi:
High order discretization schemes for the CIR process: Application to affine term structure and Heston models. Math. Comput. 79(269): 209-237 (2010) - [j3]Aurélien Alfonsi, Alexander Schied:
Optimal Trade Execution and Absence of Price Manipulations in Limit Order Book Models. SIAM J. Financial Math. 1(1): 490-522 (2010)
2000 – 2009
- 2005
- [j2]Damiano Brigo, Aurélien Alfonsi:
Credit default swap calibration and derivatives pricing with the SSRD stochastic intensity model. Finance Stochastics 9(1): 29-42 (2005) - [j1]Aurélien Alfonsi:
On the discretization schemes for the CIR (and Bessel squared) processes. Monte Carlo Methods Appl. 11(4): 355-384 (2005)
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-08-25 19:11 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:
