RUS  ENG
Full version
PEOPLE

Tarasov Vyacheslav Vladimirovich

Publications in Math-Net.Ru

  1. Construction of Virus-Free Switching Circuits

    Probl. Peredachi Inf., 42:4 (2006),  87–90
  2. To the Problem of Realizability of Boolean Functions by Circuits in a Basis of Unreliable Functional Elements

    Probl. Peredachi Inf., 42:2 (2006),  94–100
  3. To the Problem of Expressibility in the Algebra of Partial Boolean Functions

    Probl. Peredachi Inf., 41:1 (2005),  68–73
  4. Stochastic approximation of a nonlinear Boolean function

    Zh. Vychisl. Mat. Mat. Fiz., 45:6 (2005),  1146–1152
  5. On Indication of External Factors by Circuits of Multivalued Functional Elements

    Probl. Peredachi Inf., 40:1 (2004),  79–84
  6. Boolean Functions with Improper Parameters

    Probl. Peredachi Inf., 39:2 (2003),  75–79
  7. Stochastic approximation of Boolean functions

    Zh. Vychisl. Mat. Mat. Fiz., 43:8 (2003),  1249–1259
  8. Stochastic approximation of Boolean functions

    Zh. Vychisl. Mat. Mat. Fiz., 41:3 (2001),  508–512
  9. Boolean Functions with External Parameters

    Probl. Peredachi Inf., 36:4 (2000),  113–116
  10. On Realizability in the Algebra of Unreliable Generalized Contacts

    Probl. Peredachi Inf., 33:1 (1997),  107–111
  11. On the Synthesis of Circuits Using Unreliable Generalized Contacts

    Probl. Peredachi Inf., 31:4 (1995),  63–68
  12. Asymptotics of the Shannon Function for Switching Circuits in the Sheffer Stroke Basis with Partial Unreliability

    Probl. Peredachi Inf., 29:1 (1993),  74–81
  13. Realization of functions of a logic algebra, not defined everywhere

    Mat. Zametki, 32:1 (1982),  89–96
  14. The synthesis of reliable circuits from unreliable elements

    Mat. Zametki, 20:3 (1976),  391–400
  15. The completeness problem for systems of functions of the algebra of logic with unreliable realization

    Mat. Sb. (N.S.), 98(140):3(11) (1975),  378–394


© Steklov Math. Inst. of RAS, 2026