|
|
|
Publications in Math-Net.Ru |
Citations |
|
1970 |
| 1. |
D. Blackwell, “On stationary policies”, Matematika, 14:2 (1970), 155–159   |
|
1969 |
| 2. |
David Blackwell, “Positive dynamic programming”, Matematika, 13:5 (1969), 103–106  ; Proc. 5th Berkeley Symp. Math. Stat. Probab., Univ. Calif., 1967, 415–418 |
|
1967 |
| 3. |
D. Blackwell, “Discounted dynamic programming”, Matematika, 11:4 (1967), 151–160 ; Ann. Math. Statist., 36 (1965), 226–235 |
|
1961 |
| 4. |
D. Blackwell, “Infinite codes for memoryless channels”, Matematika, 5:3 (1961), 151–154 ; Ann. Math. Statist., 30:4 (1959), 1242–1244 |
|
1960 |
| 5. |
D. Blackwell, L. Breiman, A. J. Thomasian, “Proof of Shannon's transmission theorem for finite-state indecomposable channels”, Matematika, 4:5 (1960), 123–136 ; Ann. Math. Statist., 29 (1958), 1209–1220 |
|
1959 |
| 6. |
D. Blackwell, “The entropy of functions of finite-state Markov chains”, Matematika, 3:5 (1959), 143–150 ; Transactions of the first Prague conference on information theory, Czechoslovak Academy of sciences, 1957, 13–20 |
|
Contact us: