default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Kritzer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j42]David Krieg
, Peter Kritzer:
Homogeneous algorithms and solvable problems on cones. J. Complex. 83: 101840 (2024)- [j41]Onyekachi Emenike, Fred J. Hickernell, Peter Kritzer:
A unified treatment of tractability for approximation problems defined on Hilbert spaces. J. Complex. 84: 101856 (2024) - [j40]Peter Kritzer:
Selected aspects of tractability analysis. J. Complex. 84: 101869 (2024) - [j39]Josef Dick, Adrian Ebert, Lukas Herrmann, Peter Kritzer, Marcello Longo:
The fast reduced QMC matrix-vector product. J. Comput. Appl. Math. 440: 115642 (2024) - [i16]Peter Kritzer:
Selected aspects of tractability analysis. CoRR abs/2402.02396 (2024) - [i15]Vishnupriya Anupindi, Peter Kritzer:
Column reduced digital nets. CoRR abs/2406.10850 (2024) - [i14]Philipp A. Guth, Peter Kritzer, Karl Kunisch:
Quasi-Monte Carlo integration for feedback control under uncertainty. CoRR abs/2409.15537 (2024) - 2023
- [j38]Peter Kritzer:
A note on the CBC-DBD construction of lattice rules with general positive weights. J. Complex. 76: 101721 (2023) - [i13]Josef Dick, Adrian Ebert, Lukas Herrmann, Peter Kritzer, Marcello Longo:
The fast reduced QMC matrix-vector product. CoRR abs/2305.11645 (2023) - [i12]Michael Gnewuch, Peter Kritzer, Art B. Owen, Zexin Pan:
Computable error bounds for quasi-Monte Carlo using points with non-negative local discrepancy. CoRR abs/2309.04209 (2023) - [i11]Onyekachi Emenike, Fred J. Hickernell, Peter Kritzer:
A unified treatment of tractability for approximation problems defined on Hilbert spaces. CoRR abs/2310.17777 (2023) - [i10]David Krieg, Peter Kritzer:
Homogeneous algorithms and solvable problems on cones. CoRR abs/2311.15767 (2023) - 2022
- [j37]Adrian Ebert, Peter Kritzer, Onyekachi Osisiogu, Tetiana Stepaniuk:
Construction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component construction. Math. Comput. Simul. 192: 399-419 (2022) - [i9]Adrian Ebert, Peter Kritzer, Friedrich Pillichshammer:
Tractability of approximation in the weighted Korobov space in the worst-case setting. CoRR abs/2201.09940 (2022) - [i8]Peter Kritzer:
A note on the CBC-DBD construction of lattice rules with general positive weights. CoRR abs/2208.13610 (2022) - [i7]Peter Kritzer, Onyekachi Osisiogu:
On a reduced digit-by-digit component-by-component construction of lattice point sets. CoRR abs/2211.12237 (2022) - 2021
- [j36]Adrian Ebert, Peter Kritzer, Dirk Nuyens, Onyekachi Osisiogu:
Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness. J. Complex. 66: 101555 (2021) - [j35]Peter Kritzer, Friedrich Pillichshammer, Grzegorz W. Wasilkowski:
On quasi-Monte Carlo methods in weighted ANOVA spaces. Math. Comput. 90(329): 1381-1406 (2021) - [i6]Adrian Ebert, Peter Kritzer, Onyekachi Osisiogu, Tetiana Stepaniuk:
Construction of good polynomial lattice rules in weighted Walsh spaces by an alternative component-by-component construction. CoRR abs/2101.12586 (2021) - 2020
- [j34]Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski:
On alternative quantization for doubly weighted approximation and integration over unbounded domains. J. Approx. Theory 256: 105433 (2020) - [j33]Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals. J. Complex. 61: 101501 (2020) - [j32]Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski:
On efficient weighted integration via a change of variables. Numerische Mathematik 146(3): 545-570 (2020) - [i5]Adrian Ebert, Peter Kritzer, Dirk Nuyens, Onyekachi Osisiogu:
Digit-by-digit and component-by-component constructions of lattice rules for periodic functions with unknown smoothness. CoRR abs/2001.02978 (2020) - [i4]Peter Kritzer, Friedrich Pillichshammer, Greg W. Wasilkowski:
On Quasi-Monte Carlo Methods in Weighted ANOVA Spaces. CoRR abs/2001.05765 (2020) - [i3]Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
Exponential tractability of linear weighted tensor product problems in the worst-case setting for arbitrary linear functionals. CoRR abs/2001.11740 (2020) - [i2]Adrian Ebert, Peter Kritzer, Onyekachi Osisiogu, Tetiana Stepaniuk:
Component-by-component digit-by-digit construction of good polynomial lattice rules in weighted Walsh spaces. CoRR abs/2008.08966 (2020)
2010 – 2019
- 2019
- [j31]Peter Kritzer, Frances Y. Kuo, Dirk Nuyens, Mario Ullrich:
Lattice rules with random n achieve nearly the optimal O(n-α-1∕2) error independently of the dimension. J. Approx. Theory 240: 96-113 (2019) - [j30]Peter Kritzer, Henryk Wozniakowski:
Simple characterizations of exponential tractability for linear multivariate problems. J. Complex. 51: 110-128 (2019) - [j29]Adrian Ebert, Peter Kritzer:
Constructing lattice points for numerical integration by a reduced fast successive coordinate search algorithm. J. Comput. Appl. Math. 351: 77-100 (2019) - [j28]Peter Kritzer, Friedrich Pillichshammer, Grzegorz W. Wasilkowski:
Truncation in average and worst case settings for special classes of ∞-variate functions. Math. Comput. Simul. 161: 52-65 (2019) - [j27]Aicke Hinrichs, Peter Kritzer, Friedrich Pillichshammer, Grzegorz W. Wasilkowski:
Truncation dimension for linear problems on multivariate function spaces. Numer. Algorithms 80(2): 661-685 (2019) - [i1]Peter Kritzer, Friedrich Pillichshammer, Leszek Plaskota, Grzegorz W. Wasilkowski:
On alternative quantization for doubly weighted approximation and integration over unbounded domains. CoRR abs/1907.04015 (2019) - 2018
- [j26]Evelyn Buckwar, Peter Kritzer, Gunther Leobacher, Friedrich Pillichshammer, Arne Winterhof:
Editorial. Math. Comput. Simul. 143: 1-2 (2018) - [j25]Christian Irrgeher, Peter Kritzer, Friedrich Pillichshammer:
Integration and approximation in cosine spaces of smooth functions. Math. Comput. Simul. 143: 35-45 (2018) - 2017
- [j24]Peter Kritzer, Friedrich Pillichshammer, Grzegorz W. Wasilkowski:
A note on equivalence of anchored and ANOVA spaces; lower bounds. J. Complex. 38: 31-38 (2017) - [j23]Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
L∞-Approximation in Korobov spaces with exponential weights. J. Complex. 41: 102-125 (2017) - 2016
- [j22]Peter Kritzer, Harald Niederreiter:
Mixed orthogonal arrays, -nets, and -sequences. Discret. Math. 339(9): 2199-2208 (2016) - [j21]Christian Irrgeher, Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
Approximation in Hermite spaces of smooth functions. J. Approx. Theory 207: 98-126 (2016) - [j20]Christian Irrgeher, Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
Tractability of multivariate approximation defined over Hilbert spaces with exponential weights. J. Approx. Theory 207: 301-338 (2016) - [j19]Josef Dick, Peter Kritzer:
On a projection-corrected component-by-component construction. J. Complex. 32(1): 74-80 (2016) - [j18]Peter Hellekalek, Peter Kritzer, Friedrich Pillichshammer:
Open type quasi-Monte Carlo integration based on Halton sequences in weighted Sobolev spaces. J. Complex. 33: 169-189 (2016) - [j17]Peter Kritzer, Friedrich Pillichshammer, Grzegorz W. Wasilkowski:
Very low truncation dimension for high dimensional integration under modest error demand. J. Complex. 35: 63-85 (2016) - 2015
- [j16]Christian Irrgeher, Peter Kritzer, Gunther Leobacher, Friedrich Pillichshammer:
Integration in Hermite spaces of analytic functions. J. Complex. 31(3): 380-404 (2015) - [j15]Peter Kritzer, Harald Niederreiter:
Propagation rules for (u,m,e,s)-nets and (u,e,s)-sequences. J. Complex. 31(3): 457-473 (2015) - [j14]Josef Dick, Peter Kritzer, Gunther Leobacher, Friedrich Pillichshammer:
A reduced fast component-by-component construction of lattice points for integration in weighted spaces with fast decreasing weights. J. Comput. Appl. Math. 276: 1-15 (2015) - [j13]Josef Dick, Peter Kritzer, Gunther Leobacher, Friedrich Pillichshammer:
Numerical integration in log-Korobov and log-cosine spaces. Numer. Algorithms 70(4): 753-775 (2015) - 2014
- [j12]Josef Dick, Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
Approximation of analytic functions in Korobov spaces. J. Complex. 30(2): 2-28 (2014) - [j11]Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
Multivariate integration of infinitely many times differentiable functions in weighted Korobov spaces. Math. Comput. 83(287): 1189-1206 (2014) - [c1]Peter Kritzer, Friedrich Pillichshammer:
Tractability of Multivariate Integration in Hybrid Function Spaces. MCQMC 2014: 437-454 - [p2]Henri Faure, Peter Kritzer:
Discrepancy bounds for low-dimensional point sets. Applied Algebra and Number Theory 2014: 58-90 - [p1]Peter Kritzer, Friedrich Pillichshammer, Henryk Wozniakowski:
Tractability of multivariate analytic problems. Uniform Distribution and Quasi-Monte Carlo Methods 2014: 147-170 - [e1]Peter Kritzer, Harald Niederreiter, Friedrich Pillichshammer, Arne Winterhof:
Uniform Distribution and Quasi-Monte Carlo Methods - Discrepancy, Integration and Applications. Radon Series on Computational and Applied Mathematics 15, De Gruyter 2014, ISBN 978-3-11-031793-0 [contents] - 2012
- [j10]Josef Dick, Peter Kritzer:
A higher order Blokh-Zyablov propagation rule for higher order nets. Finite Fields Their Appl. 18(6): 1169-1183 (2012) - [j9]Fred J. Hickernell, Peter Kritzer, Frances Y. Kuo, Dirk Nuyens:
Weighted compound integration rules with higher order convergence for all N. Numer. Algorithms 59(2): 161-183 (2012) - 2010
- [j8]Josef Dick, Peter Kritzer:
Duality theory and propagation rules for generalized digital nets. Math. Comput. 79(270): 993-1017 (2010)
2000 – 2009
- 2009
- [j7]Jan Baldeaux, Josef Dick, Peter Kritzer:
On the approximation of smooth functions using generalized digital nets. J. Complex. 25(6): 544-567 (2009) - 2008
- [j6]Benjamin Doerr, Michael Gnewuch, Peter Kritzer, Friedrich Pillichshammer:
Component-by-component construction of low-discrepancy point sets of small size. Monte Carlo Methods Appl. 14(2): 129-149 (2008) - 2007
- [j5]Josef Dick, Peter Kritzer, Gunther Leobacher, Friedrich Pillichshammer:
Constructions of general polynomial lattice rules based on the weighted star discrepancy. Finite Fields Their Appl. 13(4): 1045-1070 (2007) - [j4]Josef Dick, Peter Kritzer, Friedrich Pillichshammer, Wolfgang Ch. Schmid:
On the existence of higher order polynomial lattices based on a generalized figure of merit. J. Complex. 23(4-6): 581-593 (2007) - [j3]Josef Dick, Peter Kritzer, Frances Y. Kuo, Ian H. Sloan:
Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels. J. Complex. 23(4-6): 752-772 (2007) - 2006
- [j2]Peter Kritzer:
Improved upper bounds on the star discrepancy of (t, m, s)-nets and (t, s)-sequences. J. Complex. 22(3): 336-347 (2006) - [j1]Josef Dick, Peter Kritzer:
A best possible upper bound on the star discrepancy of (t, m, 2)-nets. Monte Carlo Methods Appl. 12(1): 1-17 (2006)
Coauthor Index
aka: Greg W. Wasilkowski
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-22 21:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
