null Chubarikov, Vladimir N. / Ershov, Yu. L. / Prokhorov, Yuri V.
6 Issues per year
Issues
Volume 22 (2012)
Volume 21 (2011)
Volume 20 (2010)
Volume 19 (2009)
Volume 18 (2008)
Volume 17 (2007)
Volume 16 (2006)
Volume 15 (2005)
Volume 14 (2004)
Volume 13 (2003)
Volume 11 (2001)
Volume 10 (2000)
Volume 9 (1999)
Volume 8 (1998)
Volume 7 (1997)
Volume 6 (1996)
Volume 5 (1995)
Volume 4 (1994)
Volume 3 (1993)
Volume 2 (1992)
Issue 5-6 (December 2010), pp. 467 - 708
Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
Page 467
Published Online: 2011
Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions
Page 487
Published Online: 2011
On conditional Internet graphs whose vertex degrees have no mathematical expectation
Page 509
Published Online: 2011
An estimate of the probability of localisation of the diameter of a random scale-free graph
Page 525
Published Online: 2011
On the distribution of some characteristics of a quasimonotone mapping
Page 553
Published Online: 2011
An algorithm to restore a linear recurring sequence over the ring R = Z pn from a linear complication of its highest coordinate sequence
Page 591
Published Online: 2011
The uniform id-decomposition of functions of many-valued logic over homogeneous functions
Page 611
Published Online: 2011
The completeness problem in the function algebra of linear integer-coefficient polynomials
Page 621
Published Online: 2011
Complexity of multiplication in commutative group algebras over fields of prime characteristic
Page 665
Published Online: 2011
The asymptotics of the number of repetition-free Boolean functions in the basis B 1
Page 707
Published Online: 2011
Comments (0)