|
|
|
Publications in Math-Net.Ru |
Citations |
|
1973 |
| 1. |
A. S. Kronrod, “On a nonmajorizable method for choosing a confidence region for one type of specified function”, Dokl. Akad. Nauk SSSR, 210:1 (1973), 18–19    |
| 2. |
A. S. Kronrod, “On a nonmajorizable method for choosing a confidence region at a given confidence level”, Dokl. Akad. Nauk SSSR, 208:5 (1973), 1026 |
|
1972 |
| 3. |
A. S. Kronrod, “On the choice of a minimal confidence region”, Dokl. Akad. Nauk SSSR, 205:5 (1972), 1036 |
|
1970 |
| 4. |
A. S. Kronrod, V. A. Kronrod, I. A. Faradzhev, “The choice of the step in the computation of derivatives”, Dokl. Akad. Nauk SSSR, 194:4 (1970), 767–769 |
|
1966 |
| 5. |
V. L. Arlazarov, A. S. Kronrod, V. A. Kronrod, “A new type of electron computer”, Dokl. Akad. Nauk SSSR, 171:2 (1966), 299–301 |
|
1964 |
| 6. |
G. M. Adel'son-Vel'skii, A. L. Brudno, A. S. Kronrod, P. T. Reznikovskii, “A system of commands for a three-address machine without address register”, Dokl. Akad. Nauk SSSR, 154:3 (1964), 545–548 |
| 7. |
A. S. Kronrod, “Integration with control of accuracy”, Dokl. Akad. Nauk SSSR, 154:2 (1964), 283–286 |
|
1960 |
| 8. |
A. S. Kronrod, “Numerical solution to the equation of the magnetic field in iron with allowance saturation”, Dokl. Akad. Nauk SSSR, 132:1 (1960), 95–97 |
|
1950 |
| 9. |
A. S. Kronrod, “On functions of two variables”, Uspekhi Mat. Nauk, 5:1(35) (1950), 24–134 |
28
|
|
1946 |
| 10. |
A. Kronrod, “On permutation of terms of numerical series”, Rec. Math. [Mat. Sbornik] N.S., 18(60):2 (1946), 237–280 |
1
|
|
1939 |
| 11. |
A. Kronrod, “Sur la structure de l'ensemble des points de discontinuité d'une fonction dérivable en ses points de continuité”, Izv. Akad. Nauk SSSR Ser. Mat., 3:5-6 (1939), 569–578 |
2
|
|
|
|
1970 |
| 12. |
O. N. Golovin, G. M. Zhislin, A. S. Kronrod, E. M. Landis, L. A. Lyusternik, G. E. Shilov, “Aleksandr Grigor'evich Sigalov (obituary)”, Uspekhi Mat. Nauk, 25:5(155) (1970), 227–234 ; Russian Math. Surveys, 25:5 (1970), 225–232 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: