|
|
|
Publications in Math-Net.Ru |
Citations |
|
2019 |
| 1. |
D. O. Lazarev, N. N. Kuzyurin, “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   |
|
2018 |
| 2. |
D. A. Grushin, N. N. Kuzyurin, “On an effective scheduling problem in computation clusters”, Proceedings of ISP RAS, 30:6 (2018), 123–142 |
1
|
| 3. |
D. O. Lazarev, N. N. Kuzyurin, “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 |
1
|
| 4. |
D. O. Lazarev, N. N. Kuzyurin, “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 |
1
|
|
2017 |
| 5. |
D. A. Grushin, N. N. Kuzjurin, “Optimization problems running MPI-based HPC applications”, Proceedings of ISP RAS, 29:6 (2017), 229–244 |
2
|
| 6. |
D. O. Lazarev, N. N. Kuzyrin, “An algorithm for Multiple Strip Package and its average case evaluation”, Proceedings of ISP RAS, 29:6 (2017), 221–228 |
5
|
| 7. |
N. N. Kuzyrin, D. O. Lazarev, “Analysis of size of the largest dense subgraph of random hypergraph”, Proceedings of ISP RAS, 29:6 (2017), 213–220 |
1
|
| 8. |
N. N. Kuzyurin, “On the problem of finding approximation of bipatite cliques”, Proceedings of ISP RAS, 29:3 (2017), 225–232 |
|
2015 |
| 9. |
A. S. Asratyan, N. N. Kuzyurin, “Approximating chromatic sum coloring of bipartite graphs in expected polynomial time”, Proceedings of ISP RAS, 27:5 (2015), 191–198 |
| 10. |
D. A. Grushin, N. N. Kuzyurin, “Load balancing in Unihub SaaS system based on user behavior prediction”, Proceedings of ISP RAS, 27:5 (2015), 23–34 |
2
|
|
2011 |
| 11. |
N. N. Kuzyurin, A. I. Pospelov, “Probabilistic analysis of a new class of strip packing algorithms”, Zh. Vychisl. Mat. Mat. Fiz., 51:10 (2011), 1931–1936  ; Comput. Math. Math. Phys., 51:10 (2011), 1817–1822   |
6
|
|
2009 |
| 12. |
R. I. Podlovchenko, N. N. Kuzyurin, V. S. Shcherbina, V. A. Zakharov, “Using algebraic models of programs for detecting metamorphic malwares”, Fundam. Prikl. Mat., 15:5 (2009), 181–198 ; J. Math. Sci., 172:5 (2011), 740–750 |
|
2006 |
| 13. |
N. N. Kuzyurin, A. I. Pospelov, “Probabilistic analysis of shelf algorithms for packing rectangles into a strip”, Diskr. Mat., 18:1 (2006), 76–90  ; Discrete Math. Appl., 16:1 (2006), 61–72 |
2
|
|
2004 |
| 14. |
A. S. Asratyan, N. N. Kuzyurin, “Analysis of the accuracy of randomized rounding for integer linear programming problems”, Diskr. Mat., 16:4 (2004), 3–13 ; Discrete Math. Appl., 14:6 (2004), 543–554 |
1
|
|
2002 |
| 15. |
N. N. Kuzyurin, “Probabilistic approximate algorithms in discrete optimization”, Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002), 97–114 |
1
|
|
2000 |
| 16. |
A. S. Asratyan, N. N. Kuzyurin, “Approximation of optima of integer programs of the packing–covering type”, Diskr. Mat., 12:1 (2000), 96–106 ; Discrete Math. Appl., 10:1 (2000), 75–86 |
|
1996 |
| 17. |
N. N. Kuzyurin, “On the maximum $\alpha$-depth of $(0,1)$-matrices in Ryser's
classes”, Dokl. Akad. Nauk, 350:1 (1996), 12–13 |
|
1995 |
| 18. |
N. N. Kuzyurin, “An algorithm that is polynomial on average for integer linear
programming”, Dokl. Akad. Nauk, 343:1 (1995), 15–16 |
| 19. |
N. N. Kuzyurin, “Metric relations in integer linear programming”, Dokl. Akad. Nauk, 340:3 (1995), 308–310 |
| 20. |
N. N. Kuzyurin, “Multiprocessor scheduling and combinatorial configurations”, Diskr. Mat., 7:1 (1995), 77–87 ; Discrete Math. Appl., 5:1 (1995), 63–72 |
|
1994 |
| 21. |
N. N. Kuzyurin, “An algorithm that is polynomial in the mean in integer linear programming”, Sibirsk. Zh. Issled. Oper., 1:3 (1994), 38–48 |
5
|
| 22. |
N. N. Kuzyurin, “Metric aspects of the theory of integer linear programming”, Diskr. Mat., 6:4 (1994), 87–106 ; Discrete Math. Appl., 4:6 (1994), 499–517 |
1
|
|
1991 |
| 23. |
N. N. Kuzyurin, “A parallel algorithm of complexity $O(\log\sp 2n)$ for a problem on balancing sets”, Diskr. Mat., 3:4 (1991), 153–158 ; Discrete Math. Appl., 2:5 (1992), 483–488 |
| 24. |
N. N. Kuzyurin, “On the connection between optima in linear and integer linear programming problems”, Diskr. Mat., 3:1 (1991), 98–104 ; Discrete Math. Appl., 2:3 (1992), 305–311 |
1
|
|
1989 |
| 25. |
N. N. Kuzyurin, “Asymptotically exact polynomial algorithms in problems of integer linear programming”, Diskr. Mat., 1:2 (1989), 78–85 ; Discrete Math. Appl., 1:2 (1991), 171–178 |
3
|
|
1984 |
| 26. |
N. N. Kuzyurin, “Complexity of approximate algorithms for solution of the integer
programming problem”, Zh. Vychisl. Mat. Mat. Fiz., 24:1 (1984), 157–161 ; U.S.S.R. Comput. Math. Math. Phys., 24:1 (1984), 100–103 |
2
|
|
1979 |
| 27. |
N. N. Kuzyurin, “Certain recurrent and asymptotic estimates in the covering problem”, Mat. Zametki, 26:4 (1979), 603–611 ; Math. Notes, 26:4 (1979), 792–796 |
|
1977 |
| 28. |
N. N. Kuzyurin, “Minimal coverings and maximal packings of $(k-1)$-subsets by $k$-subsets”, Mat. Zametki, 21:4 (1977), 565–571 ; Math. Notes, 21:4 (1977), 316–320 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: