L. A. Sholomov, “Theoretically effective asymptotically optimal universal coding of partially defined sources”, Prikl. Diskr. Mat., 2020, no. 47, 30–56
L. A. Sholomov, “Polynomial asymptotically optimal coding of underdetermined Bernoulli sources of the general form”, Probl. Peredachi Inf., 56:4 (2020), 81–96; Problems Inform. Transmission, 56:4 (2020), 373–387
2019
3.
L. A. Sholomov, “Minimal representative set for a system of frequency classes of underdetermined words”, Prikl. Diskr. Mat. Suppl., 2019, no. 12, 41–44
2018
4.
L. A. Sholomov, “On an invariant for the problem of underdetermined data decomposing”, Prikl. Diskr. Mat., 2018, no. 39, 13–32
2014
5.
L. A. Sholomov, “On the concept of underdetermined alphabets of equal strength”, Prikl. Diskr. Mat., 2014, no. 3(25), 40–57
L. A. Sholomov, “Decomposition and approximation of underdetermined data”, Prikl. Diskr. Mat. Suppl., 2012, no. 5, 34–36
2010
11.
L. A. Sholomov, “A rule for the addition of entropies for underdetermined data”, Diskretn. Anal. Issled. Oper., 17:5 (2010), 67–90; J. Appl. Industr. Math., 5:3 (2011), 431–447
2009
12.
L. A. Sholomov, “Elements of underdetermined information theory”, Prikl. Diskr. Mat., 2009, no. supplement № 2, 18–42
L. A. Sholomov, “Entropy of underdetermined sequences under constraints to specifications”, Prikl. Diskr. Mat., 2008, no. 1(1), 29–33
2007
16.
L. A. Sholomov, “On the complexity of the sequential realization of partial Boolean functions by schemes”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:1 (2007), 110–139; J. Appl. Industr. Math., 2:2 (2008), 270–289
L. A. Sholomov, “Transformation of fuzzy data with preservation of the information properties”, Diskretn. Anal. Issled. Oper., Ser. 1, 12:3 (2005), 85–104
L. A. Sholomov, “Logical methods for studying relations in criterial spaces with arbitrary ordinal scales”, Avtomat. i Telemekh., 2004, no. 5, 115–125; Autom. Remote Control, 65:5 (2004), 790–799
L. A. Sholomov, “Complexity of the recognition of the properties of order relations in $n$-dimensional spaces”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002), 82–105
L. A. Sholomov, “Analysis of the rationality of the sequential choice model”, Avtomat. i Telemekh., 2000, no. 5, 124–132; Autom. Remote Control, 61:5 (2000), 829–836
L. A. Sholomov, “On the complexity of problems of minimization and compression of models of sequential choice”, Diskretn. Anal. Issled. Oper., Ser. 1, 6:3 (1999), 87–109
L. A. Sholomov, “Aggregation of linear orders in problems of group choice”, Avtomat. i Telemekh., 1998, no. 2, 113–122; Autom. Remote Control, 59:2 (1998), 246–253
L. A. Sholomov, “Logical methods for the representation and investigation of ordered choice models”, Avtomat. i Telemekh., 1994, no. 5, 100–108; Autom. Remote Control, 55:5 (1994), 698–704
28.
L. A. Sholomov, “Synthesis of transitive order relations that are consistent with information on the strength of criteria”, Sibirsk. Zh. Issled. Oper., 1:4 (1994), 64–92
L. A. Sholomov, “Order relations and Arrow operators”, Avtomat. i Telemekh., 1991, no. 6, 115–126; Autom. Remote Control, 52:6 (1991), 842–850
1986
30.
L. A. Sholomov, D. B. Yudin, “Design of multistep choice schemes”, Avtomat. i Telemekh., 1986, no. 10, 115–126; Autom. Remote Control, 47:10 (1986), 1414–1424
1985
31.
D. B. Yudin, L. A. Sholomov, “Multistep schemes of generalized mathematical programming and the
choice function”, Dokl. Akad. Nauk SSSR, 282:5 (1985), 1066–1069
L. A. Sholomov, “Information complexity of problems associated with minimal realization of Boolean functions by networks”, Dokl. Akad. Nauk SSSR, 200:3 (1971), 556–559