Robert M. Corless

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 Silvana Ilie

> Home > Persons > Robert M. Corless

Publications

2015
[c26]
- view
  authority control:
- export record
  dblp key:
  - conf/synasc/IlieJCZ15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/synasc/IlieJCZ15
Silvana Ilie, David J. Jeffrey, Robert M. Corless, X. Zhang:
Computation of Stirling Numbers and Generalizations. SYNASC 2015: 57-60
2009
[j34]
- view
  authority control:
- export record
  dblp key:
  - journals/mics/IlieCE09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mics/IlieCE09
Silvana Ilie, Robert M. Corless, Chris Essex:
The Computational Complexity of Extrapolation Methods. Math. Comput. Sci. 2(4): 557-566 (2009)
2008
[j33]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/jc/IlieSC08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jc/IlieSC08
Silvana Ilie, Gustaf Söderlind, Robert M. Corless:
Adaptivity and computational complexity in the numerical solution of ODEs. J. Complex. 24(3): 341-361 (2008)
2006
[j28]
- view
  authority control:
- export record
  dblp key:
  - journals/na/IlieCR06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/na/IlieCR06
Silvana Ilie, Robert M. Corless, Greg Reid:
Numerical solutions of index-1 differential algebraic equations can be computed in polynomial time. Numer. Algorithms 41(2): 161-171 (2006)

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.