The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Ian H. Sloan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ian H. Sloan, Robert S. Womersley
    Extremal Systems of Points and Numerical Integration on the Sphere. [Citation Graph (0, 0)][DBLP]
    Adv. Comput. Math., 2004, v:21, n:1-2, pp:107-125 [Journal]
  2. Erich Novak, Ian H. Sloan, Henryk Wozniakowski
    Tractability of Approximation for Weighted Korobov Spaces on Classical and Quantum Computers. [Citation Graph (0, 0)][DBLP]
    Foundations of Computational Mathematics, 2004, v:4, n:2, pp:121-156 [Journal]
  3. R. D. Grigorieff, Ian H. Sloan
    Discrete orthogonal projections on multiple knot periodic splines. [Citation Graph (0, 0)][DBLP]
    Journal of Approximation Theory, 2005, v:137, n:2, pp:201-225 [Journal]
  4. Kerstin Hesse, Ian H. Sloan
    Cubature over the sphere S2 in Sobolev spaces of arbitrary order. [Citation Graph (0, 0)][DBLP]
    Journal of Approximation Theory, 2006, v:141, n:2, pp:118-133 [Journal]
  5. Josef Dick, Ian H. Sloan, Xiaoqun Wang, Henryk Wozniakowski
    Liberating the weights. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:5, pp:593-623 [Journal]
  6. Kerstin Hesse, Ian H. Sloan
    Optimal lower bounds for cubature error on the sphere S2. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:6, pp:790-803 [Journal]
  7. Frances Y. Kuo, Ian H. Sloan
    Quasi-Monte Carlo methods can be efficient for integration over products of spheres. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2005, v:21, n:2, pp:196-210 [Journal]
  8. Erich Novak, Ian H. Sloan, Henryk Wozniakowski
    Tractability of Tensor Product Linear Operators. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1997, v:13, n:4, pp:387-418 [Journal]
  9. Ian H. Sloan, Henryk Wozniakowski
    Tractability of Multivariate Integration for Weighted Korobov Classes. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2001, v:17, n:4, pp:697-721 [Journal]
  10. Ian H. Sloan, Henryk Wozniakowski
    Tractability of Integration in Non-periodic and Periodic Weighted Tensor Product Hilbert Spaces. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2002, v:18, n:2, pp:479-499 [Journal]
  11. Ian H. Sloan, Henryk Wozniakowski
    When Are Quasi-Monte Carlo Algorithms Efficient for High Dimensional Integrals? [Citation Graph (0, 0)][DBLP]
    J. Complexity, 1998, v:14, n:1, pp:1-33 [Journal]
  12. Ian H. Sloan, Xiaoqun Wang, Henryk Wozniakowski
    Finite-order weights imply tractability of multivariate integration. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2004, v:20, n:1, pp:46-74 [Journal]
  13. Ian H. Sloan, Arthur G. Werschultz
    ANNOUNCEMENT: 2001 Best Paper Award Committee. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2001, v:17, n:3, pp:495-0 [Journal]
  14. Leszek Plaskota, Ian H. Sloan
    Guest Editors' preface. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:5, pp:- [Journal]
  15. Benjamin J. Waterhouse, Frances Y. Kuo, Ian H. Sloan
    Randomly shifted lattice rules on the unit cube for unbounded integrands in high dimensions. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2006, v:22, n:1, pp:71-101 [Journal]
  16. Kerstin Hesse, Frances Y. Kuo, Ian H. Sloan
    A component-by-component approach to efficient numerical integration over products of spheres. [Citation Graph (0, 0)][DBLP]
    J. Complexity, 2007, v:23, n:1, pp:25-51 [Journal]
  17. Ronald Cools, Ian H. Sloan
    Minimal cubature formulae of trigonometric degree. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1996, v:65, n:216, pp:1583-1600 [Journal]
  18. Fred J. Hickernell, Ian H. Sloan, Grzegorz W. Wasilkowski
    On tractability of weighted integration over bounded and unbounded regions in Reals. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2004, v:73, n:248, pp:1885-1901 [Journal]
  19. Fred J. Hickernell, Ian H. Sloan, Grzegorz W. Wasilkowski
    On strong tractability of weighted multivariate integration. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2004, v:73, n:248, pp:1903-1911 [Journal]
  20. Ch. Lubich, Ian H. Sloan, Vidar Thomée
    Nonsmooth data error estimates for approximations of an evolution equation with a positive-type memory term. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1996, v:65, n:213, pp:1-17 [Journal]
  21. Dongwoo Sheen, Ian H. Sloan, Vidar Thomée
    A parallel method for time-discretization of parabolic problems based on contour integral representation and quadrature. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2000, v:69, n:229, pp:177-195 [Journal]
  22. Ian H. Sloan, Frances Y. Kuo, Stephen Joe
    On the step-by-step construction of quasi--Monte Carlo integration rules that achieve strong tractability error bounds in weighted Sobolev spaces. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2002, v:71, n:240, pp:1609-1640 [Journal]
  23. Ian H. Sloan, Andrew V. Reztsov
    Component-by-component construction of good lattice rules. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 2002, v:71, n:237, pp:263-273 [Journal]
  24. Ian H. Sloan, Henryk Wozniakowski
    An intractability result for multiple integration. [Citation Graph (0, 0)][DBLP]
    Math. Comput., 1997, v:66, n:219, pp:1119-1124 [Journal]
  25. Xiaoqun Wang, Ian H. Sloan
    Why Are High-Dimensional Finance Problems Often of Low Effective Dimension?. [Citation Graph (0, 0)][DBLP]
    SIAM J. Scientific Computing, 2005, v:27, n:1, pp:159-183 [Journal]
  26. Xiaoqun Wang, Ian H. Sloan
    Efficient Weighted Lattice Rules with Applications to Finance. [Citation Graph (0, 0)][DBLP]
    SIAM J. Scientific Computing, 2006, v:28, n:2, pp:728-750 [Journal]

  27. 06391 Abstracts Collection -- Algorithms and Complexity for Continuous Problems. [Citation Graph (, )][DBLP]


  28. Approximation on the sphere using radial basis functions plus polynomials. [Citation Graph (, )][DBLP]


  29. Discrete qualocation methods for logarithmic-kernel integral equations on a piecewise smooth boundary. [Citation Graph (, )][DBLP]


  30. How good can polynomial interpolation on the sphere be? [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.304secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002