Kuzyurin Nikolai Nikolaevich

Publications in Math-Net.Ru

1. An improvement of previously known upper bound of Multiple Strip Packing problem and probabilistic analysis of algorithm in case of large number of strips given
   
   Proceedings of ISP RAS, 31:1 (2019),  133–142
2. On an effective scheduling problem in computation clusters
   
   Proceedings of ISP RAS, 30:6 (2018),  123–142
3. On-line algorithm for scheduling parallel tasks on related computational clusters with processors of different capacities and its average-case analysis
   
   Proceedings of ISP RAS, 30:6 (2018),  105–122
4. On on-line algorithms for Bin, Strip and Box packing, and their worst- and average-case analysis
   
   Proceedings of ISP RAS, 30:4 (2018),  209–230
5. Optimization problems running MPI-based HPC applications
   
   Proceedings of ISP RAS, 29:6 (2017),  229–244
6. An algorithm for Multiple Strip Package and its average case evaluation
   
   Proceedings of ISP RAS, 29:6 (2017),  221–228
7. Analysis of size of the largest dense subgraph of random hypergraph
   
   Proceedings of ISP RAS, 29:6 (2017),  213–220
8. On the problem of finding approximation of bipatite cliques
   
   Proceedings of ISP RAS, 29:3 (2017),  225–232
9. Approximating chromatic sum coloring of bipartite graphs in expected polynomial time
   
   Proceedings of ISP RAS, 27:5 (2015),  191–198
10. Load balancing in Unihub SaaS system based on user behavior prediction
    
    Proceedings of ISP RAS, 27:5 (2015),  23–34
11. Probabilistic analysis of a new class of strip packing algorithms
    
    Zh. Vychisl. Mat. Mat. Fiz., 51:10 (2011),  1931–1936
12. Using algebraic models of programs for detecting metamorphic malwares
    
    Fundam. Prikl. Mat., 15:5 (2009),  181–198
13. Probabilistic analysis of shelf algorithms for packing rectangles into a strip
    
    Diskr. Mat., 18:1 (2006),  76–90
14. Analysis of the accuracy of randomized rounding for integer linear programming problems
    
    Diskr. Mat., 16:4 (2004),  3–13
15. Probabilistic approximate algorithms in discrete optimization
    
    Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002),  97–114
16. Approximation of optima of integer programs of the packing–covering type
    
    Diskr. Mat., 12:1 (2000),  96–106
17. On the maximum $\alpha$-depth of $(0,1)$-matrices in Ryser's classes
    
    Dokl. Akad. Nauk, 350:1 (1996),  12–13
18. An algorithm that is polynomial on average for integer linear programming
    
    Dokl. Akad. Nauk, 343:1 (1995),  15–16
19. Metric relations in integer linear programming
    
    Dokl. Akad. Nauk, 340:3 (1995),  308–310
20. Multiprocessor scheduling and combinatorial configurations
    
    Diskr. Mat., 7:1 (1995),  77–87
21. An algorithm that is polynomial in the mean in integer linear programming
    
    Sibirsk. Zh. Issled. Oper., 1:3 (1994),  38–48
22. Metric aspects of the theory of integer linear programming
    
    Diskr. Mat., 6:4 (1994),  87–106
23. A parallel algorithm of complexity $O(\log\sp 2n)$ for a problem on balancing sets
    
    Diskr. Mat., 3:4 (1991),  153–158
24. On the connection between optima in linear and integer linear programming problems
    
    Diskr. Mat., 3:1 (1991),  98–104
25. Asymptotically exact polynomial algorithms in problems of integer linear programming
    
    Diskr. Mat., 1:2 (1989),  78–85
26. Complexity of approximate algorithms for solution of the integer programming problem
    
    Zh. Vychisl. Mat. Mat. Fiz., 24:1 (1984),  157–161
27. Certain recurrent and asymptotic estimates in the covering problem
    
    Mat. Zametki, 26:4 (1979),  603–611
28. Minimal coverings and maximal packings of $(k-1)$-subsets by $k$-subsets
    
    Mat. Zametki, 21:4 (1977),  565–571