{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T12:10:41Z","timestamp":1780920641091,"version":"3.54.1"},"reference-count":26,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP220101811"],"award-info":[{"award-number":["DP220101811"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004543","name":"China Scholarship Council","doi-asserted-by":"publisher","award":["202506150076"],"award-info":[{"award-number":["202506150076"]}],"id":[{"id":"10.13039\/501100004543","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Complexity"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.jco.2026.102043","type":"journal-article","created":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T16:48:07Z","timestamp":1773161287000},"page":"102043","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The star discrepancy of a union of randomly shifted Korobov lattice point sets depends polynomially on the dimension"],"prefix":"10.1016","volume":"95","author":[{"given":"Jiarui","family":"Du","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Josef","family":"Dick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jco.2026.102043_br0010","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/j.jco.2013.12.004","article-title":"Tractability results for the weighted star-discrepancy","volume":"30","author":"Aistleitner","year":"2014","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0020","first-page":"38","article-title":"On a modification of Chebyshev's inequality and of the error formula of Laplace","volume":"1","author":"Bernstein","year":"1924","journal-title":"Ann. Sci. Inst. Sav. Ukr., Sect. Math."},{"key":"10.1016\/j.jco.2026.102043_br0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.jco.2022.101645","article-title":"Star discrepancy subset selection: problem formulation and efficient approaches for low dimensions","volume":"70","author":"Cl\u00e9ment","year":"2022","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0040","series-title":"Proceedings of the Genetic and Evolutionary Computation Conference","first-page":"1330","article-title":"Computing star discrepancies with numerical black-box optimization algorithms","author":"Cl\u00e9ment","year":"2023"},{"key":"10.1016\/j.jco.2026.102043_br0050","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.jat.2014.03.015","article-title":"Numerical integration of H\u00f6lder continuous, absolutely convergent Fourier, Fourier cosine, and Walsh series","volume":"183","author":"Dick","year":"2014","journal-title":"J. Approx. Theory"},{"key":"10.1016\/j.jco.2026.102043_br0060","doi-asserted-by":"crossref","DOI":"10.1016\/j.jco.2025.101948","article-title":"Tractability results for integration in subspaces of the Wiener algebra","volume":"90","author":"Dick","year":"2025","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0070","series-title":"Lattice Rules: Numerical Integration, Approximation, and Discrepancy","author":"Dick","year":"2022"},{"key":"10.1016\/j.jco.2026.102043_br0080","series-title":"Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration","author":"Dick","year":"2010"},{"key":"10.1016\/j.jco.2026.102043_br0090","article-title":"The star discrepancy of a union of randomly digitally shifted Korobov polynomial lattice point sets depends polynomially on the dimension","volume":"102032","author":"Dick","year":"2026","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0100","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1515\/MCMA.2008.007","article-title":"Component-by-component construction of low-discrepancy point sets of small size","volume":"14","author":"Doerr","year":"2008","journal-title":"Monte Carlo Methods Appl."},{"key":"10.1016\/j.jco.2026.102043_br0110","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.jco.2005.05.002","article-title":"Bounds and constructions for the star-discrepancy via \u03b4-covers","volume":"21","author":"Doerr","year":"2005","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0120","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/j.jco.2010.03.004","article-title":"Algorithmic construction of low-discrepancy point sets via dependent randomized rounding","volume":"26","author":"Doerr","year":"2010","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0130","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.jco.2008.10.001","article-title":"Finding optimal volume subintervals with k points and calculating the star discrepancy are NP-hard problems","volume":"25","author":"Gnewuch","year":"2009","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0140","first-page":"3925","article-title":"Polynomial tractability for integration in an unweighted function space with absolutely convergent Fourier series","volume":"151","author":"Goda","year":"2023","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/j.jco.2026.102043_br0150","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1007\/s10444-021-09916-0","article-title":"A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size","volume":"47","author":"Gross","year":"2021","journal-title":"Adv. Comput. Math."},{"key":"10.1016\/j.jco.2026.102043_br0160","doi-asserted-by":"crossref","first-page":"279","DOI":"10.4064\/aa96-3-7","article-title":"The inverse of the star-discrepancy depends linearly on the dimension","volume":"96","author":"Heinrich","year":"2001","journal-title":"Acta Arith."},{"key":"10.1016\/j.jco.2026.102043_br0170","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.jco.2004.01.001","article-title":"Covering numbers, Vapnik-\u010cervonenkis classes and bounds for the star-discrepancy","volume":"20","author":"Hinrichs","year":"2004","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0180","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/j.jco.2007.08.002","article-title":"Tractability properties of the weighted star discrepancy","volume":"24","author":"Hinrichs","year":"2008","journal-title":"J. Complex."},{"key":"10.1016\/j.jco.2026.102043_br0190","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF02415361","article-title":"Funktionen von beschr\u00e4nkter Variation in der Theorie der Gleichverteilung","volume":"54","author":"Hlawka","year":"1961","journal-title":"Ann. Mat. Pura Appl."},{"key":"10.1016\/j.jco.2026.102043_br0200","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s00041-016-9520-8","article-title":"Multiple rank-1 lattices as sampling schemes for multivariate trigonometric polynomials","volume":"24","author":"K\u00e4mmerer","year":"2018","journal-title":"J. Fourier Anal. Appl."},{"key":"10.1016\/j.jco.2026.102043_br0210","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.acha.2020.11.002","article-title":"High-dimensional sparse FFT based on sampling along multiple rank-1 lattices","volume":"51","author":"K\u00e4mmerer","year":"2021","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"10.1016\/j.jco.2026.102043_br0220","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jat.2019.05.001","article-title":"Approximation of multivariate periodic functions based on sampling along multiple rank-1 lattices","volume":"246","author":"K\u00e4mmerer","year":"2019","journal-title":"J. Approx. Theory"},{"key":"10.1016\/j.jco.2026.102043_br0230","first-page":"7","article-title":"A general theorem from the theory of uniform distribution modulo 1","volume":"11","author":"Koksma","year":"1942","journal-title":"Mathematica B (Zutphen)"},{"key":"10.1016\/j.jco.2026.102043_br0240","series-title":"Random Number Generation and Quasi-Monte Carlo Methods","author":"Niederreiter","year":"1992"},{"key":"10.1016\/j.jco.2026.102043_br0250","article-title":"Fourier Analysis: An Introduction","author":"Stein","year":"2003"},{"key":"10.1016\/j.jco.2026.102043_br0260","doi-asserted-by":"crossref","DOI":"10.1016\/j.jco.2022.101713","article-title":"An elementary proof of a lower bound for the inverse of the star discrepancy","volume":"75","author":"Steinerberger","year":"2023","journal-title":"J. Complex."}],"container-title":["Journal of Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X26000282?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0885064X26000282?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T11:41:47Z","timestamp":1780918907000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0885064X26000282"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":26,"alternative-id":["S0885064X26000282"],"URL":"https:\/\/doi.org\/10.1016\/j.jco.2026.102043","relation":{},"ISSN":["0885-064X"],"issn-type":[{"value":"0885-064X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The star discrepancy of a union of randomly shifted Korobov lattice point sets depends polynomially on the dimension","name":"articletitle","label":"Article Title"},{"value":"Journal of Complexity","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jco.2026.102043","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102043"}}