Saibaba, A. K., Minster, R., & Kilmer, M. E. (2022). Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions. Advances in Computational Mathematics, 48(5). https://doi.org/10.1007/s10444-022-09979-7

SAIBABA, Arvind K., MINSTER, Rachel und KILMER, Misha E., 2022. Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions. Advances in Computational Mathematics. 1 Oktober 2022. Vol. 48, no. 5, . DOI 10.1007/s10444-022-09979-7.

Saibaba, A. K., R. Minster, und M. E. Kilmer. „Efficient Randomized Tensor-Based Algorithms for Function Approximation and Low-Rank Kernel Interactions“. Advances in Computational Mathematics, Bd. 48, Nr. 5, Oktober 2022, https://doi.org/10.1007/s10444-022-09979-7.

Saibaba, Arvind K./Minster, Rachel/Kilmer, Misha E.: Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions, Advances in Computational Mathematics 2022,

Saibaba, A.K., Minster, R. und Kilmer, M.E. (2022), „Efficient randomized tensor-based algorithms for function approximation and low-rank kernel interactions“, Advances in Computational Mathematics, Vol. 48 No. 5, verfügbar unter:https://doi.org/10.1007/s10444-022-09979-7.