Nikolai N. Kuzjurin

SELECTED PAPERS:

  1. Uber minimale Uberdecungen auf einer n-elementigen Menge, Math.-Nat. R., Wiss. Zeitschrift der Humboldt-Universitat zu, Berlin, 1975, XXIV, N 6.

  2. On mimimal coverings and packings of (k-1)-tuples by k-tuples (in Russian), Matem. Zametki, 1977, v. 21, N 4, pp. 565 - 571, (translated in English, published in Math. Notes).

  3. A survey on the set covering problem (in Russian), in: Diskret. analysis, 1977, N 30, Novosibirsk, pp. 46 - 75 (coauthors A. Sapozhenko, A. Asratjan).

  4. Some recurrent and asymptotical bounds for set covering problem (in Russian), Matem. Zametki, 1979, v. 26, N 4, pp. 603 - 611, (translated in English, published in Math. Notes).

  5. On some asymptotically optimal packings (in Russian), in: Combinatorial and algebraic methods in applied mathematics, Gor'kii, 1979, pp. 57 - 65 (in Russian).

  6. On approximation search of maximal upper zero for monotone functions of k-valued logic (in Russian), in: Methods of discrete analysis for solving extremal problems, Novosibirsk, 1979, N 33, pp. 31 - 40.

  7. Asymptotical investigation of set covering problem (in Russian), in: Problemi kibernetiki, M., Nauka, 1980, N 37, pp. 19 - 57.

  8. On the alpha-height of (0,1)-matrices (in Russian), in: Voprosi kibernetiki. Discret. Math. and Cybernetics, M,, 1982, pp. 131 - 139.

  9. One limit theorem about (n,k,l)-coverings, Rostock Math. Kolloq. 1982, N 21, pp. 59 - 62.

  10. On the complexity of approximation algorithms for integer linear programming (in Russian), J. Vichislit. Matem. i Matem. Fiziki, 1984, N 1 (translated in English in J. of Comput. Math. and Math. Physics).

  11. Algorithms and programs for implementation of mathematical functions on pipe-lined computers, in "Questions in cybernetics. Problems of developing supercomputers", Moscow, 1984 (coauthor A.V. Shokurov).

  12. An asymptotic formula for the maximum size of an h-family in products of partially ordered sets, J. Comb. Theory, Ser. A., 1984, v. 37, N 3, pp. 337 - 347. (coauthor K. Engel)

  13. About the ratio of the size of a maximum antichain to the size of a maximum level in finite partially ordered sets, Combinatorica, 1985, v. 5, N 4, pp. 301 - 309. (coauthor K. Engel).

  14. Parallelization of arithmetic expressions with logarithmic bounds on rounding errors (in Russian), Sb. Questions in cybernetics, 1984, Moscow, Academy of Science of the USSR.

  15. On constructions of multiprocessor and pipe-lined schedulings close to optimal (in Russian), Sb. Voprosi kibernetiki. Design and Applications of Supercomputers, M., 1987, pp. 84 - 95.

  16. Sorting on vector and pipe-lined computers (in Russian), in: Cybernetics Questions. Effective computations on supercomputers, M., 1988. (coauthor T.V.Poljakova).

  17. Linear boolean programming and some combinatorial problems (in Russian), Computer and the Choice Problem, Moscow, Nauka, 1989, pp. 144 - 160.

  18. Asymptotically exact polynomial algorithms for integer linear programming (in Russian), Discretnaja Matem., 1989, v.1, N 2, pp. 78 - 85, (translated in English in Discrete Math. and Applications).

  19. Parallel computations: theory and algorithms (in Russian), Programming, 1991, N 2 (coauthor M.A. Frumkin)

  20. Parallel computations: theory and algorithms (in Russian), Itogi nauki, Computer science, VINITI, 1991, v. 8, pp. 3 - 211. (coauthor M.A.Frumkin).

  21. On the relationship between the optima of linear and integer linear programming (in Russian), Discretnaja Matem., 1991, v.3, N 1, pp. 98 - 104 (translated in English in Discrete Math. and Applications).

  22. On the automorphism conjecture for products of ordered sets. Order, 1992, v. 9, P. 205-208.

  23. A parallel O(log2 n)-time algorithm for set balancing problem, Discrete Math. (in Russian, translated in English in Discrete Math. and Applications), 1992, v. 3, N 4.

  24. On (n,k,l, Delta)-systems, Preprint, Glasgow University, 1993 (coauthor S.D.Cohen).

  25. Multiprocessor scheduling and expanders, Information Process. Letters, 1994, v. 51, N 6, P. 315-319.

  26. On a covering radius of equal-weight codes, Preprint, Glasgow University, 1994 (coauthor S.D.Cohen).

  27. A parallel algorithm for fixed-dimensional linear programming, Parallel Algorithms and Applications, 1995, v. 5, N 34, P. 17-24 (coauthor L.V. Shabanov).

  28. On the difference between asymptotically good packings and coverings, European J. Combinatorics, 1995, v. 16, P. 35-40.

  29. On (n,k,l,Delta)-systems, Proc. Edinburg Math. Soc., 1995, v. 38, P. 53-62 (coauthor S.D. Cohen).

  30. A distributed algorithm for solving systems of Boolean equations, in: Questions in cybernetics. System programming applications, Moscow, VINITI, 1995, pp. 230-241 (coauthor Leonid V. Shabanov).

  31. Multiprocessor schedulings and combinatorial configurations, Discrete Math., 1995, v. 7, N 2, pp. 77-87.

  32. Metric relations in integer programming. Russian Math. Doklady. 1995, v. 340, N 3, P. 308-310.

  33. An algorithm for integer programming polynomial in the average case. Russian Math. Doklady. 1995, v. 343, N 1.

  34. Metric aspects of integer programming. - Discrete Math. (in Russian, translated in English in Discrete Math. and Applications), 1994, v. 6, N 4, P. 87-106.

  35. An algorithm for integer programming polynomial in the average case, Siberian Journal of Operation Research (in Russian, translated in English in Discrete Analysis and Operation Research), 1994, v. 1, N 3, P. 38-48.

  36. On maximal alpha-height of (0,1)-matrices from Ryser's classes Russian Math. Doklady. 1996, v. 350, N 1, P. 12-13 (in Russian).

  37. Bounds of optima of covering integer linear problems, In "Combinatorial Models and Methods", N 2, Moscow, Computer Center, 1997, P. 57-72 (in Russian).

  38. On a combinatorial problem related with bounds of dimension of posets, In "Combinatorial Models and Methods", N 2, Moscow, Computer Center, 1997, P. 10-14 (in Russian).

  39. Approximations of integer linear programs, In. "Combinatorial Models and Methods", 1995, P. 5-14 (in Russian).

  40. Almost optimal enumeration of asymptotically good packings and coverings, In "Combinatorial Optimization Methods", Moscow, Computer Center, 1997, P. 12-29 (in Russian).

  41. Distributed desicion making, In "Combinatorial Optimization Methods", Moscow, Computer Center, 1997, P. 30-36 (in Russian).

  42. On the complexity of constructions of asymptotically good packings and coverings, Russian Math. Dokl. 1998, v. 363, N 1.

  43. On a conjecture of Kierstead, Preprint 97-111, SFB 343, Bielefeld University, 1997.

  44. Locally explicit constructions of Rodl's asymptotically good packings, Proc. 23rd Int. Symp. Mathematical Foundations in Computer Science MFCS'98, Lecture Notes in Computer Science, v. 1450, 1998, Springer, pp. 194-202.

  45. On the number of nearly perfect matchings in almost regular uniform hypergraphs, Discrete Math., v. 207, 1999, 1-8 (coauthor A. Asratian).

  46. On optima of generalized covering integer programs, Lulea University, Dep. of Mathematics, Research Report 7, 1999 (coauthor A. Asratian).

  47. New class of 0-1 integer programs with efficient approximation, Lulea University, Dep. of Mathematics, Research Report 8, 1999 (coauthor A. Asratian, to appear in Math. Methods in Oper. Research).

  48. Two sensitivity theorems in fuzzy integer programming, Lulea University, Dep. of Mathematics, Research Report 2, 2000 (to appear in Discrete Applied Math., coauthor A. Asratian).

  49. Approximations optima of packing-covering integer programs, Discret. Math., v. 12 (1), 2000, 96-106 (coauthor A. Asratian).

  50. On the number of Partial Steiner systems, J. of Combinatorial Designs, v. 8, 2000, 347-352 (coauthor A. Asratian).

  51. Explicit constructions of Rodl's asymptotically good packings and coverings, Combinatorics, Probability and Computing, v. 9, 2000, 265-276.

  52. On the packing radius and the covering radius of equal-weight codes, Discrete Math., v. 213, 2000, 35-42 (coauthor S.D. Cohen).