Title	Publication Date	Language	Citations
A fast and efficient composite Newton–Chebyshev method for systems of nonlinear equations	2018/12/01	English	12
Product Gauss quadrature rules vs. cubature rules in the meshless local Petrov–Galerkin method	2010/02/01	English	12
On multiplication in finite fields	2010/04/01	English	12
Efficient algorithms for the longest common subsequence problem with sequential substring constraints	2013/02/01	English	12
Exponential convergence-tractability of general linear problems in the average case setting	2015/08/01	English	12
Quasi-Monte Carlo Simulation of Diffusion	1999/09/01	English	12
On A Scheduling Problem of Time Deteriorating Jobs	1998/06/01	English	12
The Minimal Radius of Galerkin Information for the Fredholm Problem of the First Kind	1996/12/01	English	12
On Computing a Set of Points Meeting Every Cell Defined by a Family of Polynomials on a Variety	1997/03/01	English	12
Symplectic methods for the approximation of the exponential map and the Newton iteration on Riemannian submanifolds	2005/08/01	English	12
Analytic reparametrization of semi-algebraic sets	2008/02/01	English	11
Generalized von Neumann–Kakutani transformation and random-start scrambled Halton sequences	2009/08/01	English	11
On the convergence rate and some applications of regularized ranking algorithms	2016/04/01	English	11
Digital nets with infinite digit expansions and construction of folded digital nets for quasi-Monte Carlo integration	2016/04/01	English	11
Z8-Kerdock codes and pseudorandom binary sequences	2004/04/01	English	11
On maximum length convolutional codes under a trellis complexity constraint	2004/04/01	English	11
On the complexity of curve fitting algorithms	2004/08/01	English	11
Algorithmic construction of low-discrepancy point sets via dependent randomized rounding	2010/10/01	English	11
Optimal importance sampling for the approximation of integrals	2010/04/01	English	11
Quasi-polynomial tractability of linear problems in the average case setting	2014/02/01	English	11
Intrinsic complexity estimates in polynomial optimization	2014/08/01	English	11
Approximation complexity of additive random fields	2008/06/01	English	11
Free-knot spline approximation of stochastic processes	2007/08/01	English	11
Approximation on anisotropic Besov classes with mixed norms by standard information	2005/06/01	English	11
Computation of Darboux polynomials and rational first integrals with bounded degree in polynomial time	2011/04/01	English	11
Discrepancy based model selection in statistical inverse problems	2014/06/01	English	11
Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields	2000/12/01	English	11
Approximating Fixed Points of Weakly Contracting Mappings	1999/06/01	English	11
Direct Estimation of Linear Functionals from Indirect Noisy Observations	2002/06/01	English	11
Lyapunov Exponents versus Expansivity and Sensitivity in Cellular Automata	1998/06/01	English	11