|
|
|
Publications in Math-Net.Ru |
Citations |
|
1968 |
| 1. |
S. S. Kislitsyn, “A finite partially ordered set and its corresponding set of permutations”, Mat. Zametki, 4:5 (1968), 511–518    ; Math. Notes, 4:5 (1968), 798–801 |
4
|
| 2. |
S. S. Kislitsyn, “A problem from the domain of combinatorial analysis”, Mat. Zametki, 3:1 (1968), 15–20 ; Math. Notes, 3:1 (1968), 11–14 |
|
1967 |
| 3. |
S. S. Kislitsyn, “Partially ordered sets and $k$-decomposability”, Sibirsk. Mat. Zh., 8:5 (1967), 1197–1201 ; Siberian Math. J., 8:5 (1967), 916–919 |
|
1966 |
| 4. |
S. S. Kislitsyn, “Maximal $k$-decomposable sets of permutations of degree $n$”, Sibirsk. Mat. Zh., 7:4 (1966), 826–831 ; Siberian Math. J., 29:4 (1966), 658–662 |
|
1965 |
| 5. |
S. S. Kislitsyn, “On the average length of the Huffman code”, Uspekhi Mat. Nauk, 20:6(126) (1965), 105–106 |
|
1964 |
| 6. |
S. S. Kislitsyn, “On the selection of the k th element of an ordered set by pairwise comparisons”, Sibirsk. Mat. Zh., 5:3 (1964), 557–564 |
|
1962 |
| 7. |
S. S. Kislitsyn, “The Average Length of a Minimum Redundancy Binary Code for Probabilities of
Coded Symbols not Differing Greatly From Each Other”, Teor. Veroyatnost. i Primenen., 7:3 (1962), 342–343 ; Theory Probab. Appl., 7:3 (1962), 331–333 |
|
|
|
1963 |
| 8. |
S. S. Kislitsyn, “To the Editor of UMN”, Uspekhi Mat. Nauk, 18:3(111) (1963), 254 |
| 9. |
S. S. Kislitsyn, “Corrections and errors”, Teor. Veroyatnost. i Primenen., 8:1 (1963), 128 |
|
| Organisations |
|
| |
|
|
Contact us: