Stop the war!
Остановите войну!
for scientists:
default search action
Search dblp for Publications
export results for "toc:db/journals/jc/jc70.bht:"
@article{DBLP:journals/jc/ChenHS22, author = {Chuchu Chen and Jialin Hong and Derui Sheng}, title = {Influence of numerical discretizations on hitting probabilities for linear stochastic parabolic systems}, journal = {J. Complex.}, volume = {70}, pages = {101634}, year = {2022}, url = {https://doi.org/10.1016/j.jco.2021.101634}, doi = {10.1016/J.JCO.2021.101634}, timestamp = {Wed, 23 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jc/ChenHS22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/ChenTFG22, author = {Xiaming Chen and Bohao Tang and Jun Fan and Xin Guo}, title = {Online gradient descent algorithms for functional data learning}, journal = {J. Complex.}, volume = {70}, pages = {101635}, year = {2022}, url = {https://doi.org/10.1016/j.jco.2021.101635}, doi = {10.1016/J.JCO.2021.101635}, timestamp = {Tue, 19 Apr 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jc/ChenTFG22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/ClementDP22, author = {Fran{\c{c}}ois Cl{\'{e}}ment and Carola Doerr and Lu{\'{\i}}s Paquete}, title = {Star discrepancy subset selection: Problem formulation and efficient approaches for low dimensions}, journal = {J. Complex.}, volume = {70}, pages = {101645}, year = {2022}, url = {https://doi.org/10.1016/j.jco.2022.101645}, doi = {10.1016/J.JCO.2022.101645}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jc/ClementDP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/JuhosP22, author = {Michael Juhos and Joscha Prochno}, title = {Spectral flatness and the volume of intersections of \emph{p}-ellipsoids}, journal = {J. Complex.}, volume = {70}, pages = {101617}, year = {2022}, url = {https://doi.org/10.1016/j.jco.2021.101617}, doi = {10.1016/J.JCO.2021.101617}, timestamp = {Wed, 23 Mar 2022 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jc/JuhosP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/KhartovL22, author = {Alexey A. Khartov and I. A. Limar}, title = {Asymptotic analysis in multivariate average case approximation with Gaussian kernels}, journal = {J. Complex.}, volume = {70}, pages = {101631}, year = {2022}, url = {https://doi.org/10.1016/j.jco.2021.101631}, doi = {10.1016/J.JCO.2021.101631}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jc/KhartovL22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/KiderlenP22, author = {Markus Kiderlen and Florian Pausinger}, title = {On a partition with a lower expected L2-discrepancy than classical jittered sampling}, journal = {J. Complex.}, volume = {70}, pages = {101616}, year = {2022}, url = {https://doi.org/10.1016/j.jco.2021.101616}, doi = {10.1016/J.JCO.2021.101616}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/jc/KiderlenP22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/jc/LuW22, author = {Wanting Lu and Heping Wang}, title = {On the power of standard information for tractability for \emph{L}\({}_{\mbox{2}}\)-approximation in the average case setting}, journal = {J. Complex.}, volume = {70}, pages = {101618}, year = {2022}, url = {https://doi.org/10.1016/j.jco.2021.101618}, doi = {10.1016/J.JCO.2021.101618}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/jc/LuW22.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.