Kislitsyn S S

Publications in Math-Net.Ru

1. A finite partially ordered set and its corresponding set of permutations
   
   Mat. Zametki, 4:5 (1968),  511–518
2. A problem from the domain of combinatorial analysis
   
   Mat. Zametki, 3:1 (1968),  15–20
3. Partially ordered sets and $k$-decomposability
   
   Sibirsk. Mat. Zh., 8:5 (1967),  1197–1201
4. Maximal $k$-decomposable sets of permutations of degree $n$
   
   Sibirsk. Mat. Zh., 7:4 (1966),  826–831
5. On the average length of the Huffman code
   
   Uspekhi Mat. Nauk, 20:6(126) (1965),  105–106
6. On the selection of the k th element of an ordered set by pairwise comparisons
   
   Sibirsk. Mat. Zh., 5:3 (1964),  557–564
7. 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


8. To the Editor of UMN
   
   Uspekhi Mat. Nauk, 18:3(111) (1963),  254
9. Corrections and errors
   
   Teor. Veroyatnost. i Primenen., 8:1 (1963),  128