| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Adaptivity and computational complexity in the numerical solution of ODEs
|
Ilie, Silvana
|
|
2008
|
24 |
3 |
p. 341-361
21 p.
|
article
|
| 2 |
Anargyros Papageorgiou Wins the 2008 Information-Based
|
|
|
2008
|
24 |
3 |
p. 326-
1 p.
|
article
|
| 3 |
Approximation complexity of additive random fields
|
Lifshits, M.A.
|
|
2008
|
24 |
3 |
p. 362-379
18 p.
|
article
|
| 4 |
Cover 2: Editorial Board
|
|
|
2008
|
24 |
3 |
p. IFC-
1 p.
|
article
|
| 5 |
fmi: Editorial Board (continued)
|
|
|
2008
|
24 |
3 |
p. i-
1 p.
|
article
|
| 6 |
2008 Information-Based Complexity Young Researcher Award Committee
|
|
|
2008
|
24 |
3 |
p. 327-
1 p.
|
article
|
| 7 |
M. Avendano, T. Krick, M. Sombra, I. Berkes, W. Philipp, and R. Tichy Share the2007 Best Paper Award
|
|
|
2008
|
24 |
3 |
p. 325-
1 p.
|
article
|
| 8 |
Newton's method for sections on Riemannian manifolds: Generalized covariant α -theory
|
Li, Chong
|
|
2008
|
24 |
3 |
p. 423-451
29 p.
|
article
|
| 9 |
Obtaining fast error rates in nonconvex situations
|
Mendelson, Shahar
|
|
2008
|
24 |
3 |
p. 380-397
18 p.
|
article
|
| 10 |
On obtaining higher order convergence for smooth periodic functions
|
Vandewoestyne, Bart
|
|
2008
|
24 |
3 |
p. 328-340
13 p.
|
article
|
| 11 |
The asymptotic normalized linear complexity of multisequences
|
Vielhaber, Michael
|
|
2008
|
24 |
3 |
p. 410-422
13 p.
|
article
|
| 12 |
The complexity of function approximation on Sobolev spaces with bounded mixed derivative by linear Monte Carlo methods
|
Fang, Gensun
|
|
2008
|
24 |
3 |
p. 398-409
12 p.
|
article
|
Journal description