Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Pinsker, Marks Shlemovich
(1925–2003)
Statistics Math-Net.Ru
Total publications: 84
Scientific articles: 80

Number of views:
This page:3593
Abstract pages:35479
Full texts:13676
References:884
Professor
Doctor of physico-mathematical sciences (1962)

https://www.mathnet.ru/eng/person17334
https://ru.wikipedia.org/wiki/Pinsker,_Mark_Semenovich
List of publications on Google Scholar
List of publications on ZentralBlatt
https://mathscinet.ams.org/mathscinet/MRAuthorID/139800
https://elibrary.ru/author_items.asp?authorid=136272

Publications in Math-Net.Ru Citations
2007
1. M. S. Pinsker, “Some Mathematical Questions of Theory of Information Transmission”, Probl. Peredachi Inf., 43:4 (2007),  124–138  mathnet  mathscinet  zmath  elib; Problems Inform. Transmission, 43:4 (2007), 380–392  isi  scopus
2005
2. M. S. Pinsker, “On Estimation of Information via Variation”, Probl. Peredachi Inf., 41:2 (2005),  3–8  mathnet  mathscinet  zmath; Problems Inform. Transmission, 41:2 (2005), 71–75 17
2002
3. I. I. Dumer, M. S. Pinsker, V. V. Prelov, “An Optimization Problem Related to the Computation of the Epsilon-entropy of an Ellipsoid in a Hamming Space”, Probl. Peredachi Inf., 38:2 (2002),  3–18  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:2 (2002), 99–112 4
4. I. I. Dumer, M. S. Pinsker, V. V. Prelov, “Epsilon-entropy of an Ellipsoid in a Hamming Space”, Probl. Peredachi Inf., 38:1 (2002),  3–18  mathnet  mathscinet  zmath; Problems Inform. Transmission, 38:1 (2002), 1–15 4
2001
5. L. A. Bassalygo, M. S. Pinsker, “Correction of Ordinary and Localized Errors”, Probl. Peredachi Inf., 37:4 (2001),  56–59  mathnet  mathscinet  zmath; Problems Inform. Transmission, 37:4 (2001), 325–328 1
2000
6. M. S. Pinsker, V. V. Prelov, “On Error-Free Filtering of Singular Processes under Nonstationary Distortions”, Probl. Peredachi Inf., 36:4 (2000),  89–97  mathnet  mathscinet  zmath; Problems Inform. Transmission, 36:4 (2000), 362–369 2
7. M. S. Pinsker, “Entropy of an Ellipsoid in a Hamming Space”, Probl. Peredachi Inf., 36:4 (2000),  47–52  mathnet  mathscinet  zmath; Problems Inform. Transmission, 36:4 (2000), 325–330 6
8. M. S. Pinsker, V. V. Prelov, E. C. van der Meulen, “Information Rate in Memoryless Channels for a Slowly Varying Markov Signal”, Probl. Peredachi Inf., 36:3 (2000),  29–38  mathnet  mathscinet  zmath; Problems Inform. Transmission, 36:3 (2000), 220–229 1
9. L. A. Bassalygo, M. S. Pinsker, “Evaluation of the Asymptotics of the Summarized Capacity of an $M$-Frequency $T$-User Noiseless Multiple-Access Channel”, Probl. Peredachi Inf., 36:2 (2000),  3–9  mathnet  mathscinet  zmath; Problems Inform. Transmission, 36:2 (2000), 91–97 10
1999
10. R. Ahlswede, L. A. Bassalygo, M. S. Pinsker, “On the Hamming Bound for Nonbinary Localized-Error-Correcting Codes”, Probl. Peredachi Inf., 35:2 (1999),  29–37  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:2 (1999), 117–124 5
11. L. A. Bassalygo, M. S. Pinsker, “Centered Error-Correcting Codes”, Probl. Peredachi Inf., 35:1 (1999),  30–37  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:1 (1999), 25–31 3
12. M. S. Pinsker, V. V. Prelov, E. C. van der Meulen, “Stationary Channels with a Random Parameter Which Is a Completely Singular Process”, Probl. Peredachi Inf., 35:1 (1999),  3–12  mathnet  mathscinet  zmath; Problems Inform. Transmission, 35:1 (1999), 1–9 2
1998
13. M. S. Pinsker, V. V. Prelov, “Upper and Lower Bounds and Asymptotics of Optimal Filtering Error of a Stationary Process with a Small Information Rate”, Probl. Peredachi Inf., 34:4 (1998),  23–38  mathnet  mathscinet  zmath; Problems Inform. Transmission, 34:4 (1998), 309–321 3
14. M. S. Pinsker, V. V. Prelov, “Error-Free Filtering of an Entropy-Singular Signal under Independent Distortions”, Probl. Peredachi Inf., 34:3 (1998),  3–6  mathnet  zmath; Problems Inform. Transmission, 34:3 (1998), 207–209 3
15. M. S. Pinsker, V. V. Prelov, E. C. van der Meulen, “Information Rates in Certain Stationary Non-Gaussian Channels in Weak-Signal Transmission”, Probl. Peredachi Inf., 34:1 (1998),  3–17  mathnet  mathscinet  zmath; Problems Inform. Transmission, 34:1 (1998), 1–13 7
1997
16. M. S. Pinsker, V. V. Prelov, S. Verdú, “Sensitivity of the $\varepsilon$-Entropy of Stationary Continuous-Time Gaussian Processes”, Probl. Peredachi Inf., 33:2 (1997),  3–25  mathnet  mathscinet  zmath; Problems Inform. Transmission, 33:2 (1997), 95–113 4
17. M. Sh. Pinsker, V. V. Prelov, “On error-free filtering of some stationary processes”, Uspekhi Mat. Nauk, 52:2(314) (1997),  109–118  mathnet  mathscinet  zmath; Russian Math. Surveys, 52:2 (1997), 349–358  isi  scopus 14
1996
18. L. A. Bassalygo, M. S. Pinsker, “Codes Detecting Localized Errors”, Probl. Peredachi Inf., 32:2 (1996),  36–38  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:2 (1996), 168–170 1
1995
19. M. S. Pinsker, V. V. Prelov, “Optimal Filtering of a Gaussian Signal Against a Background of Almost Gaussian Noise”, Probl. Peredachi Inf., 31:4 (1995),  3–21  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:4 (1995), 295–311 3
20. R. Ahlswede, L. A. Bassalygo, M. S. Pinsker, “Asymptotically Optimal Binary Codes of Polynomial Complexity Correcting Localized Errors”, Probl. Peredachi Inf., 31:2 (1995),  76–83  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:2 (1995), 162–168 1
21. V. M. Blinovskii, P. Narajan, M. S. Pinsker, “Capacity of the Arbitrarily Varying Channel under List Decoding”, Probl. Peredachi Inf., 31:2 (1995),  3–19  mathnet  mathscinet  zmath; Problems Inform. Transmission, 31:2 (1995), 99–113 2
1994
22. M. S. Pinsker, V. V. Prelov, “Information Rates in Stationary Gaussian Channels in Weak Signal Transmission”, Probl. Peredachi Inf., 30:4 (1994),  3–11  mathnet  mathscinet  zmath; Problems Inform. Transmission, 30:4 (1994), 291–298 4
23. R. Ahlswede, L. A. Bassalygo, M. S. Pinsker, “Binary Constant-Weight Codes Correcting Localized Errors and Defects”, Probl. Peredachi Inf., 30:2 (1994),  10–13  mathnet  mathscinet  zmath; Problems Inform. Transmission, 30:2 (1994), 102–104 2
1992
24. L. A. Bassalygo, M. S. Pinsker, “Binary Constant-Weight Codes Correcting Localized Errors”, Probl. Peredachi Inf., 28:4 (1992),  103–105  mathnet  mathscinet  zmath; Problems Inform. Transmission, 28:4 (1992), 390–392 2
25. L. A. Bassalygo, S. I. Gel'fand, M. S. Pinsker, “Bounds for Codes with Separately Localized Errors”, Probl. Peredachi Inf., 28:1 (1992),  14–21  mathnet  mathscinet  zmath; Problems Inform. Transmission, 28:1 (1992), 11–17
1991
26. A. K. Gorbunov, M. S. Pinsker, “Asymptotic Behavior of Nonanticipative Epsilon-Entropy for Gaussian Processes”, Probl. Peredachi Inf., 27:4 (1991),  100–104  mathnet  mathscinet  zmath; Problems Inform. Transmission, 27:4 (1991), 361–365
27. L. A. Bassalygo, S. I. Gel'fand, M. S. Pinsker, “Simple Methods for Deriving Lower Bounds in Coding Theory”, Probl. Peredachi Inf., 27:4 (1991),  3–8  mathnet  mathscinet  zmath; Problems Inform. Transmission, 27:4 (1991), 277–281 5
1990
28. L. A. Bassalygo, M. S. Pinsker, “Controllable Connector”, Probl. Peredachi Inf., 26:2 (1990),  98–101  mathnet  mathscinet  zmath; Problems Inform. Transmission, 26:2 (1990), 170–172
29. N. D. Vvedenskaya, M. S. Pinsker, “Bounds on the Capacity of FCFS Multiple-Access Algorithms”, Probl. Peredachi Inf., 26:1 (1990),  58–67  mathnet  mathscinet  zmath; Problems Inform. Transmission, 26:1 (1990), 49–56 1
1989
30. S. Yu. Efroimovich, M. S. Pinsker, “Signal identification with specified risk”, Avtomat. i Telemekh., 1989, no. 10,  96–104  mathnet  mathscinet  zmath; Autom. Remote Control, 50:10 (1989), 1383–1390
31. A. K. Gorbunov, M. S. Pinsker, “Delayed Epsilon-Entropy of a Noisy Gaussian Message with Small Reproduction Error”, Probl. Peredachi Inf., 25:3 (1989),  53–61  mathnet  mathscinet  zmath; Problems Inform. Transmission, 25:3 (1989), 212–218
1988
32. L. A. Bassalygo, M. S. Pinsker, “A Comment on the Paper of Kasami, Lin, Wei, and Yamamura, “Coding for the Binary Symmetric Broadcast Channel with Two Receivers””, Probl. Peredachi Inf., 24:3 (1988),  102–106  mathnet  mathscinet  zmath; Problems Inform. Transmission, 24:3 (1988), 253–257 1
33. A. K. Gorbunov, M. S. Pinsker, “Delayed Epsilon-Entropy for a Gaussian Message Corrupted by Noise”, Probl. Peredachi Inf., 24:3 (1988),  18–23  mathnet  mathscinet  zmath; Problems Inform. Transmission, 24:3 (1988), 185–189
1987
34. M. S. Pinsker, A. K. Gorbunov, “Delayed Epsilon-Entropy for Small Mean-square Reproduction Error”, Probl. Peredachi Inf., 23:2 (1987),  3–8  mathnet  mathscinet  zmath; Problems Inform. Transmission, 23:2 (1987), 91–95
1986
35. M. S. Pinsker, L. B. Sofman, “$(\varepsilon,\delta)$-Entropy of Completely Ergodic Stochastic Processes”, Probl. Peredachi Inf., 22:4 (1986),  3–8  mathnet  mathscinet  zmath; Problems Inform. Transmission, 22:4 (1986), 251–255 1
36. S. Yu. Efroimovich, M. S. Pinsker, “Self-Tuning Algorithm for Minimax Nonparametric Estimation of Spectral Density”, Probl. Peredachi Inf., 22:3 (1986),  62–76  mathnet  mathscinet  zmath; Problems Inform. Transmission, 22:3 (1986), 209–221 1
1985
37. G. K. Golubev, M. S. Pinsker, “Extremal Problems in Minimax Estimation of Sequences”, Probl. Peredachi Inf., 21:3 (1985),  36–52  mathnet  mathscinet  zmath; Problems Inform. Transmission, 21:3 (1985), 192–206
1984
38. S. Yu. Efroimovich, M. S. Pinsker, “A learning algorithm of non-parametric filtering”, Avtomat. i Telemekh., 1984, no. 11,  58–65  mathnet  mathscinet  zmath; Autom. Remote Control, 45:11 (1984), 1434–1440 4
39. G. K. Golubev, M. S. Pinsker, “Minimax Extrapolation of Functions”, Probl. Peredachi Inf., 20:2 (1984),  27–43  mathnet  mathscinet; Problems Inform. Transmission, 20:2 (1984), 99–111 1
1983
40. L. A. Bassalygo, M. S. Pinsker, “Restricted Asynchronous Multiple Access”, Probl. Peredachi Inf., 19:4 (1983),  92–96  mathnet  mathscinet  zmath 9
41. G. K. Golubev, M. S. Pinsker, “Minimax Extrapolation of Sequences”, Probl. Peredachi Inf., 19:4 (1983),  31–42  mathnet  mathscinet; Problems Inform. Transmission, 19:4 (1983), 275–283
42. M. S. Pinsker, L. B. Sofman, “Entropy Characteristics and Linear Approximations for a Homogeneous Gaussian Field”, Probl. Peredachi Inf., 19:3 (1983),  52–67  mathnet  mathscinet  zmath; Problems Inform. Transmission, 19:3 (1983), 214–226
43. S. I. Gel'fand, M. Sh. Pinsker, “Converse Coding Theorem for a Gaussian Source with Side Information”, Probl. Peredachi Inf., 19:2 (1983),  101–106  mathnet  zmath
1982
44. S. Yu. Efroimovich, M. S. Pinsker, “Estimation of Square-Integrable Probability Density of a Random Variable”, Probl. Peredachi Inf., 18:3 (1982),  19–38  mathnet  mathscinet  zmath; Problems Inform. Transmission, 18:3 (1982), 175–189 3
45. L. A. Bassalygo, M. S. Pinsker, V. V. Prelov, “Zero-Error Capacity for Deterministic Multiple-Access Channels with Common Information”, Probl. Peredachi Inf., 18:1 (1982),  3–11  mathnet  zmath; Problems Inform. Transmission, 18:1 (1982), 1–8
1981
46. V. V. Zyablov, M. S. Pinsker, “List Concatenated Decoding”, Probl. Peredachi Inf., 17:4 (1981),  29–33  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:4 (1981), 236–240 6
47. S. Yu. Efroimovich, M. S. Pinsker, “Estimation of Square-Integrable Density on the Basis of a Sequence of Observations”, Probl. Peredachi Inf., 17:3 (1981),  50–68  mathnet  mathscinet  zmath; Problems Inform. Transmission, 17:3 (1981), 182–196 3
1980
48. L. A. Bassalygo, M. S. Pinsker, “Asymptotically Optimal Batch Rearrangeable and Nonrearrangeable Switching Circuits”, Probl. Peredachi Inf., 16:4 (1980),  94–98  mathnet  zmath
49. L. A. Bassalygo, M. S. Pinsker, “Bounds on Volume of Error-Correcting Codes in a Broadcast Channel (Generalized Blackwell Channel)”, Probl. Peredachi Inf., 16:3 (1980),  3–16  mathnet  mathscinet  zmath; Problems Inform. Transmission, 16:3 (1980), 163–174
50. S. I. Gel'fand, M. S. Pinsker, “Capacity of an Arbitrary Channel with Defects”, Probl. Peredachi Inf., 16:2 (1980),  108–109  mathnet  zmath
51. M. S. Pinsker, “Optimal Filtering of Square-Integrable Signals in Gaussian Noise”, Probl. Peredachi Inf., 16:2 (1980),  52–68  mathnet  mathscinet  zmath; Problems Inform. Transmission, 16:2 (1980), 120–133 24
52. S. I. Gel'fand, M. S. Pinsker, “Capacity of a Broadcast Channel with One Deterministic Component”, Probl. Peredachi Inf., 16:1 (1980),  24–34  mathnet  mathscinet  zmath; Problems Inform. Transmission, 16:1 (1980), 17–25 3
1979
53. L. A. Bassalygo, V. A. Zinov'ev, V. V. Zyablov, M. S. Pinsker, G. Sh. Poltyrev, “Bounds for Codes with Unequal Protection of Two Sets of Messag”, Probl. Peredachi Inf., 15:3 (1979),  40–49  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:3 (1979), 190–197 2
54. S. I. Gel'fand, M. S. Pinsker, “Coding of Sources on the Basis of Observations with Incomplete Information”, Probl. Peredachi Inf., 15:2 (1979),  45–57  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:2 (1979), 115–125 1
55. I. A. Ovseevich, M. S. Pinsker, “Linear Transmission of Gaussian Messages over a Nonstationary Gaussian Channel with Feedback”, Probl. Peredachi Inf., 15:2 (1979),  3–22  mathnet  mathscinet  zmath; Problems Inform. Transmission, 15:2 (1979), 85–99 1
1978
56. L. A. Bassalygo, M. S. Pinsker, “Error correction in channels with defects”, Dokl. Akad. Nauk SSSR, 243:6 (1978),  1361–1364  mathnet  mathscinet  zmath 1
57. M. S. Pinsker, “Capacity of Noiseless Broadcast Channel”, Probl. Peredachi Inf., 14:2 (1978),  28–34  mathnet  mathscinet  zmath; Problems Inform. Transmission, 14:2 (1978), 97–102 1
1977
58. L. A. Bassalygo, V. V. Zyablov, M. S. Pinsker, “Problems of Complexity in the Theory of Correcting Codes”, Probl. Peredachi Inf., 13:3 (1977),  5–17  mathnet  mathscinet  zmath; Problems Inform. Transmission, 13:3 (1977), 166–175
1975
59. V. V. Zyablov, M. S. Pinsker, “Estimation of the error-correction complexity for Gallager low-density codes”, Probl. Peredachi Inf., 11:1 (1975),  23–36  mathnet  mathscinet  zmath; Problems Inform. Transmission, 11:1 (1975), 18–28 21
1974
60. A. K. Gorbunov, M. S. Pinsker, “Prognostic Epsilon Entropy of a Gaussian Message and a Gaussian Source”, Probl. Peredachi Inf., 10:2 (1974),  5–25  mathnet  mathscinet  zmath; Problems Inform. Transmission, 10:2 (1974), 93–109
61. V. V. Zyablov, M. S. Pinsker, “Decoding Complexity of Low-Density Codes For Transmission in a Channel with Erasures”, Probl. Peredachi Inf., 10:1 (1974),  15–28  mathnet  mathscinet  zmath; Problems Inform. Transmission, 10:1 (1974), 10–21 3
62. I. A. Ovseevich, M. S. Pinsker, “Linear Transmission of Nonstationary Gaussian Messages in a Gaussian Channel with Feedback”, Probl. Peredachi Inf., 10:1 (1974),  3–8  mathnet  mathscinet  zmath; Problems Inform. Transmission, 10:1 (1974), 1–5 1
1973
63. A. K. Gorbunov, M. Sh. Pinsker, “Nonanticipatory and Prognostic Epsilon Entropies and Message Generation Rates”, Probl. Peredachi Inf., 9:3 (1973),  12–21  mathnet  mathscinet  zmath; Problems Inform. Transmission, 9:3 (1973), 184–191 1
64. L. A. Bassalygo, M. S. Pinsker, “Complexity of an Optimum Nonblocking Switching Network without Reconnections”, Probl. Peredachi Inf., 9:1 (1973),  84–87  mathnet  mathscinet  zmath; Problems Inform. Transmission, 9:1 (1973), 64–66 3
1972
65. M. S. Pinsker, Yu. L. Sagalovich, “Lower Bound for the Power of an Automaton State Code”, Probl. Peredachi Inf., 8:3 (1972),  58–66  mathnet  mathscinet; Problems Inform. Transmission, 8:3 (1972), 224–230 3
66. M. S. Pinsker, “The Information Content of Observations, and Asymptotically Sufficient Statistics”, Probl. Peredachi Inf., 8:1 (1972),  45–61  mathnet  mathscinet  zmath; Problems Inform. Transmission, 8:1 (1972), 33–46 1
1971
67. A. G. D'yachkov, M. S. Pinsker, “Optimum Linear Transmission through a Memoryless Gaussian Channel with Full Feedback”, Probl. Peredachi Inf., 7:2 (1971),  38–46  mathnet  mathscinet  zmath; Problems Inform. Transmission, 7:2 (1971), 123–129 5
1970
68. M. S. Pinsker, A. Yu. Sheverdyaev, “Transmission Capacity with Zero Error and Erasure”, Probl. Peredachi Inf., 6:1 (1970),  20–24  mathnet  mathscinet  zmath; Problems Inform. Transmission, 6:1 (1970), 13–17
1969
69. R. L. Dobrushin, M. S. Pinsker, “Memory Increases Transmission Capacity”, Probl. Peredachi Inf., 5:1 (1969),  94–95  mathnet  zmath; Problems Inform. Transmission, 5:1 (1969), 77–78 3
1968
70. M. S. Pinsker, “The Probability of Error in Block Transmission in a Memoryless Gaussian Channel with Feedback”, Probl. Peredachi Inf., 4:4 (1968),  3–19  mathnet  mathscinet  zmath; Problems Inform. Transmission, 4:4 (1968), 1–14 18
1967
71. M. S. Pinsker, “Bounds of the Probability and of the Number of Correctable Errors for Nonblock Codes”, Probl. Peredachi Inf., 3:4 (1967),  58–71  mathnet  mathscinet  zmath; Problems Inform. Transmission, 3:4 (1967), 44–55
72. K. Sh. Zigangirov, M. S. Pinsker, B. S. Tsybakov, “Sequential Decoding in a Continuous Channel”, Probl. Peredachi Inf., 3:4 (1967),  5–17  mathnet  mathscinet  zmath; Problems Inform. Transmission, 3:4 (1967), 1–10
1965
73. M. S. Pinsker, “On the complexity of decoding”, Probl. Peredachi Inf., 1:1 (1965),  113–116  mathnet
1964
74. M. S. Pinsker, “Mathematical foundations of the theory of optimum coding of information”, Itogi Nauki. Ser. Mat. Anal. Teor. Ver. Regulir. 1962, 1964,  197–210  mathnet
1960
75. M. S. Pinsker, “Dynamical systems with completely positive or zero entropy”, Dokl. Akad. Nauk SSSR, 133:5 (1960),  1025–1026  mathnet  mathscinet  zmath 5
76. M. S. Pinsker, “The entropy, rate of establishment of entropy and entropic stability of Gaussian random quantities and processes”, Dokl. Akad. Nauk SSSR, 133:3 (1960),  531–534  mathnet  mathscinet  zmath
77. M. S. Pinsker, “The information stability of Gaussian random variables and processes”, Dokl. Akad. Nauk SSSR, 133:1 (1960),  28–30  mathnet  mathscinet  zmath
1958
78. M. S. Pinsker, “The extrapolation of random vector processes and the quantity of information contained in a stationary random vector process relative to another one stationarily connected with it”, Dokl. Akad. Nauk SSSR, 121:1 (1958),  49–51  mathnet  mathscinet  zmath 1
1957
79. M. S. Pinsker, “Extrapolation of homogeneous random fields and the quantity of information on a gaussian random field contained in another gaussian random field”, Dokl. Akad. Nauk SSSR, 112:5 (1957),  815–818  mathnet  mathscinet  zmath
1955
80. M. S. Pinsker, “The theory of curves in Hilbert space with stationary $n$th increments”, Izv. Akad. Nauk SSSR Ser. Mat., 19:5 (1955),  319–344  mathnet  mathscinet  zmath
1996
81. L. A. Bassalygo, V. A. Malyshev, R. A. Minlos, I. A. Ovseevich, E. A. Pechersky, M. S. Pinsker, V. V. Prelov, A. N. Rybko, Yu. M. Sukhov, S. B. Shlosman, “In Memory of Roland L'vovich Dobrushin”, Probl. Peredachi Inf., 32:3 (1996),  3–24  mathnet  mathscinet  zmath; Problems Inform. Transmission, 32:3 (1996), 223–238 4
82. B. M. Gurevich, I. A. Ibragimov, R. A. Minlos, I. A. Ovseevich, V. I. Oseledets, M. S. Pinsker, V. V. Prelov, Yu. V. Prokhorov, Ya. G. Sinai, A. S. Holevo, A. N. Shiryaev, “Roland L'vovich Dobrushin (20 July 1919 – 12 November 1995)”, Teor. Veroyatnost. i Primenen., 41:1 (1996),  164–169  mathnet  mathscinet; Theory Probab. Appl., 41:1 (1997), 132–136  isi
1989
83. A. A. Kirillov, V. A. Malyshev, R. A. Minlos, S. P. Novikov, M. Sh. Pinsker, Ya. G. Sinai, Yu. M. Sukhov, S. B. Shlosman, “Roland L'vovich Dobrushin (on his sixtieth birthday)”, Uspekhi Mat. Nauk, 44:6(270) (1989),  161–162  mathnet  mathscinet; Russian Math. Surveys, 44:6 (1989), 197–199  isi
1970
84. M. S. Pinsker, “Symposium on Information Theory”, Probl. Peredachi Inf., 6:2 (1970),  125–127  mathnet

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