|
|
|
Publications in Math-Net.Ru |
Citations |
|
1984 |
| 1. |
A. P. Klarin, V. A. Shurygin, “Analysis of Efficiency of Universal Coding as a Function of the Block Length”, Probl. Peredachi Inf., 20:2 (1984), 105–110   |
|
1982 |
| 2. |
V. A. Shurygin, “Construction of eigenvectors of completely continuous selfadjoint linear operators in constructive analysis for an eigenvalue of given multiplicity”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 7, 86–88  ; Soviet Math. (Iz. VUZ), 27:7 (1983), 116–119 |
| 3. |
V. A. Shurygin, “Eigenvectors of completely continuous linear operators in constructive analysis”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 6, 84–86 ; Soviet Math. (Iz. VUZ), 26:6 (1982), 112–115 |
| 4. |
V. A. Shurygin, “On the problem of eigenvectors of linear operators in constructive analysis”, Izv. Vyssh. Uchebn. Zaved. Mat., 1982, no. 5, 83–85 ; Soviet Math. (Iz. VUZ), 26:5 (1982), 113–116 |
|
1979 |
| 5. |
V. A. Shurygin, “Bounds on the complexity of normal algorithms”, Dokl. Akad. Nauk SSSR, 244:5 (1979), 1097–1101 |
|
1977 |
| 6. |
V. A. Shurygin, “On estimates of the complexity of algorithmic problems in constructive analysis”, Dokl. Akad. Nauk SSSR, 233:6 (1977), 1064–1067 |
|
1976 |
| 7. |
V. A. Shurygin, “Traceable operators in constructive analysis”, Dokl. Akad. Nauk SSSR, 230:4 (1976), 795–798 |
|
1970 |
| 8. |
V. A. Shurygin, “Constructive sets with an equality and their mappings”, Trudy Mat. Inst. Steklov., 113 (1970), 173–259 ; Proc. Steklov Inst. Math., 113 (1970), 195–287 |
|
1968 |
| 9. |
V. A. Shurygin, “Total constructive sets with equalities and some their properties”, Zap. Nauchn. Sem. LOMI, 8 (1968), 272–280 |
|
1967 |
| 10. |
V. A. Shurygin, “Constructive sets with equality and their mappings”, Dokl. Akad. Nauk SSSR, 173:1 (1967), 54–57 |
|
1966 |
| 11. |
V. A. Shurygin, “Non-trivial constructive mappings of certain sets”, Dokl. Akad. Nauk SSSR, 168:1 (1966), 40–42 |
| |
|
|
Contact us: