| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A Theory of Complexity for Continuous Time Systems
|
Ben-Hur, Asa
|
|
2002
|
18 |
1 |
p. 51-86
36 p.
|
artikel
|
| 2 |
Complexity Estimates for Representations of Schmüdgen Type
|
Mauch, Elizabeth
|
|
2002
|
18 |
1 |
p. 346-355
10 p.
|
artikel
|
| 3 |
Complexity Theory for Lie-Group Solvers
|
Celledoni, Elena
|
|
2002
|
18 |
1 |
p. 242-286
45 p.
|
artikel
|
| 4 |
Computation of Edit Probabilities and Edit Distances for the A5-Type Keystream Generator
|
Golić, Jovan Dj.
|
|
2002
|
18 |
1 |
p. 356-374
19 p.
|
artikel
|
| 5 |
Input–Output Identifiability of Continuous-Time Linear Systems
|
Harrison, K.J.
|
|
2002
|
18 |
1 |
p. 210-223
14 p.
|
artikel
|
| 6 |
Kantorovich's Theorem on Newton's Method in Riemannian Manifolds
|
Ferreira, O.P.
|
|
2002
|
18 |
1 |
p. 304-329
26 p.
|
artikel
|
| 7 |
Learnability in Hilbert Spaces with Reproducing Kernels
|
Mendelson, Shahar
|
|
2002
|
18 |
1 |
p. 152-170
19 p.
|
artikel
|
| 8 |
Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform
|
Meidl, Wilfried
|
|
2002
|
18 |
1 |
p. 87-103
17 p.
|
artikel
|
| 9 |
Newton's Method for Analytic Systems of Equations with Constant Rank Derivatives
|
Dedieu, Jean-Pierre
|
|
2002
|
18 |
1 |
p. 187-209
23 p.
|
artikel
|
| 10 |
On Asymptotically Optimal Methods of Prediction and Adaptive Coding for Markov Sources
|
Ryabko, Boris Ya.
|
|
2002
|
18 |
1 |
p. 224-241
18 p.
|
artikel
|
| 11 |
Quantum Summation with an Application to Integration
|
Heinrich, S.
|
|
2002
|
18 |
1 |
p. 1-50
50 p.
|
artikel
|
| 12 |
Real Computations with Fake Numbers
|
Cucker, Felipe
|
|
2002
|
18 |
1 |
p. 104-134
31 p.
|
artikel
|
| 13 |
Relations between Classical, Average, and Probabilistic Kolmogorov Widths
|
Creutzig, Jakob
|
|
2002
|
18 |
1 |
p. 287-303
17 p.
|
artikel
|
| 14 |
The Brownian Bridge Does Not Offer a Consistent Advantage in Quasi-Monte Carlo Integration
|
Papageorgiou, A.
|
|
2002
|
18 |
1 |
p. 171-186
16 p.
|
artikel
|
| 15 |
The Discrepancy and Gain Coefficients of Scrambled Digital Nets
|
Yue, Rong-Xian
|
|
2002
|
18 |
1 |
p. 135-151
17 p.
|
artikel
|
| 16 |
The New k-Windows Algorithm for Improving thek -Means Clustering Algorithm
|
Vrahatis, M.N.
|
|
2002
|
18 |
1 |
p. 375-391
17 p.
|
artikel
|
| 17 |
Worst Case Complexity of Weighted Approximation and Integration over R d
|
Li, Youming
|
|
2002
|
18 |
1 |
p. 330-345
16 p.
|
artikel
|
Tijdschrift beschrijving