default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernard Hanzon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c12]Aidan O'Mahony, Gil Zeidan, Bernard Hanzon, Emanuel M. Popovici:
American Multinomial Option Pricing on FPGA using OneAPI. MWSCAS 2023: 831-835- 2022
- [j15]Aidan O'Mahony
, Gil Zeidan, Bernard Hanzon, Emanuel M. Popovici:
A parallel and pipelined implementation of a pascal-simplex based multi-asset option pricer on FPGA using OpenCL. Microprocess. Microsystems 90: 104508 (2022) - 2021
- [j14]Milad R. Vahid, Bernard Hanzon, Raimund J. Ober:
Effect of Pixelation on the Parameter Estimation of Single Molecule Trajectories. IEEE Trans. Computational Imaging 7: 98-113 (2021) - 2020
- [j13]Milad R. Vahid, Bernard Hanzon, Raimund J. Ober:
Fisher Information Matrix for Single Molecules with Stochastic Trajectories. SIAM J. Imaging Sci. 13(1): 234-264 (2020) - [c11]Aidan O'Mahony, Gil Zeidan, Bernard Hanzon, Emanuel M. Popovici:
A Parallel and Pipelined Implementation of a Pascal-Simplex Based Two Asset Option Pricer on FPGA using OpenCL. NorCAS 2020: 1-6
2010 – 2019
- 2018
- [j12]Dirk Sierag, Bernard Hanzon:
Pricing derivatives on multiple assets: recombining multinomial trees based on Pascal's simplex. Ann. Oper. Res. 266(1-2): 101-127 (2018)
2000 – 2009
- 2008
- [c10]Martine Olivi, Bernard Hanzon, Ralf L. M. Peeters:
Lossless scalar functions: Boundary interpolation, Schur algorithm and Ober's canonical form. CDC 2008: 1845-1850 - 2007
- [j11]Ivo W. M. Bleylevens, Ralf L. M. Peeters, Bernard Hanzon:
Efficiency improvement in an nD systems approach to polynomial optimization. J. Symb. Comput. 42(1-2): 30-53 (2007) - 2005
- [j10]Ralf L. M. Peeters, Bernard Hanzon:
Identifiability of homogeneous systems using the state isomorphism approach. Autom. 41(3): 513-529 (2005) - [j9]Thomas Ribarits, Manfred Deistler, Bernard Hanzon:
An analysis of separable least squares data driven local coordinates for maximum likelihood estimation of linear systems. Autom. 41(3): 531-544 (2005) - [c9]Ivo W. M. Bleylevens, Ralf Peeters, Bernard Hanzon:
An nD-systems approach to global polynomial optimization with an application to H2model order reduction. CDC/ECC 2005: 5107-5112 - [c8]Martine Olivi, Bernard Hanzon, Ralf L. M. Peeters:
A Schur algorithm for symmetric inner functions. CDC/ECC 2005: 8064-8069 - 2004
- [c7]Thomas Ribarits, Bernard Hanzon, Manfred Deistler:
Data driven local coordinates for normalized state-space systems: orthoDDLC. CDC 2004: 3593-3598 - 2003
- [j8]Bernard Hanzon, Dorina Jibetean:
Global Minimization of a Multivariate Polynomial using Matrix Methods. J. Glob. Optim. 27(1): 1-23 (2003) - [j7]Katrien De Cock, Bernard Hanzon, Bart De Moor:
On a cepstral norm for an ARMA model and the polar plot of the logarithm of its transfer function. Signal Process. 83(2): 439-443 (2003) - [c6]Martine Olivi, Jean-Paul Marmorat, Bernard Hanzon, Ralf L. M. Peeters:
Schur parametrizations and balanced realizations of real discrete-time stable all-pass systems. CDC 2003: 122-126 - [c5]Ralf L. M. Peeters, Bernard Hanzon, Dorina Jibetean:
Optimal H2 model reduction in state-space: A case study. ECC 2003: 3293-3298 - 2002
- [c4]Jean-Paul Marmorat, Martine Olivi, Bernard Hanzon, Ralf L. M. Peeters:
Matrix rational H2 approximation: a state-space approach using Schur parameters. CDC 2002: 4244-4249 - 2001
- [j6]Bernard Hanzon, Raimund J. Ober:
A State-Space Calculus for Rational Probability Density Functions and Applications to Non-Gaussian Filtering. SIAM J. Control. Optim. 40(3): 724-740 (2001) - [c3]Bernard Hanzon, Ralf L. M. Peeters:
On the state isomorphism approach to identifiability of homogeneous systems. CDC 2001: 3104-3105 - [c2]Dorina Jibetean, Bernard Hanzon:
Global identifiability analysis using algorithms for detecting connected semi-algebraic components. CDC 2001: 3114-3115 - 2000
- [j5]Bernard Hanzon, Ralf L. M. Peeters:
Balanced Parametrizations of Stable SISO All-Pass Systems in Discrete Time. Math. Control. Signals Syst. 13(3): 240-276 (2000)
1990 – 1999
- 1999
- [j4]Ralf L. M. Peeters, Bernard Hanzon:
Symbolic computation of Fisher information matrices for parametrized state-space systems. Autom. 35(6): 1059-1071 (1999) - [c1]Ralf L. M. Peeters, Bernard Hanzon, Martine Olivi:
Balanced realizations of discrete-time stable all-pass systems and the tangential Schur algorithm. ECC 1999: 1944-1948 - 1998
- [j3]Damiano Brigo, Bernard Hanzon, François LeGland:
A differential geometric approach to nonlinear filtering: the projection filter. IEEE Trans. Autom. Control. 43(2): 247-252 (1998) - 1996
- [j2]Bernard Hanzon, Jan M. Maciejowski:
Constructive algebra methods for the L2-problem for stable linear systems. Autom. 32(12): 1645-1657 (1996) - 1995
- [j1]Bernard Hanzon:
A new balanced canonical form for stable multivariable systems. IEEE Trans. Autom. Control. 40(2): 374-378 (1995)
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-04-24 22:59 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:
