|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
Stepan Yu. Ponomarev, Alexandr B. Khutoretskii, “Choice of mixed strategy in matrix game with nature by Hurwitz criterion”, Mat. Teor. Igr Pril., 14:2 (2022), 64–75   |
1
|
|
2018 |
| 2. |
A. B. Khutoretskii, S. V. Bredikhin, A. A. Zamyatin, “A lexicographic $0,5$-approximation algorithm for the multiple knapsack problem”, Sib. Zh. Ind. Mat., 21:2 (2018), 108–121  ; J. Appl. Industr. Math., 12:2 (2018), 264–277  |
3
|
|
2011 |
| 3. |
A. B. Khutoretskiĭ, S. V. Bredikhin, A. S. Belov, “An effective balanced budget and a $d$-nonmanipulable technique for processor time allocation”, Sib. Zh. Ind. Mat., 14:3 (2011), 125–131 |
|
2010 |
| 4. |
S. V. Bredikhin, A. B. Khutoretskiĭ, “Equilibrieum allocation of processor time with linear utility functions”, Sib. Zh. Ind. Mat., 13:2 (2010), 46–53 |
1
|
|
2008 |
| 5. |
S. V. Bredikhin, A. Yu. Kuznetsov, A. B. Khutoretskii, “Оптимизация подписки на электронные журналы”, Sib. Zh. Ind. Mat., 11:2 (2008), 21–28 |
1
|
|
2007 |
| 6. |
S. V. Bredikhin, E. M. Tiunova, A. B. Khutoretskii, “Supply-and-demand price alignment in the distribution of power in a multiprocessor system”, Sib. Zh. Ind. Mat., 10:3 (2007), 20–28 |
4
|
|
2006 |
| 7. |
S. V. Bredikhin, I. A. V'alkov, I. I. Savchenko, A. B. Khutoretskii, “Two models of price adjustment in the allocation of computational resources”, Sib. Zh. Ind. Mat., 9:1 (2006), 28–46 |
2
|
|
1971 |
| 8. |
A. B. Khutoretskii, “The power of the upper semilattice of computable numerations”, Algebra Logika, 10:5 (1971), 561–569 |
10
|
|
1969 |
| 9. |
A. B. Khutoretskii, “Nonprincipal numerations”, Algebra Logika, 8:6 (1969), 726–732 |
| 10. |
A. B. Khutoretskii, “Two existence theorems for computable numerations”, Algebra Logika, 8:4 (1969), 483–492 |
6
|
| 11. |
A. B. Khutoretskii, “The reducibility of computable enumerations”, Algebra Logika, 8:2 (1969), 251–264 |
2
|
|
1965 |
| 12. |
A. B. Khutoretskii, “On recursive isomorphism”, Algebra i Logika. Sem., 4:3 (1965), 85–88 |
|
| Organisations |
|
| |
|
|
Contact us: