77 | -- | 88 | Stefan Heinrich, Bernhard Milla. The randomized complexity of initial value problems |
89 | -- | 108 | Jean-Pierre Dedieu, Gregorio Malajovich. On the number of minima of a random polynomial |
109 | -- | 133 | Junyi Lin, Xiaoqun Wang. New Brownian bridge construction in quasi-Monte Carlo methods for computational finance |
134 | -- | 143 | Aicke Hinrichs, Friedrich Pillichshammer, Wolfgang Ch. Schmid. Tractability properties of the weighted star discrepancy |
144 | -- | 153 | Li-Ping Wang, Harald Niederreiter. Successive minima profile, lattice profile, and joint linear complexity profile of pseudorandom multisequences |
154 | -- | 172 | Michael Gnewuch. Bracketing numbers for axis-parallel boxes and applications to geometric discrepancy |
173 | -- | 184 | Jia Jie Liu, Yue-Li Wang, Richard C. T. Lee. Finding a longest common subsequence between a run-length-encoded string and an uncompressed string |
185 | -- | 197 | J. M. Gutiérrez, M. A. Hernández, N. Romero. A note on a modification of Moser s method |
198 | -- | 213 | Jiang Yanjie. Approximation of anisotropic classes by standard information |
214 | -- | 227 | Jun Ji, Florian A. Potra. On the probabilistic complexity of finding an approximate solution for linear programming |
228 | -- | 240 | Santhosh George, M. Thamban Nair. A modified Newton-Lavrentiev regularization for nonlinear ill-posed Hammerstein-type operator equations |
241 | -- | 258 | Sheng Baohuai, Wang Jianli, Li Ping. The covering number for some Mercer kernel Hilbert spaces |
259 | -- | 282 | Liu Yongping, Yang Lianhong. Relative widths of smooth functions determined by fractional order derivatives |
283 | -- | 323 | Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski. Lattice rule algorithms for multivariate approximation in the average case setting |