Cybernetics and Systems Analysis

0.0(top 100%)

impact factor

3.4K(top 5%)

papers

5.6K(top 20%)

citations

29(top 20%)

h-index

0.0(top 100%)

impact factor

3.5K

all documents

5.9K

doc citations

49(top 20%)

g-index

Top Articles

#	Title	Journal	Year	Citations
1	Speech discrimination by dynamic programming	Cybernetics and Systems Analysis	1972	181
2	Cut-off method with space extension in convex programming problems	Cybernetics and Systems Analysis	1977	145
3	Class of global minimum bounds of polynomial functions	Cybernetics and Systems Analysis	1988	135
4	Range and degree of realizability of formulas in the restricted predicate calculus	Cybernetics and Systems Analysis	1972	124
5	Galois theory for post algebras. I	Cybernetics and Systems Analysis	1972	109
6	Failure diagnosis of automata	Cybernetics and Systems Analysis	1975	98
7	Semisimple cyclic and Abelian codes. II	Cybernetics and Systems Analysis	1970	93
8	The chromatic class of a multigraph	Cybernetics and Systems Analysis	1965	76
9	Isometric subgraphs of Hamming graphs and d-convexity	Cybernetics and Systems Analysis	1988	72
10	On the method of generalized stochastic gradients and quasi-F�jer sequences	Cybernetics and Systems Analysis	1972	71
11	Methods of solution of nonlinear extremal problems	Cybernetics and Systems Analysis	1968	66
12	Complexity of common subsequence and supersequence problems and related problems	Cybernetics and Systems Analysis	1990	64
13	Simple pursuit by several objects	Cybernetics and Systems Analysis	1976	64
14	A generalized URN problem and its applications	Cybernetics and Systems Analysis	1983	63
15	Efficient algorithm for finding all minimal edge cuts of a nonoriented graph	Cybernetics and Systems Analysis	1986	60
16	Automata theory and structural design problems of digital machines	Cybernetics and Systems Analysis	1965	56
17	On the theory of group codes	Cybernetics and Systems Analysis	1969	56
18	Galois theory for Post algebras. II	Cybernetics and Systems Analysis	1969	55
19	The algebras of partial functions and their invariants	Cybernetics and Systems Analysis	1981	55
20	Utilization of the operation of space dilatation in the minimization of convex functions	Cybernetics and Systems Analysis	1972	53
21	Two problems of sequential analysis	Cybernetics and Systems Analysis	1969	47
22	Conditions for invariance of set diameters under d-convexification in a graph	Cybernetics and Systems Analysis	1984	43
23	Sequential optimization algorithms and their application. Part I	Cybernetics and Systems Analysis	1965	42
24	Stochastic models and methods of optimization	Cybernetics and Systems Analysis	1976	42
25	Automata theory and formal microprogram transformations	Cybernetics and Systems Analysis	1966	41
26	A minimization method using the operation of extension of the space in the direction of the difference of two successive gradients	Cybernetics and Systems Analysis	1974	41
27	Correct algebras over sets of incorrect (Heuristic) algorithms. II	Cybernetics and Systems Analysis	1978	36
28	The penalty method in convex programming	Cybernetics and Systems Analysis	1971	35
29	Element-wise recognition of continuous speech composed of words from a specified dictionary	Cybernetics and Systems Analysis	1971	35
30	Equilibrium situations in dynamic games	Cybernetics and Systems Analysis	1975	30
31	Convergence rate of the gradient descent method with dilatation of the space	Cybernetics and Systems Analysis	1973	29
32	An approach to obtaining global extremums in polynomial mathematical programming problems	Cybernetics and Systems Analysis	1988	28
33	Stability, parametric, and postoptimality analysis of discrete optimization problems	Cybernetics and Systems Analysis	1984	26
34	Decomposition of graphs	Cybernetics and Systems Analysis	1985	26
35	Bounding algorithm for the routing problem with arbitrary paths and alternative servers	Cybernetics and Systems Analysis	1987	26
36	The rate of convergence of the generalized gradient descent method	Cybernetics and Systems Analysis	1972	25
37	Single-step Bayesian search method for an extremum of functions of a single variable	Cybernetics and Systems Analysis	1976	25
38	Minimization of multiextremal functions under nonconvex constraints	Cybernetics and Systems Analysis	1987	25
39	Models and methods of solution of quadratic integer programming problems	Cybernetics and Systems Analysis	1988	24
40	Family of algorithms for solving convex programming problems	Cybernetics and Systems Analysis	1980	22
41	Computation complexity of the range of a polynomial in several variables	Cybernetics and Systems Analysis	1986	22
42	Differentiability with respect to a parameter of the optimal value in parametric problems of mathematical programming	Cybernetics and Systems Analysis	1976	22
43	Syntactic analysis of two-dimensional visual signals in the presence of noise	Cybernetics and Systems Analysis	1977	20
44	Pursuit of a group of evaders by a single controlled object	Cybernetics and Systems Analysis	1988	20
45	Correct algebras over sets of incorrect (Heuristic) algorithms. I	Cybernetics and Systems Analysis	1977	20
46	Differential games of prescribed duration	Cybernetics and Systems Analysis	1973	19
47	Multivalued threshold functions	Cybernetics and Systems Analysis	1975	19
48	The quasigradient method for the solving of the nonlinear programming problems	Cybernetics and Systems Analysis	1975	19
49	Applications of limit theorems for switching processes	Cybernetics and Systems Analysis	1979	19
50	Syntax and semantics of formal languages	Cybernetics and Systems Analysis	1968	19

Scientometrics

Overviews

Citing Bodies

Cybernetics and Systems Analysis

Top Articles