Fabio Fagnani

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Luciano Pandolfi

> Home > Persons > Fabio Fagnani

Publications

2004
[j10]
- view
  authority control:
- export record
  dblp key:
  - journals/tac/FagnaniMP04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tac/FagnaniMP04
Fabio Fagnani, Vjaceslav Maksimov, Luciano Pandolfi:
A recursive deconvolution approach to disturbance reduction. IEEE Trans. Autom. Control. 49(6): 907-921 (2004)
2002
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/siamco/FagnaniP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamco/FagnaniP02
Fabio Fagnani, Luciano Pandolfi:
A Singular Perturbation Approach to a Recursive Deconvolution Problem. SIAM J. Control. Optim. 40(5): 1384-1405 (2002)
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/amcc/FagnaniP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/amcc/FagnaniP02
Fabio Fagnani, Luciano Pandolfi:
Recursive deconvolution of first kind Volterra equations. ACC 2002: 2927-2928
[c2]
- no documents available
  - details & citations
- export record
  dblp key:
  - conf/ifip7-2/FagnaniP02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ifip7-2/FagnaniP02
Fabio Fagnani, Luciano Pandolfi:
Recursive deconvolution: an overview of some recent results. Analysis and Optimization of Differential Systems 2002: 145-156

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.