Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Temlyakov, Vladimir Nikolaevich

Total publications: 202 (198)
in MathSciNet: 194 (191)
in zbMATH: 153 (152)
in Web of Science: 104 (101)
in Scopus: 123 (122)
Cited articles: 148
Citations: 4719
Presentations: 18

Number of views:
This page:11323
Abstract pages:34387
Full texts:10666
References:2454
Professor
Doctor of physico-mathematical sciences (1981)
Speciality: 01.01.01 (Real analysis, complex analysis, and functional analysis)
E-mail: ,
Website: https://www.math.sc.edu/people/temlyakov.html

Subject:

Approximations of functions in one variable and multivariable cases (approximations by polynomials, n-widths, optimal cubature formulas). Integral operators (estimates of singular numbers, approximation numbers, bilinear approximation of kernels of these operators).


https://www.mathnet.ru/eng/person18590
https://scholar.google.com/citations?user=4q491GsAAAAJ&hl=en
https://zbmath.org/authors/ai:temlyakov.vladimir-n|temljakov.v-n
https://mathscinet.ams.org/mathscinet/MRAuthorID/206797
https://www.researchgate.net/profile/V_Temlyakov

List of publications:
| scientific publications | by years | by types | by times cited | common list |


Citations (Crossref Cited-By Service + Math-Net.Ru)
1. V. N. Temlyakov, “A remark on constructive covering”, Mat. Sb. (to appear)  mathnet

   2024
2. V. N. Temlyakov, “Rate of convergence of Thresholding Greedy Algorithms”, Sb. Math., 215:2 (2024), 275–289  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  scopus
3. F. Dai, V. Temlyakov, “Random points are good for universal discretization”, J. Math. Anal. Appl., 529:1 (2024), 127570 , 28 pp.  mathnet  crossref  isi 6
4. I. V. Limonova, Yu. V. Malykhin, V. N. Temlyakov, “One-sided discretization inequalities and sampling recovery”, Russian Math. Surveys, 79:3 (2024), 515–545  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  scopus
5. Egor Kosov, Vladimir Temlyakov, “Sampling discretization of the uniform norm and applications”, J. Math. Anal. Appl., 538:2 (2024), 128431 , 25 pp., arXiv: 2306.14207  mathnet  crossref; (Published online) 2
6. V. N. Temlyakov, “Sparse sampling recovery in integral norms on some function classes”, Mat. Sb.  mathnet  crossref

   2024
7. A. V. Gasnikov, V. N. Temlyakov, “On greedy approximation in complex Banach spaces”, UMN, 79:6(480) (2024), 39–56  mathnet  crossref;

   2023
8. B. Kashin, S. Konyagin, V. Temlyakov, “Sampling discretization of the uniform norm”, Constr. Approx., 57 (2023), 663–694 , arXiv: 2104.01229v2  mathnet  crossref  mathscinet; 6
9. V. N. Temlyakov, “On Universal Sampling Recovery in the Uniform Norm”, Proc. Steklov Inst. Math., 323 (2023), 206–216  mathnet  crossref  crossref  mathscinet  scopus
10. F. Dai, E. Kosov, V. Temlyakov, “Some improved bounds in sampling discretization of integral norms”, J. Funct. Anal., 285 (2023), 109951 , 40 pp.  mathnet  crossref  mathscinet; 3
11. F. Dai, V. N. Temlyakov, “Universal Sampling Discretization”, Constr. Approx., 58 (2023), 589–613  mathnet  crossref  mathscinet 5
12. F. Dai, A. Prymak, A. Yu. Shadrin, V. N. Temlyakov, S. Yu. Tikhonov, “On the cardinality of lower sets and universal discretization”, J. Complexity, 76 (2023), 101726–16  mathnet  crossref  mathscinet 1
13. V. N. Temlyakov, “Sampling discretization error of integral norms for function classes with small smoothness”, J. Approx. Theory, 293 (2023), 105913–15  mathnet  crossref  mathscinet;

   2022
14. F. Dai, V. N. Temlyakov, “Sampling Discretization of Integral Norms and Its Application”, Proc. Steklov Inst. Math., 319 (2022), 96–108  mathnet  crossref  crossref  mathscinet  scopus
15. V. N. Temlyakov, “Numerical integration and discrepancy under smoothness assumption and without it”, Constr. Approx., 55 (2022), 743–771  mathnet  crossref  mathscinet  isi  scopus; 1
16. B. Kashin, E. Kosov, I. Limonova, V. Temlyakov, “Sampling discretization and related problems”, J. Complexity, 71 (2022), 101653 , 55 pp.  mathnet  crossref  mathscinet  zmath  scopus; 22
17. I. Limonova, V. Temlyakov, “On sampling discretization in $L_2$”, J. Math. Anal. Appl., 515:2 (2022), 126457 , 14 pp.  mathnet  crossref  mathscinet; 14
18. A. V. Dereventsov, V. N. Temlyakov, “Biorthogonal Greedy Algorithms in convex optimization”, Appl. Comput. Harmon. Anal., 60 (2022), 489–511 , arXiv: 2001.05530  mathnet  crossref  mathscinet; 7
19. Vladimir N. Temlyakov, Tino Ullrich, “Approximation of functions with small mixed smoothness in the uniform norm”, J. Approx. Theory, 277 (2022), 105718 , 23 pp., arXiv: 2012.11983  mathnet  crossref  mathscinet; 9
20. Vladimir Temlyakov, “A remark on entropy numbers”, Studia Math., 263 (2022), 199–208 , arXiv: 2008.13030  mathnet  crossref  mathscinet; 2
21. V. I. Berdyshev, O. V. Besov, B. S. Kashin, S. V. Konyagin, Yu. V. Malykhin, K. I. Oskolkov, A. S. Telyakovskii, D. S. Telyakovskii, V. N. Temlyakov, N. N. Kholshchevnikova, “Sergei Aleksandrovich Telyakovskii”, Proc. Steklov Inst. Math. (Suppl.), 319, suppl. 1 (2022), S7–S11  mathnet  crossref  crossref  mathscinet  isi  elib

   2021
22. V. N. Temlyakov, “Sampling Discretization of Integral Norms of the Hyperbolic Cross Polynomials”, Proc. Steklov Inst. Math., 312 (2021), 270–281  mathnet  crossref  crossref  isi  elib  scopus
23. S. Dilworth, G. Garrigós, E. Hernández, D. Kutzarova, V. Temlyakov, “Lebesgue-type inequalities in greedy approximation”, J. Funct. Anal., 280 (2021), 108885 , 37 pp.  mathnet  crossref  mathscinet  isi  scopus;  mathscinet 5
24. A. S. Rubtsova, K. S. Ryutin, V. N. Temlyakov, “On the fixed volume discrepancy of the Korobov point sets”, Sb. Math., 212:8 (2021), 1180–1192  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  scopus
25. F. Dai, A. Prymak, A. Shadrin, V. Temlyakov, S. Tikhonov, “Entropy numbers and Marcinkiewicz-type discretization”, J. Funct. Anal., 281:6 (2021), 109090 , 25 pp.  mathnet  crossref  mathscinet  isi  scopus; 17
26. V. Temlyakov, “On optimal recovery in $L_2$”, J. Complexity, 65 (2021)  mathnet  crossref  isi  scopus; 22
27. F. Dai, A. Prymak, A. Shadrin, V. Temlyakov, S. Tikhonov, “Sampling discretization of integral norms”, Constr. Approx., 54:3 (2021), 455–471  mathnet  crossref  isi  scopus; 14
28. V. Temlyakov, T. Ullrich, “Bounds on Kolmogorov widths and sampling recovery for classes with small mixed smoothness”, J. Complexity, 67 (2021), 101575 , 19 pp.  mathnet  crossref  mathscinet  isi  scopus; 15

   2020
29. V. N. Temlyakov, M. Ullrich, “On the fixed volume discrepancy of the Fibonacci sets in the integral norms”, J. Complexity, 61 (2020), 101472 , 8 pp.  mathnet  crossref  mathscinet  isi  scopus; 2
30. L. Burusheva, V. Temlyakov, “Sparse approximation of individual functions”, J. Approx. Theory, 259 (2020), 105471 , 12 pp.  mathnet  crossref  mathscinet  isi  scopus;  mathscinet 3

   2019
31. V. N. Temlyakov, “Smooth fixed volume discrepancy, dispersion, and related problems”, J. Approx. Theory, 237 (2019), 113–134  mathnet  crossref  mathscinet  zmath  isi  scopus 2
32. F. Dai, A. Prymak, V. N. Temlyakov, S. Yu. Tikhonov, “Integral norm discretization and related problems”, Russian Math. Surveys, 74:4 (2019), 579–630  mathnet  crossref  crossref  mathscinet  zmath  zmath  adsnasa  isi  elib  scopus
33. A. V. Dereventsov, V. N. Temlyakov, “A unified way of analyzing some greedy algorithms”, J. Funct. Anal., 277:12 (2019), 108286–30 , arXiv: 1801.06198  mathnet  crossref  mathscinet  zmath  isi  scopus 9

   2018
34. V.N. Temlyakov, “Universal discretization”, J. Complexity, 47 (2018), 97–109  mathnet  crossref  mathscinet  isi  scopus 15
35. V. N. Temlyakov, “The Marcinkiewicz–type discretization theorems”, Constr. Approx., 48:2 (2018), 337–369  mathnet  crossref  mathscinet  isi  scopus 36
36. B. S. Kashin, V. N. Temlyakov, “Observations on discretization of trigonometric polynomials with given spectrum”, Russian Math. Surveys, 73:6 (2018), 1128–1130  mathnet  crossref  crossref  mathscinet  zmath  zmath  adsnasa  isi  elib  scopus
37. S. J. Dilworth, D. Kutzarova, V. N. Temlyakov, B. Wallis, “Weight-almost greedy bases”, Proc. Steklov Inst. Math., 303 (2018), 109–128  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus
38. V. Temlyakov, Multivariate approximation, Cambridge Monogr. Appl. Comput. Math., 32, Cambridge University Press, Cambridge, 2018 , 550 pp.  mathscinet  zmath
39. Dinh Dũng, Vladimir Temlyakov, Tino Ullrich, Hyperbolic cross approximation, Advanced Courses in Mathematics - CRM Barcelona, Birkhäuser Basel, Basel, 2018 , xi+218 pp.  crossref  mathscinet  zmath 105

   2017
40. V. Temlyakov, “On the entropy numbers of the mixed smoothness function classes”, J. Approx. Theory, 217 (2017), 26–56  mathnet  crossref  mathscinet  isi  elib  scopus 17
41. V. Temlyakov, “Constructive Sparse Trigonometric Approximation for Functions with Small Mixed Smoothness”, Constr. Approx., 45 (2017), 467–495  mathnet  crossref  mathscinet  isi  elib  scopus 8
42. V. Temlyakov, S. Tikhonov, “Remez-Type and Nikol’skii-Type Inequalities: General Relations and the Hyperbolic Cross Polynomials”, Constr. Approx., 46:3 (2017), 593–615  mathnet  crossref  mathscinet  isi  elib  scopus 8

   2016
43. V. N. Temlyakov, “Dictionary descent in optimization”, Anal. Math., 42:1 (2016), 69–89  mathnet  crossref  mathscinet  isi  elib  scopus 6
44. V. N. Temlyakov, “Convergence and rate of convergence of some greedy algorithms in convex optimization”, Proc. Steklov Inst. Math., 293 (2016), 325–337  mathnet  crossref  crossref  mathscinet  isi  elib  elib  scopus
45. Vladimir Temlyakov, “Incremental greedy algorithm and its applications in numerical integration” (MCQMC, Leuven, Belgium, April 2014), Springer Proc. Math. Statist., 163, 2016, 557–570  mathnet  crossref  mathscinet  isi  elib  scopus 4
46. V. N. Temlyakov, “Sparse approximation by greedy algorithm”, Springer Proc. Math. Statist., 177, 2016, 183–215  mathnet  crossref  mathscinet  isi  elib  scopus

   2015
47. V. N. Temlyakov, “Greedy approximation in convex optimization”, Constr. Approx., 41:2 (2015), 269–296  mathnet  crossref  mathscinet  isi  elib  scopus 23
48. D. Bazarkhanov, V. Temlyakov, “Nonlinear tensor product approximation of functions”, J. Complexity, 31:6 (2015), 867–884  mathnet  crossref  mathscinet  isi  elib  scopus 5
49. V. N. Temlyakov, “Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness”, Sb. Math., 206:11 (2015), 1628–1656  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib  scopus

   2014
50. V. N. Temlyakov, “Greedy Expansions in Convex Optimization”, Proc. Steklov Inst. Math., 284 (2014), 244–262  mathnet  crossref  crossref  isi  elib  elib  scopus
51. V. N. Temlyakov, “Incoherent systems and coverings in finite dimensional Banach spaces”, Sb. Math., 205:5 (2014), 703–721  mathnet  crossref  crossref  mathscinet  zmath  adsnasa  isi  elib  elib  scopus
52. E. D. Livshitz, V. N. Temlyakov, “Sparse approximation and recovery by greedy algorithms”, IEEE Trans. Inform. Theory, 60:7 (2014), 3989–4000  mathnet  crossref  mathscinet  zmath  isi  elib  scopus 16
53. V. N. Temlyakov, “Sparse approximation and recovery by greedy algorithms in Banach spaces”, Forum Math. Sigma, 2 (2014), e12 , 26 pp.  mathnet  crossref  mathscinet  zmath  scopus 7
54. G. Kerkyacharian, A. B. Tsybakov, V. N. Temlyakov, D. Picard, V. Koltchinskii, “Optimal exponential bounds on the accuracy of classification”, Constr. Approx., 39:3 (2014), 421–444  mathnet  crossref  mathscinet  zmath  isi  scopus 2

   2013
55. Proc. Steklov Inst. Math., 280 (2013), 227–239  mathnet  crossref  crossref  mathscinet  isi  elib  elib  scopus
56. K. Kazarian, V. N. Temlyakov, “Greedy bases in $L^p$ spaces”, Proc. Steklov Inst. Math., 280 (2013), 181–190  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib  scopus
57. V. N. Temlyakov, “An inequality for the entropy numbers and its application”, J. Approx. Theory, 173 (2013), 110–121  mathnet  crossref  mathscinet  zmath  isi  elib  scopus 15
58. D. Bilyk, V. N. Temlyakov, R. Yu, “The $L_2$ discrepancy of two-dimensional lattices”, Recent advances in harmonic analysis and applications, Springer Proc. Math. Stat., 25, Springer, New York, 2013, 63–77  mathnet  crossref  mathscinet  zmath  scopus 2
59. V. Temlyakov, “How young we were”, Recent advances in harmonic analysis and applications, Springer Proc. Math. Stat., 25, Springer, New York, 2013, 43–46  mathnet  crossref  mathscinet  zmath  scopus  scopus
60. K. S. Kazarian, V. N. Temlyakov, “Hilbert spaces of vector-valued functions generated by quadratic forms”, J. Math. Anal. Appl., 402:1 (2013), 334–347  mathnet  crossref  mathscinet  zmath  isi  elib  scopus
61. D. Savu, V. N. Temlyakov, “Lebesgue-type inequalities for greedy approximation in Banach spaces”, IEEE Trans. Inform. Theory, 59:2 (2013), 1098–1106  mathnet  crossref  mathscinet  zmath  isi  scopus 4

   2012
62. D. Bilyk, V. N. Temlyakov and Rui Yu, “Fibonacci sets are good for discrepancy and numerical integration”, J. Complexity, 28:1 (2012), 18–36  mathnet  crossref  mathscinet  zmath  isi  elib  scopus 12
63. S. Dilworth, M. Soto-Bajo, and V. N. Temlyakov, Quasi-greedy bases and Lebesgue-type inequalities, IMI Preprint No 02, 2012 , 44 pp.
64. E. Liu and V. N. Temlyakov, “The orthogonal super greedy algorithm and applications in compressed sensing”, IEEE Trans. Inform. Theory, 58:4 (2012), 2040–2047  mathnet  crossref  mathscinet  zmath  isi  scopus 153
65. E. Liu and V. N. Temlyakov, “Super greedy type algorithms”, Adv. Comput. Math., 37:4 (2012), 493–504  mathnet  crossref  mathscinet  zmath  isi  scopus 7
66. S. J. Dilworth, M. Soto-Bajo, V. N. Temlyakov, “Quasi-greedy bases and Lebesgue-type inequalities”, Stud. Math., 211:1 (2012), 41–69  mathnet  crossref  mathscinet  zmath  isi  scopus 22

   2011
67. V. Temlyakov, Greedy approximation, Cambridge Monogr. Appl. Comput. Math., 20, Cambridge University Press, Cambridge, 2011 , xiv+418 pp.  mathscinet  zmath
68. V. N. Temlyakov, Mingrui Yang, Peixin Ye, “Greedy approximation with regard to non-greedy bases,”, Adv. Comput. Math., 34:3 (2011), 319–337  crossref  mathscinet  zmath  isi  scopus 11
69. V. N. Temlyakov, P. Zheltov, “On performance of greedy algorithms”, J. Approx. Theory, 163:9 (2011), 1134–1145  crossref  mathscinet  zmath  isi  elib  scopus 28
70. V. N. Temlyakov, Mingrui Yang, Peixin Ye, “Lebesgue-type inequalities for greedy approximation with respect to quasi-greedy bases”, East J. Approx., 17:2 (2011), 127–138  mathscinet
71. S. V. Konyagin, Yu. V. Malykhin and V. N. Temlyakov, “On basis sets in Banach spaces”, East J. Approx., 17 (2011), 215–220  mathscinet  zmath
72. J. L. Nelson and V. N. Temlyakov, “On the size of incoherent systems”, J. Approximation Theory, 163:9 (2011), 1238–1245  crossref  mathscinet  zmath  isi  scopus 13

   2010
73. Proc. Steklov Inst. Math., 269 (2010), 247–258  mathnet  crossref  mathscinet  zmath  zmath  isi  elib  elib  scopus

   2008
74. V. N. Temlyakov, “Approximation in learning theory”, Constr. Approx., 27:1 (2008), 33–74  crossref  mathscinet  zmath  isi  elib  scopus 16
75. V. N. Temlyakov, “Relaxation in greedy approximation”, Constr. Approx., 28:1 (2008), 1–25  crossref  mathscinet  zmath  isi  elib  scopus 20
76. S. J. Dilworth, D. Kutzarova, K. L. Shuman, V. N. Temlyakov, P. Wojtaszczyk, “Weak convergence of greedy algorithms in Banach spaces”, J. Fourier Anal. Appl., 14:5-6 (2008), 609–628  crossref  mathscinet  zmath  isi  scopus 7
77. V. N. Temlyakov, “Greedy approximation”, Acta Numer., 17 (2008), 235–409  crossref  mathscinet  zmath  isi  elib  scopus 122
78. V. Temlyakov, “Convergence of greedy approximation with regard to the trigonometric system”, Topics in classical analysis and applications in honor of Daniel Waterman, World Sci. Publ., Hackensack, NJ, 2008, 161–172  crossref  mathscinet  zmath  scopus
79. B. S. Kashin, V. N. Temlyakov, “On a Norm and Approximate Characteristics of Classes of Multivariable Functions”, Journal of Mathematical Sciences, 155:1 (2008), 57–80  mathnet  crossref  mathscinet  zmath  elib  scopus

   2007
80. B. S. Kashin, V. N. Temlyakov, “A Remark on Compressed Sensing”, Math. Notes, 82:6 (2007), 748–755  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib  scopus
81. S. V. Konyagin, V. N. Temlyakov, “The entropy in learning theory. Error estimates”, Constr. Approx., 25:1 (2007), 1–27  crossref  mathscinet  zmath  isi  elib  scopus 15
82. V. N. Temlyakov, “Greedy expansions in Banach spaces”, Adv. Comput. Math., 26:4 (2007), 431–449  crossref  mathscinet  zmath  isi  elib  scopus 10
83. D. Donoho, M. Elad, V. N. Temlyakov, “On the Lebesgue type inequalities for greedy approximation”, J. Approx. Theory, 147:2 (2007), 185–195  crossref  mathscinet  zmath  isi  scopus 33
84. V. N. Temlyakov, “Greedy algorithms with prescribed coefficients”, J. Fourier Anal. Appl., 13:1 (2007), 71–86  crossref  mathscinet  zmath  isi  elib  scopus 6
85. V. N. Temlyakov, “Universality in approximation and estimation”, Curve and surface fitting: Avignon 2006, Mod. Methods Math., Nashboro Press, Brentwood, TN, 2007, 247–265  mathscinet
86. V. Temlyakov, “Greedy approximation in Banach spaces”, Banach spaces and their applications in analysis, Proceedings of the conference dedicated to N. Kalton, 60, Walter de Gruyter, Berlin, 2007, 193–208  mathscinet  zmath

   2006
87. V. N. Temlyakov, “On Universal Estimators in Learning Theory”, Proc. Steklov Inst. Math., 255 (2006), 244–259  mathnet  crossref  mathscinet  scopus
88. R. DeVore, G. Kerkyacharian, D. Picard, V. Temlyakov, “Approximation methods for supervised learning”, Found. Comp. Math., 6:1 (2006), 3–58  crossref  mathscinet  zmath  isi  elib  scopus 52
89. D. L. Donoho, M. Elad and V. N. Temlyakov, “Stable recovery of sparse overcomplete representations in the presence of noise”, IEEE Trans. Inform. Theory, 52:1 (2006), 6–18  crossref  mathscinet  zmath  isi  scopus 1520
90. V. N. Temlyakov, “Optimal estimators in learning theory”, Approximation and probability, Banach Center Publ., 72, Polish Acad. Sci. Inst. Math., Warsaw, 2006, 341–366  crossref  mathscinet  zmath 7
91. G. Kerkyacharian, D. Picard, V. N. Temlyakov, “Some inequalities for the tensor product of greedy bases and weight-greedy bases”, East J. Approx., 12:1 (2006), 103–118  mathscinet
92. V. N. Temlyakov, “Greedy approximations”, Foundations of computational mathematics, Santander 2005, London Math. Soc. Lecture Note Ser., 331, Cambridge Univ. Press, Cambridge, 2006, 371–394  mathscinet  zmath
93. V. N. Temlyakov, “Greedy approximations with regard to bases”, International Congress of Mathematicians. Vol. II, Eur. Math. Soc., Zürich, 2006, 1479–1504  mathscinet  zmath
94. D. Leviatan and V. N. Temlyakov, “Simultaneous approximation by greedy algorithms”, Adv. Comput. Math., 25:1-3 (2006), 73–90  crossref  mathscinet  zmath  isi  scopus 31

   2005
95. V. N. Temlyakov, “Greedy Algorithms with Restricted Depth Search”, Proc. Steklov Inst. Math., 248 (2005), 255–267  mathnet  mathscinet  zmath
96. V. N. Temlyakov, “Greedy-type approximation in Banach spaces and applications”, Constr. Approx., 21:2 (2005), 257–292  crossref  mathscinet  zmath  isi  elib  scopus 18
97. D. Leviatan and V. N. Temlyakov, “Simultaneous greedy approximation in Banach spaces”, J. Complexity, 21:3 (2005), 275–293  crossref  mathscinet  zmath  isi  scopus 7
98. S. V. Konyagin, V. N. Temlyakov, “Convergence of greedy approximation for the trigonometric system”, Anal. Math., 31:2 (2005), 85–115  crossref  mathscinet  zmath  elib  scopus 3
99. P. Binev, A. Cohen, W. Dahmen, R. DeVore, V. Temlyakov, “Universal algorithms for learning theory. I. Piecewise constant functions”, J. Mach. Learn. Res., 6 (2005), 1297–1321  mathscinet  zmath  isi

   2004
100. A. Kamont and V.N. Temlyakov, “Greedy approximation and the multivariate Haar system”, Studia Math., 161:3 (2004), 199–223  crossref  mathscinet  zmath  isi  scopus 11
101. V. N. Temlyakov, “A remark on simultaneous greedy approximation”, East J. Approx., 10:1-2 (2004), 17–25  mathscinet  zmath
102. S. V. Konyagin, V. N. Temlyakov, “Some error estimates in Learning Theory”, Approximation theory, A volume dedicated to Borislav Bojanov, Prof. M. Drinov Acad. Publ. House, Sofia, 2004, 126–144  mathscinet

   2003
103. V. N. Temlyakov, “Nonlinear methods of approximation”, Found. Comput. Math., 3:1 (2003), 33–107  crossref  mathscinet  zmath  isi  scopus 169
104. E. D. Livshitz and V. N. Temlyakov, “Two lower estimates in greedy approximation”, Constr. Approx., 19:4 (2003), 509–523  crossref  mathscinet  zmath  isi  scopus 21
105. S. J. Dilworth, N. J. Kalton, D. Kutzarova, V. N. Temlyakov, “The thresholding greedy algorithm, greedy bases, and duality”, Constr. Approx., 19:4 (2003), 575–597  crossref  mathscinet  zmath  isi  scopus 90
106. R. De Vore, G. Petrova, V. Temlyakov, “Best basis selection for approximation in $L_p$”, Found. Comput. Math., 3:2 (2003), 161–185  crossref  mathscinet  zmath  isi  scopus 4
107. V. N. Temlyakov, “Cubature formulas, discrepancy, and nonlinear approximation”, Numerical integration and its complexity (Oberwolfach, 2001), J. Complexity, 19, no. 3, 2003, 352–391  crossref  mathscinet  zmath  isi  scopus 42
108. S. V. Konyagin, V. N. Temlyakov, “Convergence of Greedy Approximation I. General Systems”, Studia Math., 159:1 (2003), 143–160  crossref  mathscinet  zmath  isi  scopus 9
109. S. V. Konyagin, V. N. Temlyakov, “Convergence of greedy approximation. II. The trigonometric system”, Studia Math., 159:2 (2003), 161–184  crossref  mathscinet  zmath  isi  scopus 13
110. A. Lutoborski, V. N. Temlyakov, “Vector greedy algorithms”, J. Complexity, 19:4 (2003), 458–473  crossref  mathscinet  zmath  isi  scopus 19
111. B. S. Kashin, V. N. Temlyakov, “The volume estimates and their applications”, East J. Approx., 9:4 (2003), 469–485  mathscinet  zmath

   2002
112. V. N. Temlyakov, “Universal bases and greedy algorithms for anisotropic function classes”, Constr. Approx., 18:4 (2002), 529–550  crossref  mathscinet  zmath  isi  scopus 16
113. V. E. Maiorov, K. I. Oskolkov, V. N. Temlyakov, “Gridge approximation and Radon compass”, Approximation theory, A volume dedicated to Blagovest Sendov, DARBA, Sofia, 2002, 284–309  mathscinet  zmath
114. V. N. Temlyakov, “A criterion for convergence of Weak Greedy Algorithms”, Adv. Comput. Math., 17:3 (2002), 269–280  crossref  mathscinet  zmath  isi  scopus 11
115. S. J. Dilworth, D. Kutzarova, V. N. Temlyakov, “Convergence of some greedy algorithms in Banach spaces”, J. Fourier Anal. Appl., 8:5 (2002), 489–505  crossref  mathscinet  zmath  isi  scopus 20
116. V. N. Temlyakov, “Nonlinear approximation with regard to bases”, Approximation theory, X (St. Louis, MO, 2001), Innov. Appl. Math., Vanderbilt Univ. Press, Nashville, TN, 2002, 373–402  mathscinet  zmath
117. S. V. Konyagin and V. N. Temlyakov, “Greedy approximation with regard to bases and general minimal systems”, Serdica Math. J., 28:4 (2002), 305–328  mathscinet  zmath

   2001
118. E. D. Livshits, V. N. Temlyakov, “On Convergence of Weak Greedy Algorithms”, Proc. Steklov Inst. Math., 232 (2001), 229–239  mathnet  mathscinet  zmath
119. V. N. Temlyakov, “Greedy algorithms in Banach spaces”, Adv. Comput. Math., 14:3 (2001), 277–292  crossref  mathscinet  zmath  isi  scopus 43

   2000
120. V. N. Temlyakov, “Greedy algorithms with regard to multivariate systems with special structure”, Constr. Approx., 16:3 (2000), 399–425  crossref  mathscinet  zmath  isi  scopus 37
121. V. N. Temlyakov, “Weak greedy algorithms”, Adv. Comput. Math., 12:2-3 (2000), 213–227  crossref  mathscinet  zmath  isi 125

   1999
122. V. N. Temlyakov, “Greedy algorithms and $m$-term approximation with regard to redundant dictionaries”, J. Approx. Theory, 98:1 (1999), 117–145  crossref  mathscinet  zmath  isi  scopus 56
123. B. S. Kashin, V. N. Temlyakov, “On a norm and approximation characteristics of classes of functions of several variables”, Metric theory of functions and related problems in analysis, eds. S. M. Nikol'skii, Izd. Nauchno-Issled. Aktuarno-Finans. Tsentra (AFTs), Moscow, 1999, 69–99  mathscinet
124. S. V. Konyagin, V. N. Temlyakov, “A remark on greedy approximation in Banach spaces”, East J. Approx., 5:3 (1999), 365–379  mathscinet  zmath
125. S. V. Konyagin, V. N. Temlyakov, “Rate of convergence of Pure Greedy Algorithm”, East J. Approx., 5:4 (1999), 493–499  mathscinet  zmath

   1998
126. B. S. Kashin, V. N. Temlyakov, “On a certain norm and related applications”, Math. Notes, 64:4 (1998), 551–554  mathnet  crossref  crossref  mathscinet  zmath  isi  scopus
127. V. N. Temlyakov, “Nonlinear Kolmogorov widths”, Math. Notes, 63:6 (1998), 785–795  mathnet  crossref  crossref  mathscinet  zmath  isi  scopus
128. R. A. DeVore, S. V. Konyagin, V. N. Temlyakov, “Hyperbolic wavelet approximation”, Constr. Approx., 14:1 (1998), 1–26  crossref  mathscinet  isi  scopus 86
129. V. N. Temlyakov, “The best $m$-term approximation and greedy algorithms”, Advances in Comp. Math., 8:3 (1998), 249–265  crossref  mathscinet  zmath  isi  scopus 110
130. V. N. Temlyakov, “Non-linear $m$-term approximation with regard to the multivariate Haar system”, East J. Approx., 4:1 (1998), 87–106  mathscinet  zmath
131. A. V. Andrianov, V. N. Temlyakov, “Best $m$-term approximation of functions from classes $MW^r_{q,\alpha}$”, Approximation theory IX, Vol. I (Nashville, TN, 1998), Innov. Appl. Math., Vanderbilt Univ. Press, Nashville, TN, 1998, 7–14  mathscinet  zmath
132. V. N. Temlyakov, “On two problems in the multivariate approximation”, East J. Approx., 4:4 (1998), 505–514  mathscinet  zmath
133. V. N. Temlyakov, “Greedy algorithm and $m$-term trigonometric approximation”, Constr. Approx., 14:4 (1998), 569–587  crossref  mathscinet  zmath  isi  scopus 63

   1997
134. S. A. Telyakovskii, V. N. Temlyakov, “Convergence of multiple Fourier series for functions of bounded variation”, Math. Notes, 61:4 (1997), 484–494  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus
135. A. V. Andrianov, V. N. Temlyakov, “On Two Methods of Generalization of Properties of Univariate Function Systems to Their Tensor Product”, Proc. Steklov Inst. Math., 219 (1997), 25–35  mathnet  mathscinet  zmath
136. R. A. DeVore, V. N. Temlyakov, “Nonlinear approximation in finite-dimensional spaces”, J. Complexity, 13:4 (1997), 489–508  crossref  mathscinet  zmath  isi  scopus 16

   1996
137. R. A. DeVore, V. N. Temlyakov, “Some remarks on greedy algorithms”, Adv. Comput. Math., 5:2-3 (1996), 173–187  crossref  mathscinet  zmath  isi  scopus 349
138. V. N. Temlyakov, “An Inequality for Trigonometric Polynomials and its Application for Estimating the Kolmogorov Widths”, Corrected reprint of “An inequality for trigonometric polynomials and its application for estimating the Kolmogorov widths” [East J. Approx. 2 (1996), no. 1, 89–98], East J. Approx., 2:2 (1996), 253–262  mathscinet  zmath

   1995
139. B. S. Kashin, V. N. Temlyakov, “Estimate of approximate characteristics for classes of functions with bounded mixed derivative”, Math. Notes, 58:6 (1995), 1340–1342  mathnet  crossref  mathscinet  zmath  isi  scopus
140. R. A. DeVore, V. N. Temlyakov, “Nonlinear approximation by trigonometric sums”, J. Fourier Anal. Appl., 2:1 (1995), 29–48  crossref  mathscinet  zmath  scopus 63
141. V. N. Temlyakov, “An inequality for trigonometric polynomials and its application for estimating the entropy numbers”, J. Complexity, 11:2 (1995), 193–307  crossref  mathscinet  isi  scopus 28
142. V. N. Temlyakov, “Some inequalities for multivariate Haar polynomials”, East J. Approx., 1:1 (1995), 61–72  mathscinet  zmath

   1994
143. B. S. Kashin, V. N. Temlyakov, “On best $m$-term approximations and the entropy of sets in the space $L_1$”, Math. Notes, 56:5 (1994), 1137–1157  mathnet  crossref  mathscinet  zmath  isi  scopus
144. R. A. DeVore, P. P. Petrushev, V. N. Temlyakov, “Multivariate trigonometric polynomial approximations with frequencies from the hyperbolic cross”, Math. Notes, 56:3 (1994), 900–918  mathnet  mathscinet  zmath  isi

   1995
145. V. N. Temlyakov, “On error estimates for cubature formulas”, Proc. Steklov Inst. Math., 207 (1995), 299–309  mathnet  mathscinet  zmath

   1994
146. R. DeVore, V. N. Temlyakov, “The role of approximation and smoothness spaces in compression and noise removal”, Information theory and statistics (IEEE-IMS Workshop on Statistics), Proceedings, 1994, 52

   1993
147. V. N. Temlyakov, Approximation of periodic functions, Comput. Math. Anal. Ser., Nova Science Publishers, Inc., Commack, NY, 1993 , x+419 pp.  mathscinet  zmath
148. V. N. Temlyakov, “Universality of the Fibonacci cubature formulas”, Methods of approximation theory in complex analysis and mathematical physics (Leningrad, 1991), Lecture Notes in Math., 1550, Springer, Berlin, 1993, 178–184  crossref  mathscinet  zmath
149. V. N. Temlyakov, “On approximate recovery of functions with bounded mixed derivative”, J. Complexity, 9:1 (1993), 41–59  crossref  mathscinet  zmath  scopus 47

   1992
150. V. N. Temlyakov, “Estimates of best bilinear approximations of functions and approximation numbers of integral operators”, Math. Notes, 51:5 (1992), 510–517  mathnet  crossref  mathscinet  zmath  isi  scopus

   1993
151. V. N. Temlyakov, “Bilinear approximation and related questions”, Proc. Steklov Inst. Math., 194 (1993), 245–265  mathnet  mathscinet  zmath

   1992
152. V. N. Temlyakov, “On estimates of approximation numbers and best bilinear approximation”, Constr. Approx., 8:1 (1992), 23–33  crossref  mathscinet  zmath  isi  scopus 2

   1993
153. V. N. Temlyakov, “Estimates of the errors of Fibonacci quadrature formulae on classes of functions with bounded derivative”, Proc. Steklov Inst. Math., 200 (1993), 359–367  mathnet  mathscinet  zmath

   1991
154. V. N. Temlyakov, “On Universal Cubature Formulas”, Soviet Math. Dokl., 43 (1991), 39–42  mathnet  mathscinet  zmath

   1990
155. V. N. Temlyakov, “On estimates for the widths of classes of infinitely differentiable functions”, Mat. Zametki, 47:5 (1990), 155–157  mathnet  mathscinet  zmath

   1992
156. V. N. Temlyakov, “On a way of obtaining lower estimates for the errors of quadrature formulas”, Math. USSR-Sb., 71:1 (1992), 247–257  mathnet  crossref  mathscinet  zmath  adsnasa  isi  scopus
157. V. N. Temlyakov, “On the behavior of the partial sums, over hyperbolic crosses, of Fourier series of periodic functions of several variables”, Proc. Steklov Inst. Math., 192 (1992), 209–218  mathnet  mathscinet  zmath

   1989
158. V. N. Temlyakov, “Error estimates of quadrature formulas for classes of functions with bounded mixed derivative”, Math. Notes, 46:2 (1989), 663–668  mathnet  crossref  mathscinet  zmath  isi  scopus

   1990
159. V. N. Temlyakov, “Estimates for the asymptotic characteristics of classes of functions with bounded mixed derivative or difference”, Proc. Steklov Inst. Math., 189 (1990), 161–197  mathnet  mathscinet  zmath
160. V. N. Temlyakov, “Bilinear approximation and applications”, Proc. Steklov Inst. Math., 187 (1990), 221–248  mathnet  mathscinet  zmath

   1989
161. V. N. Temlyakov, “Approximation of Functions of Several Variables by Trigonometric Polynomials with Harmonics from Hyperbolic Crosses”, Ukranian Math. J., 41 (1989), 451–456  crossref  mathscinet  zmath  scopus

   1988
162. V. N. Temlyakov, “Approximation by elements of a finite-dimensional subspace of functions from various Sobolev or Nikol'skii spaces”, Math. Notes, 43:6 (1988), 444–454  mathnet  crossref  mathscinet  zmath  isi  scopus

   1989
163. V. N. Temlyakov, “Estimates for the best bilinear approximations of periodic functions”, Proc. Steklov Inst. Math., 181 (1989), 275–293  mathnet  mathscinet  zmath

   1988
164. V. N. Temlyakov, “Best bilinear approximation and connected questions”, Constructive theory of functions (Varna, 1987), Publ. House Bulgar. Acad. Sci., Sofia, 1988, 448–454  mathscinet  zmath

   1989
165. V. N. Temlyakov, “On Estimates of $\varepsilon$-Entropy and Widths of Classes of Functions with Bounded Mixed Derivative or Difference”, Soviet Math. Dokl., 38 (1989), 84–87  mathnet  mathscinet  zmath
166. V. N. Temlyakov, “Estimates of the best bilinear approximations of functions of two variables and some of their applications”, Math. USSR-Sb., 62:1 (1989), 95–109  mathnet  crossref  mathscinet  zmath  scopus
167. V. N. Temlyakov, “On estimates of the best bilinear approximations of periodic functions and singular numbers of integral operators”, Proc. Steklov Inst. Math., 180 (1989), 252–253  mathnet  mathscinet  zmath

   1987
168. V. N. Temlyakov, “On the widths of function classes”, Soviet Math. Dokl., 35 (1987), 636–642  mathnet  mathscinet  zmath
169. V. N. Temlyakov, “Approximation of periodic functions of several variables by bilinear forms”, Math. USSR-Izv., 28:1 (1987), 133–150  mathnet  crossref  mathscinet  zmath  scopus

   1989
170. V. N. Temlyakov, “Approximations of functions with bounded mixed derivative”, Proc. Steklov Inst. Math., 178 (1989), 1–121  mathnet  mathscinet  zmath

   1987
171. V. N. Temlyakov, “Approximation of periodic functions of several variables by combinations of functions that depend on a smaller number of variables”, Proc. Steklov Inst. Math., 173 (1987), 263–272  mathnet  mathscinet  zmath

   1986
172. V. N. Temlyakov, “On best bilinear approximations of periodic functions of several variables”, Soviet Math. Dokl., 33 (1986), 96–99  mathnet  mathscinet  zmath
173. V. N. Temlyakov, “Reconstruction of periodic functions of several variables from the values at the nodes of number-theoretic nets”, Anal. Math., 12:4 (1986), 287–305 (in Russian)  crossref  mathscinet  zmath  scopus
174. V. N. Temlyakov, “Approximation of periodic functions of several variables by trigonometric polynomials, and widths of some classes of functions”, Math. USSR-Izv., 27:2 (1986), 285–322  mathnet  crossref  mathscinet  zmath  scopus

   1985
175. V. N. Temlyakov, “Quadrature formulae and recovery of number-theoretical nets from nodal values for classes of functions with small degree of smoothness”, Russian Math. Surveys, 40:4 (1985), 223–224  mathnet  crossref  zmath  adsnasa  isi  scopus

   1987
176. V. N. Temlyakov, “Approximate recovery of periodic functions of several variables”, Math. USSR-Sb., 56:1 (1987), 249–261  mathnet  crossref  mathscinet  zmath  scopus
177. V. N. Temlyakov, “Asymptotic behavior of best approximations of individual functions”, Proc. Steklov Inst. Math., 172 (1987), 341–352  mathnet  mathscinet  zmath

   1985
178. V. N. Temlyakov, “On the approximate reconstruction of periodic functions of several variables”, Soviet Math. Dokl., 31 (1985), 246–249  mathnet  mathscinet  zmath

   1984
179. V. N. Temlyakov, “On the approximation of periodic functions of several variables”, Soviet Math. Dokl., 30 (1984), 659–662  mathnet  mathscinet  zmath

   1985
180. V. N. Temlyakov, “Relations between best approximations of functions analytic in the bidisk”, Proc. Steklov Inst. Math., 164 (1985), 217–224  mathnet  mathscinet  zmath

   1983
181. V. N. Temlyakov, “Approximation of functions with a bounded mixed difference by trigonometric polynomials, and the widths of some classes of functions”, Math. USSR-Izv., 20:1 (1983), 173–187  mathnet  crossref  mathscinet  zmath  scopus

   1982
182. V. N. Temlyakov, “Widths of some classes of functions of several variables”, Soviet Math Dokl., 26 (1982), 619–622  mathnet  mathscinet  mathscinet  zmath
183. V. N. Temlyakov, “On absolute summation of Fourier series by subsequences”, Anal. Math., 8:1 (1982), 71–77  crossref  mathscinet  zmath  scopus 4

   1981
184. V. N. Temlyakov, “Approximation of functions from the Lipschitz class by algebraic polynomials”, Math. Notes, 29:4 (1981), 306–309  mathnet  crossref  mathscinet  zmath  isi  scopus
185. V. N. Temlyakov, “Relations between best approximations of functions of two variables”, Math. Notes, 29:1 (1981), 51–58  mathnet  crossref  mathscinet  zmath  isi  scopus

   1983
186. V. N. Temlyakov, “Approximation of continuous functions by trigonometric polynomials”, Proc. Steklov Inst. Math., 157 (1983), 213–228  mathnet  mathscinet  zmath

   1980
187. V. N. Temlyakov, “On the approximation of periodic functions of several variables with bounded mixed difference”, Soviet Math. Dokl., 22 (1980), 131–135  mathnet  mathscinet  mathscinet  zmath

   1982
188. V. N. Temlyakov, “Approximation of periodic functions of several variables with bounded mixed difference”, Math. USSR-Sb., 41:1 (1982), 53–66  mathnet  crossref  mathscinet  zmath  isi  scopus

   1983
189. V. N. Temlyakov, “Approximation of periodic functions of several variables with a bounded mixed derivative”, Proc. Steklov Inst. Math., 156 (1983), 255–283  mathnet  mathscinet  zmath

   1981
190. V. N. Temlyakov, “On the question of the asymptotic behavior of best approximations of continuous functions”, Math. USSR-Sb., 38:3 (1981), 365–380  mathnet  crossref  mathscinet  zmath  isi  scopus

   1979
191. V. N. Temlyakov, “Approximation of periodic functions of several variables with bounded mixed derivative”, Soviet Math. Dokl., 20 (1979), 1032–1035  mathnet  mathscinet  mathscinet  zmath

   1977
192. V. N. Temlyakov, “Asymptotic behavior of best approximations of continuous functions”, Math. USSR-Izv., 11:3 (1977), 551–569  mathnet  crossref  mathscinet  zmath  scopus
193. V. N. Temlyakov, “Order of growth of the degrees of a polynomial basis of a space of continuous functions”, Math. Notes, 22:5 (1977), 888–898  mathnet  crossref  mathscinet  zmath  scopus
194. V. N. Temlyakov, “The localization of approximations of functions by trigonometric polynomials”, Anal. Math., 3:2 (1977), 151–169 , in Russian  crossref  mathscinet  zmath  scopus

   1976
195. V. N. Temljakov, “On the asymptotic behavior of best approximations of continuous functions”, Soviet Math. Dokl., 17 (1976), 739–743  mathnet  mathscinet  mathscinet  zmath
196. V. N. Temlyakov, “On best approximation of functions of two variables”, Anal. Math., 2:3 (1976), 231–234  crossref  mathscinet  zmath  scopus

   1975
197. V. N. Temljakov, “Best approximations for functions of two variables”, Soviet Math. Dokl., 16 (1975), 1051–1055  mathnet  mathscinet  mathscinet  zmath

   1974
198. V. N. Temlyakov, “On uniqueness of the polynomial of best approximation of the function $\cos kx$ by trigonometric polynomials in the $L$ metric”, Math. Notes, 15:5 (1974), 436–441  mathnet  crossref  mathscinet  zmath  scopus

Presentations in Math-Net.Ru
1. Отдел математических основ искусственного интеллекта
V. N. Temlyakov
Conference MIAN-90, dedicated to the 90th anniversary of Steklov Mathematical Institute
May 13, 2024 12:40   
2. Is there an alternative to neural networks?
V. N. Temlyakov
Mathematical Foundations of Artificial Intelligence
April 24, 2024 17:00   
3. Some mathematical problems related to artificial intelligence
V. N. Temlyakov
Steklov Mathematical Institute Seminar
February 15, 2024 16:00   
4. Односторонние неравенства дискретизации и восстановление по выборке
I. V. Limonova, Yu. V. Malykhin, V. N. Temlyakov
XXII International Saratov Winter School "Contemporary Problems of Function Theory and Their Applications", dedicated to the 300th anniversary of the Russian Academy of Sciences
January 29, 2024 17:50
5. Некоторые неравенства с энтропийными числами
V. N. Temlyakov
XXII International Saratov Winter School "Contemporary Problems of Function Theory and Their Applications", dedicated to the 300th anniversary of the Russian Academy of Sciences
January 28, 2024 11:00   
6. A brief introduction to the theory of greedy approximation. Lecture 4
V. N. Temlyakov
Contemporary methods in approximation theory and complex analysis
November 16, 2023 16:30   
7. A brief introduction to the theory of greedy approximation. Lecture 3
V. N. Temlyakov
Contemporary methods in approximation theory and complex analysis
November 16, 2023 15:00   
8. A brief introduction to the theory of greedy approximation. Lecture 1
V. N. Temlyakov
Contemporary methods in approximation theory and complex analysis
November 14, 2023 16:30   
9. A brief introduction to the theory of greedy approximation. Lecture 1
V. N. Temlyakov
Contemporary methods in approximation theory and complex analysis
November 14, 2023 15:00   
10. Discretization and recovery
V. N. Temlyakov
Beijing–Moscow Mathematics Colloquium
November 3, 2023 11:00
11. Rate of convergence of Thresholding Greedy Algorithms
V. N. Temlyakov
Conference on the Theory of Functions of Several Real Variables, dedicated to the 90th anniversary of O. V. Besov
May 29, 2023 11:00   
12. Дискретизация и нелинейные методы восстановления функции по значениям в точках.
V. N. Temlyakov
Seminar on Theory of Functions of Real Variables
March 17, 2023 18:30
13. Greedy approximations in Banach spaces
V. Temlyakov
Approximation and discretization
August 30, 2021 10:00   
14. Неравенства типа Лебега в гриди аппроксимации
V. N. Temlyakov
Seminar on Theory of Functions of Real Variables
April 26, 2019 18:30
15. Теоретическая и прикладная математика. Несколько примеров из многомерного приближения
V. N. Temlyakov
Summer School "Contemporary Mathematics" named Vitaly Arnold, 2018
July 20, 2018 09:30   
16. Численное интегрирование и смежные вопросы
V. N. Temlyakov
Seminar on Approximation Theory
May 24, 2018 10:30
17. Дискретизация интегральных норм
V. N. Temlyakov
Seminar on Theory of Functions of Real Variables
March 16, 2018 18:30
18. Sparse approximation with respect to the trigonometric system
V. N. Temlyakov
International conference on Function Spaces and Approximation Theory dedicated to the 110th anniversary of S. M. Nikol'skii
May 27, 2015 10:00   

Books in Math-Net.Ru
  1. Approximation Theory, Functional Analysis, and Applications, Collected papers. On the occasion of the 70th birthday of Academician Boris Sergeevich Kashin, Trudy Mat. Inst. Steklova, 319, ed. S. V. Konyagin, M. I. Dyachenko, V. N. Temlyakov, M. R. Gabdullin, K. S. Ryutin, 2022, 328 с.
    http://mi.mathnet.ru/book1903
  2. V. N. Temlyakov, Approximations of functions with bounded mixed derivative, Trudy Mat. Inst. Steklov., 178, ed. S. M. Nikol'skii, 1986, 113 с.
    http://mi.mathnet.ru/book1159

Organisations
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024